Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-09
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.

Splitting turns an uncountable branch into an antichain

Statement

In ZFC, a splitting ω1-tree with a cofinal branch has an antichain of cardinality 1. Normality is not additionally required. Here ω1-tree has the meaning of κ-trees and the tree property.

Facts & Assumptions

Given: A splitting ω1-tree T and a cofinal branch b.

[F1]

Splitting gives at least two immediate successors of every node whose successor height is below the tree height. Normal and splitting trees

[F2]

Every node has a unique predecessor of each smaller height; common predecessors are comparable, and strict order strictly increases height. Tree predecessors and compatibility

[A1]

Assume AC, used to select off-branch successors at all levels simultaneously. The Axiom of Choice

Proof

1.1

For each α<ω1, cofinality gives vb of height at least α. If its height is greater, let u be its unique predecessor of height α; otherwise set u=v. Every wb is comparable with u: if wTv, use common-predecessor comparability, and if v<Tw, use uTv<Tw. Maximality of b therefore puts u in b. Distinct nodes of the same height cannot both belong to a chain. Thus there is a unique bαbTα for every α. For α<β, comparability and height give bα<Tbβ.

F2given
2.1

The node bα+1 is an immediate successor of bα, since an intermediate node would have height strictly between α and α+1. Conversely every immediate successor u of bα has height α+1: if its height were larger, its predecessor at α+1 would lie strictly between bα and u. Since α+1<ω1, splitting makes Sα={u:u is an immediate successor of bα, ubα+1} nonempty. AC gives aαSα for every α<ω1.

F1F2A1step 1.1
3.1

If α<β, then bα+1Tbβ<Taβ. Were aα and aβ comparable, their different heights α+1<β+1 would force aα<Taβ. The two distinct nodes aα,bα+1 of height α+1 would then be predecessors of aβ, contradicting uniqueness at that height. Thus aα,aβ are incomparable.

F2step 1.1step 2.1
4.1

Consequently {aα:α<ω1} is an antichain. Its indexing is injective because ht(aα)=α+1, so it has cardinality 1. The argument includes α=0 and adjacent levels; all successor levels used remain below ω1.

step 2.1step 3.1

Depends on

Used by

Dependency tree · two levels

8 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