Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: 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.

Strong increase and bounding projections in countable ordinal products

Definition

Work in ZFC, with AC as in The Axiom of Choice. Let A be infinite, I a proper ideal on A, λ an infinite regular cardinal, and (fα)α<λ a strictly <I increasing sequence of ordinal-valued functions. Comparisons, and the finite-ideal notation <,,=, are as in Reduced products, true cofinality and scales; their laws were proved in Progressive products and true cofinality transfers. Regularity uses cf(α)α; cf(0)=0 and cf(α+1)=1; for a limit ordinal λ the value cf(λ) is an infinite cardinal with cf(cf(λ))=cf(λ), so it is regular; and every cofinal subset of λ has cardinality at least cf(λ), a value that is attained.

A subsequence with indices Lλ is strongly increasing if there are sets ZαI, for αL, such that for every α<β in L and every aZαZβ one has fα(a)<fβ(a). For a regular cardinal κλ, property ()κ says: every unbounded Uλ contains a set L of order type κ on which the sequence is strongly increasing. The witnesses are individual small sets, not a single common exceptional set.

For nonempty sets S(a) of ordinals define s(a)=supS(a). The ceiling projection of f has value

pf(a)=min{tS(a):f(a)t}

when the displayed set is nonempty, and value minS(a) otherwise. This latter value is a specified fallback. In particular if f(a)<s(a) the ceiling exists: otherwise every tS(a) would be less than f(a), implying s(a)f(a). Thus f<Is makes the possible fallback set I-small. Assertions modulo I are independent of the values chosen on that exceptional set. Empty S(a) are not allowed; if they occur on a discarded small support, replace them by a nonempty singleton there before using this convention.

The sequence has the κ bounding-projection property if, for every such family of nonempty ordinal sets with S(a)<κ for all a and fα<Is for every α<λ, there is α<λ whose projection pfα strictly <I bounds every term of the sequence. This is a quantified property, not an assertion that a bounding projection always exists.

An exact upper bound is an ordinal function h with fαIh for every α, and such that for every ordinal function g<Ih there is α<λ with g<Ifα. Its later existence theorem will supply a positive limit-valued representative and prove leastness and uniqueness. No leastness, existence, or cofinality conclusion is assumed just by giving the terminology.

The countable specialization takes A=0 and I the ideal of finite subsets of A. Strong increase is then witnessed by finite Zα, and all comparisons in the preceding paragraphs become eventual comparisons. The general definitions allow ideals that are not countably complete and do not contain all singletons.

Depends on

Used by

Dependency tree · two levels

30 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