Alphabeta Math
LemmaStatement: 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.

Normal Suslin-tree forcing is countably distributive

Statement

Let T be a normal Suslin tree and order P=T by reverse tree order, so extensions in the tree are stronger forcing conditions. In ZFC, P is ccc and ℵ1-distributive (equivalently, the intersection of every countable family of dense open subsets is dense). Consequently forcing with P adds no new ω-sequences of ordinals.

Facts & Assumptions

Given: A normal Suslin tree T; P=(T,≥T) is its reverse forcing order. Assume AC.

[F1]

ℵ1-distributive means that every countable family of dense open subsets has dense intersection, and ccc means that every antichain is countable. Closure, distributivity, and chain conditions for forcing orders

[F2]

A dense set contains an extension of every condition, and an open set contains every stronger extension of each of its members. Dense open sets and generic filters over a model

[F3]

Normality extends every node to each higher tree level. Normal and splitting trees

[F4]

A Suslin tree has height ω1, countable levels, and no uncountable antichain. Aronszajn, Suslin and special trees

[F5]

Two nodes below a common tree extension are comparable, and strict tree order raises height. Tree predecessors and compatibility

[F7]

Under AC, Zorn's lemma supplies a maximal element when every chain in a nonempty poset has an upper bound. Zorn's lemma

[F8]

For an arbitrary forcing preorder, distributivity of its separative quotient prevents new sequences of ground-model elements of the corresponding shorter lengths. Closure, distributivity, and absence of new short sequences

[F9]

Under countable choice, cf⁡(ω1)=ω1. Countable choice makes omega-one regular

[F10]

A forcing extension of a transitive ground model has exactly the same ordinals as the ground model. Forcing preserves ordinals

[A1]

AC supplies Zorn's lemma, the countable choices of antichains and ordinal bounds, and countable choice. The Axiom of Choice

Proof

1.1F3F4F5given

Conditions s,t∈P are compatible exactly when they are comparable in T: a common stronger condition is a common tree extension, which makes s,t comparable by F5, while the deeper member of two comparable nodes is already a common forcing extension. Therefore forcing antichains are exactly tree antichains, and F4 makes P ccc. The unique root supplied by normality makes P nonempty.

2.1F2F4F5F6F7A1step 1.1

Let D⊆P be dense open. In the inclusion poset of antichains contained in D, the empty antichain is present and the union of every chain is an antichain contained in D; F7 gives a maximal member AD. It is maximal as a forcing antichain: for any p, density gives d≤Pp in D, and if d were incompatible with every member of AD it could be adjoined. By step 1.1, AD is countable. F6 therefore gives αD<ω1 above the heights of all its nodes. If t has height greater than αD, maximality makes it compatible with some a∈AD; comparability and the height inequality give a<Tt, hence t≤Pa, and openness puts t in D. Thus every node above level αD lies in D.

3.1F1F2F3F4F6A1step 2.1

Let (Dn)n<ω be dense open and fix p∈P. Apply step 2.1 to each Dn, using A1 for the simultaneous maximal-antichain and bound choices. By F6 the countable set {αDn:n<ω} has a bound β<ω1. Normality gives a tree extension t>Tp of height greater than β. Then t∈Dn for every n by step 2.1, and t≤Pp. Hence ⋂nDn is dense; it is open because every Dn is open. This is ℵ1-distributivity by F1.

4.1F8F9F10A1step 3.1∎

By F9, ℵ1 is regular in the stated ZFC setting. Apply F8 with κ=ℵ1 to the separative quotient of P; the quotient has the same dense-open distributivity and is forcing equivalent to P. Step 3.1 therefore implies that no sequence of ground-model elements of length below ℵ1 is added. By F10 every ordinal of a forcing extension is already a ground-model ordinal, and ω<ℵ1, so forcing with P adds no new ω-sequence of ordinals. This last assertion comes from F8 and F10, not from the definition of distributivity.

Depends on

Used by

Dependency tree · two levels

43 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