Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-14
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.

A Suslin tree yields a Suslin line

Statement

In ZFC, if a Suslin tree exists, then a Suslin line exists in the strong published convention.

Facts & Assumptions

Given: A Suslin tree T. Assume AC.

[F1]

A strong-convention Suslin line is nonempty, dense, has no endpoints, is boundedly complete, has no countable order-dense subset, and has only countable families of pairwise disjoint nonempty open intervals. Suslin lines in order language

[F2]

Every Suslin tree has an infinitely splitting normal Suslin refinement in ZFC. Every Suslin tree has a normal splitting refinement

[F3]

The maximal branches of that refinement carry a dense no-endpoint ccc first-difference order in which every nonempty open interval is nonseparable. The first-difference order on branches

[F4]

Completing such an order and deleting possible endpoints preserves density, bounded completeness, ccc, and absence of separable nonempty intervals. Linear-order completion and density

[A1]

AC is the choice principle used by the refinement, branch, and completion constructions. The Axiom of Choice

Proof

1.1

Apply F2 to T and obtain an infinitely splitting normal Suslin refinement S.

F2A1given
2.1

By F3, the maximal branches of S, ordered at their first differing successor, form a nonempty dense linear order L without endpoints. The order has no uncountable pairwise disjoint family of nonempty open intervals, and every nonempty open interval of L is nonseparable.

F3A1step 1.1
3.1

Take the exact completion of L and delete its possible first and last points. By F4 the resulting order M is nonempty, dense, has no endpoints, is boundedly complete, satisfies the interval ccc, and has no separable nonempty open interval. In particular M itself has no countable order-dense subset: if such a set existed, it would be dense in every nonempty open subinterval, contradicting the preceding property. Thus every clause of F1 holds, so M is a Suslin line in the published convention. All three constructions are in ZFC and their uses of choice are exactly those recorded by the supplying lemmas; the implication is not asserted in ZF.

F1F4A1step 2.1

Depends on

Used by

Dependency tree · two levels

19 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