Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 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.

Gitik's filter system and proper-class forcing

Definition

Work in a transitive model M of ZFC equipped with a class predicate WO which globally well-orders M, with Replacement allowed for formulas using WO. Assume that the strongly compact cardinals are unbounded in the ordinals and have been thinned so that their class has no regular limit point. List them increasingly as κξ:0<ξOrd and put κ0=ω only as a bookkeeping coordinate.

Coordinate filters

For every infinite regular cardinal α, define cf(α) and filters as follows.

  • If α<κ1, put cf(α)=α and let Φα be the co-bounded filter on α.
  • If there is a largest strongly compact κα, call α type 1, put cf(α)=α, and let Φα be the WO-least uniform κ-complete ultrafilter on α.
  • Otherwise put βα=sup{κ:κ<α is strongly compact}. The no-regular-limit-point hypothesis makes βα singular. Call α type 2, put cf(α)=cf(βα)=γα, and take the WO-least increasing sequence κνα:ν<γα of strongly compact cardinals cofinal in βα, with every term at least γα. For each ν<γα, let Φα,ν be the WO-least uniform κνα-complete ultrafilter on α.

The type-2 sequence is “coherent” here only in the stated sense: its completeness levels follow one fixed cofinal sequence and the index used at α is read from the cf(α) coordinate. No projection coherence or normality of the Φα,ν is being asserted.

Stems

For a partial function coded as a set of triples pReg×ω×Ord, put

dom1(p)={α:(n,ξ) (α,n,ξ)p},dom1,2(p)={(α,n):(ξ) (α,n,ξ)p}.

Let P1 be the definable class of such p for which dom1,2(p) is finite and, for every αdom1(p), the section p(α) is a finite one-to-one partial function from ω into α. Write rp when r and p agree at every coordinate at least κ1.

Let P2 consist of the pP1 satisfying:

  1. dom1(p) is closed under cf;
  2. dom(p(α))dom(p(cf(α))) for every coordinate α; and
  3. there are unique α(p)dom1(p) with α(p)κ1 and n(p)<ω such that the high coordinates below α(p) have section-domain n(p)+1, while those at or above α(p) have section-domain n(p).

Thus (α(p),n(p)) is the next high-coordinate slot. A pP2 is extendable when a proper extension with the same coordinate domain and the same part below κ1 remains in P2. Equivalently, it is extendable iff cf(α(p))=α(p) or (cf(α(p)),n(p))dom1,2(p). For an extendable p, let

Φp={Φα(p),cf(α(p))=α(p),Φα(p),p(cf(α(p)))(n(p)),cf(α(p))<α(p).

Measure-one trees and the forcing

For rp and UP2, write TrU={qU:qκ1=rκ1}. A condition of Gitik's forcing P3 is a pair (p,U) satisfying all ten clauses below.

  1. pP2.
  2. UP2.
  3. pU.
  4. Every qU extends p as a function and has dom1(q)=dom1(p).
  5. If rU, rp, αdom1(p), and (α,n) is an unfilled slot with α<κ1, then {ξ:r{(α,n,ξ)}U}Φα.
  6. If r1,r2U both satisfy rip, then their union belongs to U whenever it belongs to P1; moreover, if r1r2, the map qqr2 embeds Tr1U into Tr2U.
  7. If qU and aκ1×ω×κ1, then p(qa)U.
  8. If qU is extendable and cf(α(q))=α(q), its possible next values form a member of Φα(q).
  9. If qU is extendable and cf(α(q))<α(q), its possible next values form a member of Φα(q),q(cf(α(q)))(n(q)).
  10. Every qU with q≉p has a predecessor qU obtained by deleting exactly the value last inserted at (α(q),n(q)).

These clauses are the literal tree upper-part obligations: clauses 5, 8 and 9 give measure-one successor sets; clauses 6, 7 and 10 provide amalgamation, small-coordinate closure and predecessors. For conditions (q,V) and (p,U), write (q,V)(p,U), meaning stronger, when dom1(q)dom1(p) and Vdom1(p)U. On a fixed coordinate domain, a direct refinement keeps the trunk fixed and shrinks the upper tree. More generally a finite support enlargement is a direct support extension when its trunk restricts to the old trunk and its projected upper tree refines the old one.

For regular θ, let Pθ be the restriction whose coordinate domains lie below θ, adjoining the trivial empty condition when the restriction has no high coordinate. Because cf(α)α, regular initial segments are closed under the dependency map. Each Pθ is a set forcing; P3=θRegPθ is a definable proper class. The ordinary set-forcing theorem is not thereby a forcing theorem for P3.

Facts & Assumptions

Given: The model, global well-order, strongly compact class and definitions above.

[F1]

Fine measures, strong compactness and supercompactness: Strong compactness extends every proper κ-complete filter on a set to a κ-complete ultrafilter on that set.

[F2]

Strong compactness, fine measures and infinitary logic: Strong compactness is equivalently witnessed by fine κ-complete ultrafilters on every Pκ(λ); no supercompactness hypothesis is required here.

[F3]

The Axiom of Choice: Choice supports the cardinal-size calculations; the separately assumed global well-order selects one filter and one cofinal sequence uniformly at every proper-class coordinate.

Proof

1.1

The coordinate filters exist with exactly the advertised completeness. For a strongly compact κα with α regular, the co-bounded filter on α is proper and κ-complete: the union of fewer than κ sets of size below α still has size below regular α. F1 extends it to a κ-complete ultrafilter, which is uniform because it contains every co-bounded set. Apply this once at type 1 and at every κνα for type 2, then use WO to take the least choices. F2 confirms the equivalent fine-measure formulation of the large-cardinal input, but no normal fine measure or supercompactness is smuggled into the selected uniform filters.

F1F2F3
2.1

Finiteness makes the cut in clause 3 of P2 unique: below the cut all high section-domains have the larger common length and from the cut onward all have the smaller common length. Adding the next value preserves clauses 1 and 2 automatically in the type-1 case; in the type-2 case it does so exactly when the index slot at cf(α(p)) is already filled. This proves both directions of the displayed extendability equivalence and makes Φp well-defined.

step 1.1
3.1

Clauses 3–10 make every upper part a nonempty predecessor-closed branching system above its trunk, with each required successor set in the filter indexed by step 2.1. A full tree of all legal finite successors above any coherent trunk witnesses nonemptiness. A proposed pruning is an upper part only when it still satisfies every clause, including the union closure in clause 6; shrinking successor sets separately does not by itself prove this. The later pruning arguments therefore use intersections of coherent cone trees to restore clause 6 after their measure-one successor choices. Thus the definition supplies actual conditions without asserting a false blanket closure property.

step 1.1step 2.1
4.1

The forcing order is reflexive. It is transitive because restriction composes: if Wdom1(q)V and Vdom1(p)U, then Wdom1(p)U. A fixed-trunk shrinking which remains an upper part under clauses 3–10 is consequently a direct refinement. For fixed regular θ, all stems and all their upper trees are subsets of sets built from θ×ω×θ, so Pθ is a set; unbounded coordinate domains make their union a proper class.

step 2.1step 3.1

Depends on

Used by

Dependency tree · two levels

9 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