Let $C_n$ be the set obtained in the $n$-th step for constructing the Cantor set. It is not hard to see that $C_i \subseteq C_j$ if $i>j$ and we know that the Cantor set is $\cap_{n=0}^{\infty} C_n$. However, recently, while doing some exercise concerning number theory, I noticed that we may apply Zorn's lemma to $C_n$. Obviously, each $C_n$ is non-empty and is a subset of $[0,1]$, thus there is a partial order defined by inclusion. If we consider the chain $$C_0 \supseteq C_1 \supseteq ...\supseteq C_n \supseteq ...$$ By Zorn's lemma, it seems to me that this becomes stationary after $n$ steps(everything is trivially lower-bounded by $\varnothing$), which contradicts what we know about Cantor set. Could anyone tell me where I have made a mistake?
2026-03-27 14:02:34.1774620154
Applying Zorn's lemma to Cantor set
71 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in SET-THEORY
- Theorems in MK would imply theorems in ZFC
- What formula proved in MK or Godel Incompleteness theorem
- Proving the schema of separation from replacement
- Understanding the Axiom of Replacement
- Ordinals and cardinals in ETCS set axiomatic
- Minimal model over forcing iteration
- How can I prove that the collection of all (class-)function from a proper class A to a class B is empty?
- max of limit cardinals smaller than a successor cardinal bigger than $\aleph_\omega$
- Canonical choice of many elements not contained in a set
- Non-standard axioms + ZF and rest of math
Related Questions in AXIOM-OF-CHOICE
- Do I need the axiom of choice to prove this statement?
- Canonical choice of many elements not contained in a set
- Strength of $\sf ZF$+The weak topology on every Banach space is Hausdorff
- A,B Sets injective map A into B or bijection subset A onto B
- Equivalence of axiom of choice
- Proving the axiom of choice in propositions as types
- Does Diaconescu's theorem imply cubical type theory is non-constructive?
- Axiom of choice condition.
- How does Axiom of Choice imply Axiom of Dependent Choice?
- How does Axiom of Dependent Choice imply this weaker variant?
Related Questions in CANTOR-SET
- Removing closed sets to form Cantor Middle Third Set
- Show that $C-C=[-1,1].$
- Provide a bijection between power set of natural numbers and the Cantor set in $[0,1]$
- How to refine a covering of the Cantor set by intervals to a covering by disjoint segments?
- Finding a bijection between the Cantor set and $[0, 1]$
- Is there an uncountable collection of pairwise disjoint second category subsets of Cantor space?
- Proof that the set Gamma is the Cantor Middle-thirds Set
- If $f:[a,b]\to\mathbb{R}$ is a function of first class, does it mean that $f$ is continuous everywhere except countably many points in $[a,b]?$
- Binary representation of Cantor set?
- Find an explicit homeomorphism between the Cantor set and a proper subset of the Cantor set
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
It is important to note that you are working with a slightly different version, with "maximal" and "upper" replaced by "minimal" and "lower" respectively. Keeping that in mind, your problem arose because you have not made it completely clear what the relevant poset is. If the poset is $$\{C_0,C_1,C_2,...\}$$ with inclusion, then Zorn's lemma tells us nothing, since the chain $$\{C_0,C_1,C_2...\}$$ has no lower bound in this poset.
If the poset is $$P([0,1])$$ Then indeed Zorn's lemma guarantees that there is a minimal element, but this is trivial since $$\emptyset\in P([0,1])$$
I suspect that it is one of these that you intended, if not, once you explicitly write down the poset, and actually verify that the conditions of the lemma hold, then all confusion will disappear