Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 2026-09-22
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.

Sweet density transfers along complete suborders

Statement

Assume ZFC. Let P be a complete suborder of B+=BA(Q){0B} (write B=BA(Q)), let (Q,D,(En)) be a sweetness model, and let (Aj)j<ω be subsets of P whose union is dense in P. Write e:QB{0B} for the canonical dense completion map, and use Shelah's quotient convention

pPqQ/Pevery p0P with p0p is compatible in B with e(q).

Suppose qD and pP forces qQ/P. Then some j,k<ω have the following uniform property: for every qEkq there is pAj with pp which forces qQ/P. Moreover, the union of all Aj for which such a k exists is dense below p. This is the full two-part conclusion of Claim 7.4 of the source, in the library order.

Facts & Assumptions

Given: ZFC and the objects and quotient convention in the Statement.

[F1]

Shelah sweetness models for forcing: (Q,D,(En)) satisfies the sequential clause and the transfer clause, and its En-classes are downward directed. The same definition says that P is a complete suborder of B when its order and incompatibility are inherited from B+ and every maximal antichain of P remains maximal in B+.

[F2]

Choice-free regular open completion of forcing preorders (with forcing equivalence as in Forcing equivalence and Boolean completion) and Completeness, regular opens, and order continuity: the canonical map e:QB{0B} preserves order, preserves and reflects compatibility, and has order-dense image. It need not be injective or reflect the original order.

[F3]

By the displayed quotient convention, pPqQ/P is monotone in p and upward closed in q: if pp and qq, then pPqQ/P implies pPqQ/P.

[F4]

The Axiom of Choice supplies choices from nonempty witness sets. Under this assumption Zorn's lemma gives a maximal element of any nonempty poset in which every chain has an upper bound.

[F5]

N×NN gives the unique decomposition of every positive natural into 2m(2r+1). Thus define n(i)=m from i+1=2m(2r+1) for every iN.

Proof

1.1

Fix the canonical surjection n(i)=m where i+1=2m(2r+1), For fixed m, the indices i=2m(2r+1)1 as r varies are unbounded, so m occurs arbitrarily late; in particular n(0)=0.

F5
1.2

The Boolean conditions p and e(q) are compatible in B: the quotient hypothesis applied to p0=p says exactly that they are compatible.

F3
2.1

For each i<ω, use [F4] to choose qiD with qiEiq so that, whenever there exists qEiq for which no pAn(i) satisfies pp and pqQ/P, the chosen qi has that property. The admissible set is nonempty: choose a bad witness if one exists, and otherwise use q itself.

F1F4step 1.1
2.2

There is rD with rq and e(r)p. Indeed step 1.2 gives a nonzero bpe(q) in B. Density of e[Q] supplies sQ with e(s)b. Then e(s) and e(q) are compatible, so compatibility reflection in [F2] supplies a common strengthening ts,q in Q. Finally density of D supplies rD with rt. Order preservation gives e(r)e(s)p, while rq.

F1F2step 1.2
3.1

There is k<ω such that every qEkq has e(q) compatible with p. Apply the comparable form of the transfer clause to rq at n=0. It supplies k such that every qEkq has some rE0r with rr,q. Hence e(r)e(r)p and e(r)e(q), so e(r) witnesses the required Boolean compatibility.

F1F2step 2.2
3.2

The sequence (qi) extends to the diagonal witness: since qiEiq and Ei refines Ek for all ik, the sequential clause applied to the sequence with last term q gives qD with qEkq and qqi for every ik.

F1step 2.1
4.1

Since qEkq, step 3.1 makes e(q) compatible with p. We claim that some pp in P forces qQ/P. Otherwise the quotient convention makes C={sP:sp and sBe(q)} dense below p in P. Apply [F4] to the poset of antichains contained in C, ordered by inclusion: the empty antichain is present and unions bound chains because any two elements of a chain union occur together in one antichain. Obtain a maximal such A. It is predense below p: otherwise a condition below p incompatible with all of A has a strengthening in C that could be added. Apply the same argument to antichains of P containing A to obtain a maximal antichain M of P. Every member of MA is incompatible with p: if such an m were compatible with p, a common strengthening in P would be compatible with some member of the predense antichain A below p, contradicting that M is an antichain. By completeness of the suborder [F1], M is maximal in B. But a common Boolean strengthening of p and e(q) is incompatible with every member of A (by the definition of C) and every member of MA (because they are incompatible with p), contradicting maximality in B. This proves the claim. Now choose pAj below p from the dense union of the Aj. Then pp and pqQ/P; by upward closure in [F3], it also forces every qQ with qq into the quotient.

F1F3F4step 3.1step 3.2
5.1

Choose ik with n(i)=j, possible by step 1.1. Then pAn(i) satisfies pp and, since qqi, forces qiQ/P; so qi is not bad at level i. By step 2.1 the existence of a bad witness at level i would have forced qi to be bad, hence no qEiq is bad for An(i): for every qEiq there is pAj with pp and pqQ/P. Thus the pair (Aj,i) has the uniform property required in part (1) of the Statement.

step 1.1step 2.1step 4.1
6.1

Let A={Aj:for some k, Aj has the uniform property for k}. Given p0p, the hypothesis p0qQ/P holds by monotonicity [F3], so the argument of steps 1.2 through 5.1 with p0 in place of p produces j,k such that every qEkq, in particular q=q, has a condition pAj below p0 forcing qQ/P; The uniform property below p0 implies the one below p since every witness below p0 is below p, so this Aj is included in A. Hence A meets every strengthening of p and is dense below p.

F3step 5.1
7.1

The steps above establish both conclusions of the Statement.

step 5.1step 6.1

Depends on

Used by

Dependency tree · two levels

47 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