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.

Fine-measure coordinates avoiding small supports

Statement

In ZFC let κ be strongly compact and λκ a cardinal. There exist a set I, a nonprincipal κ-complete ultrafilter U on I, and functions fα:Iκ for α<λ such that

{x:fα(x)<fβ(x)}U(α<β<λ),{x:fα(x)>δ}U(α<λ, δ<κ).

Consequently, for every finite Fλ and every Sκ with S<κ, the following set belongs to U:

H(F,S)={xI:fα(x)fβ(x) for distinct α,βF, and fα(x)S for all αF}.

The construction takes I=Pκ(ρ) for a cardinal ρ>κ+λ, with ordinal addition in this bound. It does not require normality of U or a cofinality restriction on λ.

Facts & Assumptions

Given: ZFC, a strongly compact cardinal κ (regular uncountable by convention), and a cardinal λκ. The asserted measure is an ultrafilter in the ground universe; no real-valued measure extension is asserted.

[F1]

Strong compactness gives a fine κ-complete ultrafilter on every Pκ(ρ) for cardinal ρκ. (Strong compactness, fine measures and infinitary logic)

[F2]

Pκ(ρ) consists of the subsets of ρ of size below κ, and fineness puts each point cone in U. (Fine measures, strong compactness and supercompactness)

[F3]

Completeness applies to every intersection indexed by an ordinal below κ; its empty intersection is I. (Complete ultrafilters and measurable cardinals)

[F5]

The Hartogs number is the least ordinal not injecting into a specified set. (Hartogs: an ordinal that does not inject into a given set)

[F6]

Every well-order has a unique ordinal order type and a unique order isomorphism onto that ordinal. (Every well-order has a unique order type)

Proof

1.1

Put θ=κ+λ and let ρ be its Hartogs number. Then ρ>θ: otherwise inclusion would inject ρ into θ. Also ρ is an initial ordinal. A bijection from ρ to some η<ρ, followed by an injection of η into θ supplied by minimality of ρ, would contradict its defining property. Thus ρ is a cardinal above κ. Set I=Pκ(ρ) and take a fine κ-complete ultrafilter U by F1. It is nonprincipal: for each xI there is ξρx, since x<κρ; its point cone is in U and omits x, so {x}U.

F1F2F4F5
2.1

For α<λ put tα=κ+α and define fα(x)=otp(xtα), using the inherited ordinal order. F4 gives κtα<θ<ρ and tα<tβ for α<β. F6 makes each value unique; Separation and Replacement give all functions and their indexed family. Every value is below κ: the order isomorphism gives it the cardinality of xtα, which is below κ; an ordinal at least the initial ordinal κ cannot have that cardinality. For the empty index x= every value is zero.

F2F4F6step 1.1
3.1

If α<β<λ and tαx, then xtα is exactly the proper initial segment below the element tα of the well-order xtβ. Under the order isomorphism of F6 its order type is therefore an ordinal strictly below the order type of xtβ. The point cone at tα belongs to U by fineness, so upward closure gives {x:fα(x)<fβ(x)}U.

F2F6step 2.1
3.2

Fix δ<κ. Intersect the point cones at all ξδ. This is a U-member by F3, since δ+1<κ. For finite δ this follows from uncountability. For infinite δ, the new last point can be sent to zero, each natural number shifted to its successor, and each ordinal in [ω,δ) fixed; this injects δ+1 into δ, so δ+1 cannot reach the initial ordinal κ. At an index in this intersection, δ+1xtα, because tακ. In fact δ+1 is an initial segment there. Restricting the order isomorphism of F6 shows fα(x)δ+1>δ. Upward closure proves the second displayed assertion, including δ=0 and α=0.

F2F3F6step 2.1
4.1

For fixed α<λ, intersect {x:fα(x)>δ} over δS. The inherited ordinal order on Sκ has order type below κ, by the same initial-cardinal argument as in step 2.1, so F3 applies without choosing an enumeration. The intersection lies in U and is contained in {x:fα(x)S}. For finite F, intersect these avoidance sets and the finitely many comparison sets from step 3.1 for ordered pairs α<β in F. This U-member is contained in H(F,S), proving the conclusion by upward closure. If F is empty then H(F,S)=I; if S is empty its avoidance intersections are I; a singleton F requires no pair comparisons. Neither this construction nor its proof uses normality or any restriction on cf(λ).

F3F6step 2.1step 3.1step 3.2

Depends on

Used by

Dependency tree · two levels

23 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