Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedaudited 2026-09-27
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.

Class-theoretic ground assumptions for Easton forcing

Definition

The class-forcing results on this page are stated over the following ground, which is the setting of the source's class-forcing section. A GBC + Global Choice + GCH ground is a pair (M,C) such that:

  • (sets) M is a countable transitive set with M⊨ZFC+GCH, that is, ZFC together with 2ℵα=ℵα+1 for every ordinal α (The successor cardinal κ+, the alephs ℵα, the beths ℶα, successor and limit cardinals, and the identifications ℵ0=ω and ℵ1=ω1);
  • (classes) C⊆P(M) is a countable collection of subsets of M, the classes of the ground, containing all M-definable subsets with set parameters, every set of M (identified with its M-elements), and the set M itself; complements relative to M and finite intersections belong to C by comprehension below;
  • (comprehension) for every formula φ(v,u1,…,um,X1,…,Xn) of the two-sorted language whose bound variables range over sets only, and all parameters a1,…,am∈M and X1,…,Xn∈C, {a∈M:(M,C)⊨φ(a,a⃗,X⃗)} is a class in C; class quantifiers are thus never used in comprehension, and every class of C is a subset of M;
  • (class Replacement) if A∈C is a functional class and a∈M, then the image {y∈M:∃x∈a (x,y)∈A} is an element of M, so set-indexed class images are sets;
  • (Global Choice) there is a class W∈C that well-orders all of M as a class of ordered pairs; equivalently, over the other GBC axioms (Williams, Fact 1.18), there is a class function choosing an element of every nonempty set of M.

The set part M alone is a transitive model of ZFC (Ordinals and omega in transitive models); the class part is kept countable on purpose, so that below there are only countably many dense classes to meet and a generic filter exists externally.

A definable Easton class function over such a ground is a function F, arising as a class of C via a fixed definition with set parameters (Easton functions on regular cardinals), that is defined on every infinite regular cardinal of M, takes cardinal values, is nondecreasing, and satisfies cf⁡(F(κ))>κ for every infinite regular κ. The Easton class product P(F) is the class of conditions of The Easton-support product of higher Cohen forcings for this F; it is a class of C, and each of its conditions is a set of M, while P(F) itself is not a set of M.

Finally, an M-generic filter for the class product is a filter G⊆P(F) (nonempty, upward closed and directed under the order p≤q⇔p⊇q, a condition being stronger the larger its domain) such that G∩D≠∅ for every D∈C that is dense in P(F). It is part of this hypothesis that such a G is available externally: since M and C are countable, and the dense classes in question form a subcollection of the countable C, such filters exist and every condition extends into one.

Existence and reading. A ground of this kind is not a theorem of ZFC. It is available, for example, from any countable transitive set M⊨ZFC+V=L: take C=Def⁡(M), the subsets definable over M with set parameters. Substituting the finitely many definitions of class parameters proves elementary comprehension; for a definable functional class, Replacement in M gives its image on each set. The constructible well-order is definable in M, providing Global Choice. There are countably many formulas and finite tuples of parameters from M, so C is countable. GCH holds in M because V=L proves GCH (The generalized continuum hypothesis holds in L). All class items on this page are therefore conditional statements about such a ground: they assert nothing in ZFC alone, and this page never claims that a countable transitive model of ZFC + GCH, or a ground of this definition, exists in ZFC.

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