Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Bounding projections produce an exact upper bound with large coordinate cofinalities

Statement

Assume AC. Let I be a proper ideal on an infinite set A, τ=A, and λ>τ+ a regular cardinal. A strictly <I increasing sequence (fα)α<λ with the τ+ bounding-projection property has an exact upper bound h, unique modulo =I. It has a representative with every h(a) a nonzero limit ordinal. If the sequence also has the bounding-projection property for a regular κ with τ+κλ, then

{aA:cf(h(a))<κ}I.

Exactness restricts to every I-positive support and passes to every larger proper ideal. In particular, for countably infinite A and the finite ideal, a regular length λ>1 and the 1 projection property give a unique eventual exact upper bound, with the stated cofinality bound holding outside a finite set.

Every exact bound is also a least upper bound among ordinal-valued functions modulo I.

Facts & Assumptions

Given: The sequence, ideal, cardinals, AC and bounding-projection properties of the statement. Upper bounds are taken among all ordinal-valued functions on A.

[F1]

Projections, strict and weak comparisons, the bounding-projection property and exact upper bounds are as in Strong increase and bounding projections in countable ordinal products.

[F4]

A specified transfinite recursion on a well-order determines a function (Transfinite recursion).

[A1]

AC supplies simultaneous witnesses and choice functions on nonempty sets of witnesses (The Axiom of Choice).

Proof

1.1

Set H(a)=supα<λ(fα(a)+1)+1, a pointwise strict bound. The ordinal functions uH form a set. Any weak upper bound u strictly bounds every term: fα<Ifα+1Iu, since α+1<λ. If two functions are upper bounds, their pointwise minimum is also an upper bound, because outside the union of the two small exceptional sets it dominates each fixed fα. Thus, if an upper bound uH is not minimal in the weak quotient order, there is an upper bound vu pointwise with {a:v(a)<u(a)} positive: take its minimum with a smaller quotient bound.

F1givenalgebra
2.1

Suppose there were no minimal upper bound below H. For η<τ+ recursively form increasing nonempty sets Sη(a)H(a)+1, starting with S0(a)={H(a)}, taking unions at limits, and adjoining one value at each successor as follows. Every Sη(a) has size at most η+1τ and contains H(a), so its supremum is H(a) and the τ+ projection property applies. Let αη be the least index whose projection hη strictly bounds the sequence. For βαη, its projection onto the same Sη equals hη modulo I: outside a small set, fαηfβ<hη, and hη is the least Sη value at least fαη, so it is also the least value at least fβ. By step 1.1 choose an upper bound uηhη pointwise, strictly smaller on a positive set, and put Sη+1(a)=Sη(a){uη(a)}. AC fixes a choice function on the nonempty witness subsets of the set of functions below H; F4 then implements the recursion.

step 1.1F1F4A1
2.2

Every exact bound v is a least bound. Its zero coordinates are small by f0<If1Iv. If another bound u failed vIu, the set B={a:u(a)<v(a)} would be positive. Define g=u on B and g=0 elsewhere. Then g<Iv, the only possible failures being zero coordinates of v. Exactness gives g<Ifα for some α, while fαIu. Outside the union of those two small exception sets, a point of positive B would satisfy u(a)=g(a)<fα(a)u(a), impossible. Hence vIu for every bound u. Two exact bounds are mutually weakly below one another and thus =I equal.

step 1.1F1
3.1

Regularity of λ and τ+<λ give a single β<λ above all αη. Put Pη=proj(fβ,Sη). These functions decrease pointwise because the sets of eligible projection values increase, and H always remains eligible. Step 2.1 gives Pη=Ihη. Also Pη+1=Iuη: outside a small set the old ceiling is hη and fβ<uηhη by step 1.1; the only new eligible value below the old ceiling is uη. Thus {a:Pη+1(a)<Pη(a)} is positive for every η. AC selects a coordinate of strict decrease for each η<τ+. Some coordinate is selected unboundedly often: otherwise each fiber is bounded, and the τ<τ+ fiber bounds have bounded supremum by F2–F3, contradicting that all stages have a selected coordinate. Taking an increasing countable sequence of these stages gives an infinite strictly descending sequence of ordinals at that coordinate, since all intervening comparisons are weakly decreasing. This is impossible: the set of values of such a sequence would have a least member followed by a smaller one. Hence a minimal upper bound hH exists.

step 1.1step 2.1F2F3A1
4.1

This h is a least upper bound among all ordinal bounds. For any other bound v, the minimum min(h,v) is a bound below h by step 1.1; minimality forces it equal to h modulo I, hence hIv. The zero coordinates of h form a small set, since 0f0<If1Ih. If the successor-valued coordinates formed a positive set, replacing h by its predecessor on those coordinates would give a strictly smaller bound: each fα<Ih by step 1.1, so there fα is at most that predecessor outside a small set. This contradicts minimality. Change h to ω on its small set of zero or successor coordinates. It remains =I the old least bound and is now positive and limit-valued everywhere.

step 1.1step 3.1F1
5.1

Given g<Ih, reset g to zero on its small set of coordinates with g(a)h(a). This preserves its class and makes g<h pointwise. The sets S(a)={g(a),h(a)} have size at most two, hence less than τ+, and their supremum is h. The bounding-projection property gives a projection p of some fα that bounds the sequence. It satisfies ph pointwise, including any fallback, so leastness of h gives p=Ih. Outside the small sets where that equality fails or fαh, the least eligible element of {g(a),h(a)} is h(a); thus g(a)<fα(a) there. Therefore g<Ifα, proving exactness.

step 4.1F1
5.2

Suppose the additional κ projection property holds and B={a:cf(h(a))<κ} is positive. By F2 and AC, choose for each aB a cofinal subset S(a)h(a) of size less than κ; off B put S(a)={h(a)}. These sets are nonempty and have supremum h(a), since h(a) is a nonzero limit. A bounding projection p is at most h everywhere and strictly less at every coordinate of B, since its values, including its fallback, lie in S(a). This contradicts leastness of h. Thus BI. Modifying a representative on a small set does not change this conclusion.

step 4.1F1F2A1
6.1

Let BA be positive and let g<IBhB. Reset g to zero on its small failure set, then extend it by zero off B. The resulting function is pointwise below positive h, so exactness from step 5.1 yields g<Ifα after extension, and restriction gives the desired comparison modulo IB. Upper-boundedness restricts directly, proving restricted exactness. If JI is a larger proper ideal and g<Jh, reset g to zero on the J-small failure set. The reset function is everywhere below h, so it is <I some fα; restoring g changes it only on a J-small set, giving g<Jfα. Upper-boundedness also passes to J, proving exactness there. With A=0 and the finite ideal, all small sets in these conclusions are finite and τ+=1, giving the stated specialization. QED.

step 4.1step 5.1F1

Depends on

Used by

Dependency tree · two levels

35 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