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.

MA(aleph-one) eliminates Suslin trees

Statement

In ZFC, MA(1) implies that no Suslin tree exists.

Facts & Assumptions

Given: ZFC and MA(1).

[F1]

MA(1) supplies a filter meeting any family of at most 1 dense subsets of a nonempty ccc forcing partial order. Martin's Axiom at a cardinal and Martin's Axiom

[F2]

The finite-specialization forcing P(T) consists of finite natural-valued partial maps separating comparable tree nodes, is ordered by reverse inclusion, and contains the empty condition. Finite specializing conditions

[F3]

For every Aronszajn tree, P(T) is ccc. Finite specialization of an Aronszajn tree is ccc

[F4]

Each node-domain set Dt is dense in P(T), and the union of a nonempty downward-directed family meeting every Dt is a total specializing map Tω. Dense domains and directed unions of specializing conditions

[F5]

A Suslin tree is an Aronszajn tree of height ω1 with countable levels and no uncountable antichain; the fibers of a specializing map are antichains. Aronszajn, Suslin and special trees

[F6]

A countable union of countable sets is countable under countable choice. Countable unions of at most countable sets, assuming ACω

[F7]

For an infinite cardinal κ and nonzero λκ, the product cardinal κλ equals κ. Absorption: for cardinals κ,λ with κ infinite and λκ, κλ=κ, and κλ=κ when λ0

[F8]

Injections both ways between two sets yield a bijection. The Schröder-Bernstein theorem

[A1]

AC supplies simultaneous level enumerations and representatives and includes countable choice. The Axiom of Choice

Proof

1.1

Suppose toward a contradiction that T is a Suslin tree. Every level Tα is nonempty: height ω1 gives a node above any prescribed α, and its predecessor well-order has a node of height α. By AC choose tαTα and an injection eα:Tαω for every α<ω1. Then αtα injects ω1 into T, while t(ht(t),eht(t)(t)) injects T into ω1×ω. F7 gives ω1×ω=1, and F8 applied to the two displayed injections gives T=1.

F5F7F8A1chooseassume-contra
2.1

Form P(T). It is nonempty because it contains the empty condition by F2, and it is ccc by F3 because T is Aronszajn. The family D={Dt:tT} has size at most T=1, and every member is dense by F4. Apply F1 to obtain a filter GP(T) meeting every Dt. Because T and hence D are nonempty, this filter is nonempty; its filter directedness has exactly the orientation required by F4.

F1F2F3F4F5step 1.1
3.1

By F4, f=G is a total specializing function Tω. For each n<ω, the fiber An=f1({n}) is a tree antichain by F5. Since T is Suslin, each An is countable, but T=n<ωAn would then be countable by F6 and A1. This contradicts T=1 from step 1.1, because 1 is uncountable.

F4F5F6A1step 1.1step 2.1
4.1

Therefore no Suslin tree can exist under MA(1). AC is spent at step 1.1 and through the ccc and countable-union suppliers; the dense-set union lemma itself makes no choice.

A1step 3.1discharge-contradiction

Depends on

Used by

Dependency tree · two levels

38 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