Alphabeta Math
TheoremStatement: Literature-sourcedProof: Literature-sourcedPipeline-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 amalgamation extends partial Boolean isomorphisms

Statement

Let B0 and B1 be countably generated complete subalgebras of a sweet complete Boolean algebra B, and let h:B0B1 be a complete Boolean isomorphism. There is a sweet complete Boolean algebra B containing B completely in which h extends to an automorphism of B. The extension may be chosen compatibly with any previously fixed sweetness-model embedding.

Facts & Assumptions

Given: A sweetness model on B, complete subalgebras B0,B1B generated by countable sets of generators, and a complete Boolean isomorphism h:B0B1.

[F1]

Shelah amalgamation preserves sweetness: the amalgam uses two named complete embeddings of the common algebra, is sweet, and contains complete canonical copies of both factors. The named-embedding interface, rather than an untwisted amalgam of two inclusions, is what extends a partial isomorphism.

[F2]

Continuous countable unions of sweetness models remain sweet: the direct union of an increasing ω-chain of sweetness models is sweet and each stage is complete in the union.

[F3]

Completeness, regular opens, and order continuity: a Boolean completion is an order-dense Boolean embedding into a complete Boolean algebra. The definition itself does not assert that maps extend to completions.

[F4]

The Axiom of Choice: used exactly for the simultaneous selection of the countably many data that code the requests in the induction.

[F5]

Shelah, Claims 7.12-7.13: Claim 7.12 equips an amalgam of two arbitrary sweetness models with a sweetness model extending the first factor; it does not require the second factor to extend the first. Claim 7.13 then alternates that one-sided construction, and the union map extends uniquely to an automorphism of the Boolean completion.

Proof

1.1

First record the one-sided extension from the source result [F5]. Given a sweetness model on P, complete subalgebras C0,C1BA(P) and a complete isomorphism g:C0C1, take a disjoint copy P with its copy isomorphism c:BA(P)BA(P). Amalgamate the old copy and the new copy over C1, using the two complete embeddings C1BA(P),bc(g1(b))BA(P). If j0,j1 are the canonical embeddings into the amalgam, then j0(g(a))=j1(c(a))(aC0). Consequently the map g(j0(x))=j1(c(x)) is a complete isomorphism from the entire old BA(P) onto the second canonical copy and satisfies g(j0(a))=j0(g(a)) for aC0. The one-sided source conclusion recorded in [F5] equips this amalgam with a sweetness model extending the first, old factor. It places no extension requirement on the disjoint second factor. This is the twisted two-embedding construction; an untwisted identity amalgam would not extend g.

F1F5
2.1

Starting from (U0,h0)=(P,h), alternate this one-sided construction with the same construction applied to the inverse. Thus obtain an increasing ω-chain of sweetness models Ul, complete subalgebras Bl1,Bl2BA(Ul) and coherent complete isomorphisms hl:Bl1Bl2 such that B2l+11=BA(U2l),B2l+22=BA(U2l+1), and every hl+1 extends hl. Each successor sweetness model extends the previous fixed model, not merely its forcing-equivalence class.

F4F5step 1.1
3.1

Coherence is the displayed identity in step 1.1 at each even step and its inverse analogue at each odd step. The canonical old copy is complete at every successor and its sweetness presentation is fixed by the one-sided extension conclusion in [F5].

F5step 1.1step 2.1
3.2

Each Ul is sweet and Ul+1 extends the model of Ul. Therefore the direct union forcing P=lUl, with the union dense set and stabilised relations, is sweet, and every Ul is complete in P by [F2].

F2step 2.1
3.3

The same construction is compatible with a previously fixed sweetness-model embedding: start with that presentation and use [F5]'s first-factor extension conclusion at every successor.

F5step 1.1step 2.1
4.1

Put C=lBA(Ul) through the coherent complete embeddings and f0=lhl. The algebra C is a Boolean algebra, but is not asserted to be complete: every finite Boolean calculation occurs in one stage, whereas an arbitrary subset of C need not. Coherence makes f0 well defined. The domain is all of C because every element of BA(U2l) lies in B2l+11, and the range is all of C because every element of BA(U2l+1) lies in B2l+22. Thus f0 is a Boolean automorphism of C extending h.

step 2.1step 3.1
5.1

Let B=BA(P). The canonical image of P is order-dense in B and lies in C, so C is order-dense in B. The source completion clause recorded in [F5] gives the unique extension of f0 to a complete Boolean automorphism f of B. Explicitly it is determined by f(b)={f0(c):cC,cb}, and the corresponding formula for f01 supplies the inverse. This is a completion step after the alternating direct union; it does not identify C with a complete direct limit.

F3F5step 3.2step 4.1
6.1

The complete algebra B has the sweet dense forcing presentation P; no unsupported transport of the equivalence relations through the possibly noninjective completion map is used. Completeness of the stage embeddings puts the original B completely inside B. Hence B is a sweet complete Boolean algebra in this retained-presentation sense, and f is the required automorphism, compatible with the previously fixed model.

F1F2step 3.2step 3.3step 5.1

Depends on

Used by

Dependency tree · two levels

15 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