Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedjudge pass (gpt-5.6-terra)
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 critical point of a measurable ultrapower

Statement

In ZFC let U be a nonprincipal kappa-complete ultrafilter on an uncountable cardinal kappa, and let j be its collapsed universe ultrapower embedding. Then j(α)=α for every α<κ, and

κπ([idκ]U)<j(κ).

In particular the critical point, the least ordinal moved by j, is kappa. The embedding fixes Vκ pointwise. Scott names in ordinal comparisons are understood through the collapse pi.

Facts & Assumptions

Given: ZFC. Proved the exact predecessor set of every small constant class, derived ordinal fixing and the identity bound, then used rank induction and inaccessible sizes to fix V_kappa.

[F1]

Countable completeness and transitive collapse: Countable completeness supplies the transitive collapse and elementary map.

[F2]

Measurable cardinals are inaccessible: Small subsets are null and maps into ordinals below kappa have a U-large constant fibre; kappa is inaccessible.

[F3]

The Axiom of Choice: AC supplies small enumerations and is retained from the ultrapower and cardinal bounds.

[F4]

Size and rank bounds below an inaccessible: Each member of V_kappa has cardinality below kappa.

Proof

1.1

U is countably complete since kappa is uncountable, so F1 applies. For any nonempty set x with size eta<kappa, choose a bijection b from eta to x using F3. A predecessor [f] E [c_x] has f(i) in x on a U-large set. Replace f outside that set by b(0), without changing its class. Composing with the inverse of b gives a function to eta, hence has a constant U-large fibre by F2. Therefore [f]=[c_y] for some y in x. Conversely every y in x gives such a predecessor. For empty x there are no predecessors by properness. The collapse equation now gives j(x)={j(y):yx} whenever |x|<kappa.

F1F2F3
2.1

Every ordinal alpha<kappa has size below kappa. By induction, step 1.1 gives j(α)={j(β):β<α}=α, including alpha=0. The identity function always takes values in kappa, so its collapsed class d belongs to j(kappa), hence is an ordinal. For every alpha<kappa the tail {ξ:α<ξ<κ} is U-large, since its complement has size below kappa by F2. Thus alpha=j(alpha) belongs to d. Consequently κd<j(κ); kappa is moved and all earlier ordinals are fixed.

F1F2step 1.1
3.1

By F2 kappa is inaccessible and by F4 every x in V_kappa has size below kappa. Apply rank induction to such x. Every y in x has smaller rank and remains in V_kappa, so the induction hypothesis fixes y. Step 1.1 then gives j(x)={j(y):yx}=x. The induction starts with empty and includes all limit ranks without a separate choice of representatives.

F2F4step 1.1step 2.1

Depends on

Used by

Dependency tree · two levels

13 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