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.

Strongly homogeneous truth has Baire representatives

Statement

Let B be the final Boolean algebra of the Shelah construction. For every formula φ(x,s,γ) with a countable ordinal-sequence parameter s and finitely many ordinal parameters γ, the set of reals x for which the B-generic extension satisfies φ(x,s,γ) differs from a Borel set by a meagre set. In particular this holds for real-and-ordinal parameters. The Borel code and meagre-error code belong to the final extension.

Facts & Assumptions

Given: The final algebra B of the CH-length construction with generic G, a formula φ, a countable ordinal-sequence parameter s, ordinal parameters γ, and the set A={x:φ(x,s,γ) holds in V[G]}.

[F1]

Real names are captured and coded meagre unions are absorbed: s is captured at some stage, and a later UM quotient absorbs the union of all meagre Borel sets coded in V[s] into one coded meagre envelope.

[F2]

Shelah's CH-length homogeneous sweet construction with Sweet amalgamation extends partial Boolean isomorphisms: complete isomorphisms between countably generated complete subalgebras extend to automorphisms of B, and the final free-amalgamation clause supplies independent copies over a fixed captured subalgebra. These are the quotient-homogeneity interfaces used in Shelah's application of Solovay's argument; no assertion that arbitrary Cohen conditions are directly conjugate is made.

[F3]

The property of Baire: a set has the Baire property when it differs from an open set by a meagre set.

[F4]

Borel-code, measure, category, and perfect-set absoluteness: Borel codes evaluate identically on shared reals; every Borel code uniformly yields an open representative modulo an explicitly coded sequence of closed nowhere-dense sets; and coded category witnesses transfer at the stated same-real interfaces.

[F5]

Forcing theorem: truth and forcing agree for generic filters, so the Cohen-generic points determine the truth value of φ at the canonical Cohen name.

[F6]

Shelah's Main Lemma 7.14(b),(c) gives automorphism extension and free amalgamation for countably generated complete subalgebras, and Theorem 7.16 invokes Solovay's argument from these clauses and the meagre-set absorption. Solovay's Part III §§1.4--1.6 first localizes at a forcing condition and then uses the category analogue of Theorem II.2.8 to obtain one Borel reading on all Cohen generics over the intermediate model. Thus the relevant interface is a compatible family of local Cohen-cone readings, not a complete embedding obtained from an arbitrary name merely forced to be Cohen-generic. [source]

Proof

1.1

By [F1], choose a stage α containing a name for s and all Boolean values used below. Enlarge to a later stage β so that the next designated quotient has the canonical UM presentation. Put M=V[s], not V[GBβ]. Then every meagre Borel set coded in M is among the sets absorbed by that quotient, exactly as [F1] states. The ordinal parameters already belong to V and hence to M. Every relevant countably generated complete subalgebra and name can be placed in a later stage because its countable set of Boolean data is bounded in the ω1 construction.

F1F2
2.1

In the ground model choose, for each coordinate of the fixed name s˙, a countable maximal antichain labelled by its decided ordinal value, and let Cs be the completion of the countable Boolean algebra generated by all members of those antichains. The labelled antichains make s˙ a Cs-name. Conversely, s determines which member of every labelled antichain lies in G: combine equal labels first, so distinct antichain members have distinct labels. Those antichains generate a countable dense subalgebra of Cs, and a generic ultrafilter is determined by its trace on a dense subalgebra. Consequently V[GCs]=V[s]=M. Choose the stage in step 1.1 to contain the countably many generators; completeness then contains Cs. For every dense open D2<ω in M, the reals whose initial-segment filters miss D form a closed nowhere-dense set coded in M. By [F1], the later UM quotient puts the union of all these sets inside one meagre set. Thus the final extension contains Cohen reals over M, by its ZFC Baire theorem. This existence assertion is not promoted to a claim that an arbitrary name for one of those reals canonically embeds the full Cohen algebra.

F1F2step 1.1
3.1

Work in M and let C be the Cohen category algebra. A local Cohen chart consists of a nonzero aB, a B-name x˙, and ax˙ is Cohen-generic over the canonical Cs-extension. The map ja,x˙(u)=ax˙uB(uC) is a complete Boolean homomorphism into Ba, but need not be injective: prepending 0 to a Cohen name kills the nonzero cylinder [1]. Its kernel is a complete ideal, hence is C¬d for a unique nonzero support dC, and the restriction ja,x˙:Cdja,x˙[C] is a complete isomorphism with top a. The complete subalgebra generated by Cs, this range, and a is countably generated. This is the required localization; no full Cohen copy is inferred from genericity of the name.

F5F6step 2.1
4.1

Put ba=aφ(x˙,s˙,γˇ)B and let C be the chart algebra from step 3.1. Inside the relative algebra below a, repeat Shelah's free-amalgamation argument. If D is generated by C{ba}, a free copy of D over C extends to an automorphism fixing C. It fixes a, the parameter name, and every Boolean value of the coordinate name below a, so it fixes ba. If the two projections of ba and aba to Ca overlapped, freeness would make ba compatible with the image of its complement, a contradiction. Hence baCa. Via the isomorphism in step 3.1 it has a unique reading ca,x˙d in the Cohen algebra, represented by a regular open, and therefore Borel, subset of d.

F2F5F6step 3.1
5.1

These local readings are coherent. On a nonzero overlap of two support elements, restrict both chart algebras to that overlap. Their coordinate isomorphism fixes Cs and sends one restricted Cohen name to the other; [F2] extends it to an automorphism of B. Since the parameters are fixed, invariance of Boolean truth sends one restricted value from step 4.1 to the other, so the two Cohen readings agree on the overlap. The family of chart supports is dense in C: from one Cohen real supplied by step 2.1, an M-coded category-algebra isomorphism into any prescribed nonzero regular open set produces a chart supported below that set. Choose a maximal antichain of chart supports. It is countable, and the coherent local readings paste to one cC, hence to one Borel code in M. Every M-Cohen-generic real meets this antichain and, by applying the same overlap argument to a chart containing its chosen name and forcing condition, satisfies V[G]φ(x,s,γ)xCc. Consequently ACc is contained in the set X of reals not Cohen-generic over M. This is precisely the local-cone step in Solovay's argument cited in [F6]; it does not assert a canonical complete copy for every generic name.

F2F5F6step 2.1step 3.1step 4.1
6.1

For each dense open D2<ω in M=V[s], the set of reals whose initial-segment filter misses D is a closed nowhere-dense set coded in V[s]. Their union is exactly X. The family need not be countable in M, but every member is among the meagre Borel sets whose codes [F1] absorbs at the designated UM quotient chosen in step 1.1. The absorption clause therefore gives in the final extension one coded meagre Fσ set E containing all of X. Hence ACcE.

F1step 1.1step 2.1step 5.1
7.1

The conclusion so far is a Borel representative, not necessarily an open one. Apply the uniform construction in [F4] to c: it gives an open code u and a coded meagre set Ec with CcUuEc. Therefore AUuEEc, and the right side is meagre. All three codes belong to the final extension. This is the explicit Borel-to-open step required by the definition of the Baire property.

F3F4step 6.1
8.1

A real is a countable ordinal sequence, so real-and-ordinal parameters are a special case. Conversely, the proof began with an arbitrary captured countable ordinal sequence s, so it does not rely on replacing s by a real unless the constructible-ground coding of [F1] is invoked later. Steps 6.1--7.1 prove the Statement.

F1step 6.1step 7.1

Depends on

Used by

Dependency tree · two levels

29 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