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.

Kurepa equivalence

Statement

In ZFC the following are equivalent:

  1. a Suslin tree exists;
  2. a Suslin line exists;
  3. a Suslin algebra exists.

Consequently the Suslin Hypothesis is equivalent both to the nonexistence of a Suslin tree and to the nonexistence of a Suslin algebra.

Facts & Assumptions

Given: ZFC, including AC.

[F1]

SH says that no Suslin line exists, and the Suslin-line and Suslin-algebra conventions are fixed. The Suslin Hypothesis and Suslin algebras

[F2]

A Suslin tree yields a Suslin line. A Suslin tree yields a Suslin line

[F3]

A Suslin line yields a Suslin tree. A Suslin line yields a Suslin tree

[F4]

Every Suslin tree has a normal splitting Suslin refinement. Every Suslin tree has a normal splitting refinement

[F5]

The regular-open completion of the reverse order of a normal splitting Suslin tree is a Suslin algebra. A Suslin tree has a Suslin regular-open algebra

[F6]

Every Suslin algebra yields a normal splitting Suslin tree. Refining antichains of a Suslin algebra form a tree

[A1]

AC is available and its use in all four constructions is propagated. The Axiom of Choice

Proof

1.1

Write ST, SL, and SA for the respective existence assertions in clauses 1-3. These are genuine existence statements under the fixed nonempty, nontrivial conventions in F1 and the cited tree interfaces.

F1construct
2.1

If ST holds, F2 constructs a Suslin line, so STSL. Conversely, if SL holds, F3 constructs a Suslin tree, so SLST. Hence STSL.

F2F3A1step 1.1
2.2

If ST holds, first apply F4 to obtain a normal splitting Suslin tree, then apply F5 to its reverse-order regular-open completion. The output is a Suslin algebra, so STSA.

F4F5A1step 1.1
3.1

Conversely, F6 sends any Suslin algebra to a normal splitting Suslin tree, so SAST. Together with step 2.2 this gives STSA.

F6A1step 1.1step 2.2
4.1

Steps 2.1, 2.2, and 3.1 prove the three-way equivalence. By F1, SH is ¬SL; negating either proved biconditional gives ¬SL¬ST¬SA. Thus SH is equivalent to either stated nonexistence assertion. This proof uses only the five fully authored construction suppliers and not the earlier Recorded Kurepa remark.

F1step 2.1step 2.2step 3.1

Depends on

Used by

Dependency tree · two levels

23 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