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 has a Suslin regular-open algebra

Statement

Let T be a normal splitting Suslin tree and let P be its reverse forcing order. In ZFC the regular-open completion B=RO⁡(P) is a nontrivial complete atomless ccc Boolean algebra satisfying the exact diagonal countable-distributivity law. Hence B is a Suslin algebra.

Facts & Assumptions

Given: A normal splitting Suslin tree T, its reverse forcing order P, and AC.

[F1]

A Suslin algebra is a nontrivial complete atomless ccc Boolean algebra satisfying the displayed diagonal distributive identity. The Suslin Hypothesis and Suslin algebras

[F2]

The reverse order of a normal Suslin tree is ccc and ℵ1-distributive. Normal Suslin-tree forcing is countably distributive

[F3]

The regular-open completion has a dense nonzero embedding e:P→B+ that preserves and reflects compatibility. Choice-free regular open completion of forcing preorders

[F4]

Regular open sets form a complete Boolean algebra; their order is inclusion and finite meets are intersections. Regular open algebra in ZF

[A1]

AC supplies simultaneous representatives below arbitrary nonzero Boolean antichains. The Axiom of Choice

Proof

1.1F3F4given

By F3-F4, B is a complete Boolean algebra and each 0<b∈B has some tree condition t with 0<e(t)≤b. Since P is nonempty, its underlying space is nonempty, so the regular-open bounds 0=∅ and 1=P are distinct. Thus B is nontrivial.

2.1F3step 1.1given

Let 0<b∈B and choose t with e(t)≤b. Splitting supplies two distinct immediate tree successors s,u of t. They are incompatible, so F3 gives nonzero disjoint elements e(s),e(u)≤e(t)≤b. Therefore 0<e(s)<b, proving atomlessness.

2.2F2F3A1step 1.1

Let X⊆B+ be pairwise disjoint. By A1 and density of e, choose tb∈P with e(tb)≤b for every b∈X. If b≠c, compatibility of tb,tc would make e(tb)∧e(tc) nonzero by F3, while it lies below b∧c=0. Thus the tb form a forcing antichain; they are distinct and F2 makes X countable. Hence B is ccc.

2.3F2F3F4step 1.1

Fix a double sequence (bn,m)n,m<ω in B and put c=⋀n⋁mbn,m and r=⋁f∈ωω⋀nbn,f(n). Always r≤c. In any complete Boolean algebra, a∧⋁X=⋁x∈X(a∧x): the right side is below a∧⋁X, and if y bounds all a∧x, then ¬a∨y bounds X, giving a∧⋁X≤y. Suppose 0<d=c∧¬r and choose p0 with e(p0)≤d. For each n, let Dn contain the conditions q such that either q is incompatible with p0, or e(q)≤bn,m for some m. This set is open. It is dense: if q is compatible with p0, take q′≤q,p0; since e(q′)≤c≤⋁mbn,m, the just-proved distributive identity makes some e(q′)∧bn,m nonzero, and density of e plus compatibility reflection gives an actual s≤q′ with e(s)≤bn,m. By F2 choose q≤p0 in every Dn. Then incompatibility with p0 is impossible. Let f(n) be the least m with e(q)≤bn,m. Completeness gives e(q)≤⋀nbn,f(n)≤r, while e(q)≤e(p0)≤¬r, a contradiction. Therefore d=0, so c≤r and the exact diagonal law holds.

3.1F1A1step 1.1step 2.1step 2.2step 2.3∎

Steps 1.1-2.3 give nontriviality, completeness, atomlessness, ccc, and precisely the identity in F1. Therefore B is a Suslin algebra. AC is used only at step 2.2 for a set-indexed simultaneous selection and through the already declared distributivity supplier; the regular-open construction itself is choice free.

Depends on

Used by

Dependency tree · two levels

21 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