Indecomposability
This definition may be confusing or unclear to readers. (November 2017) (Learn how and when to remove this template message) |
In constructive mathematics, indecomposability or indivisibility (German: Unzerlegbarkeit, from the adjective unzerlegbar) is the principle that the continuum cannot be partitioned into two nonempty pieces. This principle was established by Brouwer in 1928 using intuitionistic principles, and can also be proven using Church's thesis. The analogous property in classical analysis is the fact that any continuous function from the continuum to {0,1} is constant.
It follows from the indecomposability principle that any property of real numbers that is decided (each real number either has or does not have that property) is in fact trivial (either all the real numbers have that property, or else none of them do). Conversely, if a property of real numbers is not trivial, then the property is not decided for all real numbers. This contradicts the law of the excluded middle, according to which every property of the real numbers is decided; so, since there are many nontrivial properties, there are many nontrivial partitions of the continuum.
In CZF, it is consistent to assume the universe of all sets is indecomposable—so that any class for which membership is decided (every set is either a member of the class, or else not a member of the class) is either empty or the entire universe.
See also
References
- Dalen, Dirk van (1997). "How Connected is the Intuitionistic Continuum?". The Journal of Symbolic Logic 62 (4): 1147–1150. https://pdfs.semanticscholar.org/1f4d/2b7b38601741d08aa3d30a5054f57ca7b535.pdf.
- Kleene, Stephen Cole; Vesley, Richard Eugene (1965). The Foundations of Intuitionistic Mathematics. North-Holland. p. 155. https://archive.org/details/foundationsofint0000klee.
- Rathjen, Michael (2010). "Metamathematical Properties of Intuitionistic Set Theories with Choice Principles". in Cooper; Löwe; Sorbi. New Computational Paradigms. New York: Springer. ISBN 9781441922632. http://www.maths.leeds.ac.uk/~rathjen/tklracend.pdf.