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 of ZFC equipped with a class predicate which globally well-orders , with Replacement allowed for formulas using . 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 and put only as a bookkeeping coordinate.
Coordinate filters
For every infinite regular cardinal , define and filters as follows.
- If , put and let be the co-bounded filter on .
- If there is a largest strongly compact , call type 1, put , and let be the -least uniform -complete ultrafilter on .
- Otherwise put is strongly compact. The no-regular-limit-point hypothesis makes singular. Call type 2, put , and take the -least increasing sequence of strongly compact cardinals cofinal in , with every term at least . For each , let be the -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 coordinate. No projection coherence or normality of the is being asserted.
Stems
For a partial function coded as a set of triples , put
Let be the definable class of such for which is finite and, for every , the section is a finite one-to-one partial function from into . Write when and agree at every coordinate at least .
Let consist of the satisfying:
- is closed under ;
- for every coordinate ; and
- there are unique with and such that the high coordinates below have section-domain , while those at or above have section-domain .
Thus is the next high-coordinate slot. A is extendable when a proper extension with the same coordinate domain and the same part below remains in . Equivalently, it is extendable iff or . For an extendable , let
Measure-one trees and the forcing
For and , write . A condition of Gitik's forcing is a pair satisfying all ten clauses below.
- .
- .
- .
- Every extends as a function and has .
- If , , , and is an unfilled slot with , then .
- If both satisfy , then their union belongs to whenever it belongs to ; moreover, if , the map embeds into .
- If and , then .
- If is extendable and , its possible next values form a member of .
- If is extendable and , its possible next values form a member of .
- Every with has a predecessor obtained by deleting exactly the value last inserted at .
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 and , write , meaning stronger, when and . 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 be the restriction whose coordinate domains lie below , adjoining the trivial empty condition when the restriction has no high coordinate. Because , regular initial segments are closed under the dependency map. Each is a set forcing; is a definable proper class. The ordinary set-forcing theorem is not thereby a forcing theorem for .
Facts & Assumptions
Given: The model, global well-order, strongly compact class and definitions above.
Fine measures, strong compactness and supercompactness: Strong compactness extends every proper -complete filter on a set to a -complete ultrafilter on that set.
Strong compactness, fine measures and infinitary logic: Strong compactness is equivalently witnessed by fine -complete ultrafilters on every ; no supercompactness hypothesis is required here.
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
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 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.
Finiteness makes the cut in clause 3 of 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 is already filled. This proves both directions of the displayed extendability equivalence and makes well-defined.
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.
The forcing order is reflexive. It is transitive because restriction composes: if and , then . 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 is a set; unbounded coordinate domains make their union a proper class.
Depends on
Used by
- Gitik's finite-support symmetric submodel Definition
- Restriction, amalgamation, and the set-sized Prikry property Lemma
- Strong compactness bounds symmetric decision patterns Lemma
- Every limit ordinal has cofinality omega in Gitik's model Theorem
- Every set is countable in the intermediate extension Theorem
- Relative consistency from a proper class of strongly compact cardinals Theorem
- The forcing theorem for Gitik's expanded proper-class language Theorem
- The intermediate extension satisfies ZF minus Power Set plus Collection Theorem
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
- Schürz, Gitik's model, Sections 1–2, pages 2–9 (standard reference, not scraped)
- Dimitriou, Symmetric Models, Chapter 2, Section 5.1, pages 57–60 (standard reference, not scraped)