Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-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.

Kojman-Shelah scale subspace

Definition

Assume AC. Take the infinite B⊆ω∖{0,1} and the Rudin space XR(B) of Rudin ordinal box spaces on infinite index sets. Set λ=ℵω+1, and fix a normalized scale (fα)α<λ in ∏n∈Bℵn as in Normalizing a scale at existing least upper bounds. Thus fα<∗fβ for α<β, the sequence is cofinal in the eventual order, and at each limit δ<λ of uncountable cofinality where the preceding sequence has a least upper bound modulo finite, fδ is such a least upper bound. Existence of a least bound at every limit is not assumed.

The Kojman–Shelah scale subspace is

X={h∈XR(B):(∃α<λ) h=∗fα},

with its subspace topology. Here h=∗f means that {n∈B:h(n)≠f(n)} is finite, and h<∗f means that {n∈B:h(n)≥f(n)} is finite. Pointwise comparison retains its separate meaning at every coordinate.

Only eventual-equivalence classes which meet XR(B) contribute points to X. In particular this definition does not assert that any given fα belongs to XR(B), or that every class is nonempty. An admissible finite modification means changing finitely many coordinates while keeping the resulting point in XR(B); such a modification preserves membership in the displayed set X, since the union of its modification set with the original finite exceptional set is finite.

Depends on

Used by

Dependency tree · two levels

10 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