Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

The Cantor set contains no interval of positive length yet has no isolated point, so every connected subset of it is a single point

Example

The Cantor set C (The Cantor middle-thirds set as the intersection of the sets Cn obtained by removing open middle thirds) has two properties that sound incompatible and are not:

  1. it is perfect (Perfect subset of R: closed with no isolated points): closed, and every one of its points is a limit of other points of C;
  2. it contains no interval with two distinct endpoints, and consequently every nonempty connected subset of C (Separated sets, disconnection, and connected subset of R) is a single point.

Both are claims of The Cantor set is compact, perfect, uncountable, nowhere dense and of measure zero, and it contains no interval of positive length, so its only nonempty connected subsets are single points; this item spells out what they say together and why they do not conflict. A set can be clustered everywhere and nowhere thick: every neighbourhood of a point of C contains other points of C, and yet no two points of C are joined by a segment lying in C. (Not "on both sides": C⊆[0,1] and both 0 and 1 lie in C, so the endpoints have points of C approaching them from one side only. Having no isolated point is the claim, and it does not require approach from both sides.)

On the phrase "totally disconnected". That is the usual name for property 2, and no definition of it exists at this point in the reading order; the phrase appears here only as a gloss, never as the claim. What is asserted is exactly property 2 as displayed, obtained from A subset of R is connected if and only if it is order-convex, that is, an interval.

Facts & Assumptions

[A1]

Nothing is assumed beyond the results cited; the item records a consequence of them.

[L1]

C is closed, perfect, contains no interval with two distinct endpoints, and every nonempty connected subset of C is a single point (The Cantor set is compact, perfect, uncountable, nowhere dense and of measure zero, and it contains no interval of positive length, so its only nonempty connected subsets are single points, claims 1, 3, 5, 6).

[L4]

Every point of C is Φ(a) for a unique {0,2}-valued sequence a, and changing one digit of a produces another point of C (The Cantor set is exactly the set of ∑k≥1ak3−k with every ak∈{0,2}, and this gives a bijection with {0,1}N).

Verification

technique · direct
1.1

C is perfect by claim 3 of [L1]: it is closed, and by [L2] no x∈C admits a real ε>0 with Nε(x)∩C={x}. Concretely, the second point inside Nε(x) is obtained by changing one sufficiently late ternary digit of x, which moves the point by 2⋅3−k−1 ([L4]).

A1L1L2L4
1.2

C contains no interval [u,v] with u<v, by claim 5 of [L1]; this is where the measure-zero property of C is spent, a null set containing no such interval.

A1L1
2.1

Every nonempty connected E⊆C is a single point: by [L3] such an E is order-convex, so two distinct points u<v of E would give [u,v]⊆E⊆C, contradicting step 1.2; and E is nonempty. This is claim 6 of [L1].

step 1.2L1L3∎

Remarks

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

51 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources