Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-12
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.

The covering-embedding characterization of strong compactness

Statement

In ZFC, for a regular uncountable cardinal kappa, strong compactness is equivalent to the following: for every cardinal lambda>=kappa there are a definable elementary embedding j:V→M into a transitive class with critical point kappa and a set s in M such that j‘‘λ⊆s⊆j(λ) and M satisfies ∣s∣<j(κ). Embeddings retain the formula-schema and set-restriction convention.

Facts & Assumptions

Given: ZFC. Proved ordinal fixing for fine-index ultrapowers locally, used the internal cover bound to force movement at kappa, and checked every law of the converse seed-derived fine measure.

[F1]

Strong compactness, fine measures and infinitary logic: Strong compactness is equivalent to fine kappa-complete measures at every lambda.

[F2]

Fine ultrapower seeds and normality: The fine ultrapower identity seed has exactly the required covering and internal size properties.

[F3]

The critical point of a measurable ultrapower: Critical point means the least moved ordinal; the constant-predecessor argument is supplied for this different index set below.

Proof

1.1F1F2F3

If kappa is strongly compact, take the fine U on P_kappa(lambda) from F1 and its j,s from F2. We check the critical point without assuming U is a measure on kappa. For every eta<kappa, a map from the index set to eta has a U-large constant fibre: otherwise intersecting the eta fibre complements gives empty in U. Induct on alpha<kappa. Each predecessor of the constant-alpha class, for alpha>0, can be modified outside its U-large membership set to take values in alpha; the fibre argument makes it constant. For alpha=0 there are no predecessors. The collapse equation then gives j(alpha)=alpha, exactly the predecessor reasoning whose critical-point terminology is F3.

2.1F2step 1.1

If j(kappa)=kappa, F2's internal size bound gives in M an enumeration of s of ordinal length eta<kappa. This is also an external enumeration, since M is transitive. But s contains j``kappa=kappa by step 1.1, contradicting that kappa is a cardinal: choosing the least preimage of each ordinal below kappa injects kappa into eta. Hence j(kappa)>kappa (the ordinal map is increasing and cannot move it downward), and its critical point is kappa. This proves the required embedding property.

3.1F1F2step 2.1∎

Conversely take such j,s for a fixed lambda. Its internal subset and size assertions mean precisely that s belongs to j(P_kappa(lambda)). Define U={X⊆Pκ(λ):s∈j(X)}. Definability and Separation make U a set. The seed lies in the image of the whole index set and not in j(empty); image complements, intersections and inclusions give properness, complement decisions and upward closure. If eta<kappa and X_xi are U-members, j fixes eta and the image sequence has entry j(X_xi) at xi. Thus s belongs to the intersection of that image sequence, equal to j of the intersection, proving kappa-completeness. For alpha<lambda the image of its point cone is the sets containing j(alpha); since j(alpha) belongs to s, that cone belongs to U. Hence U is fine. This holds for every lambda, so F1 gives strong compactness. No equality of s with j``lambda or sequence closure of M has been inferred.

Depends on

Used by

Nothing in the library uses this result yet.

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