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.

Strongly increasing subsequences force a bounding projection

Statement

Assume AC. Let I be a proper ideal on an infinite set A of cardinality τ. Let λ and κ be regular cardinals with τ<κλ, and let (fα)α<λ be strictly increasing modulo I. If it has ()κ, it has the κ bounding-projection property. In particular this applies to countably infinite A, the finite ideal, and every uncountable regular κλ.

Facts & Assumptions

Given: The sequence, ideal, cardinals, AC and ()κ of the statement; nonempty ordinal sets S(a) of size less than κ such that every fα<Is, where s(a)=supS(a).

[F1]

Strong increase, ()κ, projections and the bounding-projection property have the explicit meanings in Strong increase and bounding projections in countable ordinal products.

[F3]

A fixed rule on a well-order yields a function by transfinite recursion (Transfinite recursion).

[A1]

AC gives choices from nonempty witness sets (The Axiom of Choice).

Proof

1.1

Write pα for the projection of fα. It suffices to rule out the assumption that none strictly bounds the sequence. Under that assumption, for each α let η be the least index for which P={a:pα(a)fη(a)} is I-positive, since fη<Ipα fails. Take b(α) to be the least index greater than α and η. Outside the small failure set for fη<Ifb(α), the set P witnesses pα<fb(α), so {a:pα(a)<fb(α)(a)} remains positive. Removing a small set cannot destroy positivity: otherwise its union with the removed set would put P in I. Every later index has the same positive comparison, by composition with another strict comparison and the same finite-union argument. No completeness of I is used.

F1given
2.1

Recursively choose strictly increasing indices uξ<λ for ξ<λ so that uξ>b(uζ) whenever ζ<ξ. At each stage the earlier indices and witness indices form a set of cardinality less than λ, so F2 bounds them below λ; choose the least larger index. F3 gives the sequence. Its range U is unbounded, because a bounded subset of the cardinal λ has cardinality less than λ and cannot contain a strictly increasing sequence of length λ. By step 1.1, {a:pα(a)<fβ(a)} is positive for all α<β in U. Apply ()κ to obtain indices (vi)i<κ in U and strong-increase witnesses ZiI.

step 1.1F2F3F1
3.1

Put Ei={a:fvi(a)s(a)}I. For each i<κ, the positive set {a:pvi(a)<fvi+1(a)} remains positive after removing ZiZi+1EiEi+1. Here i+1<κ because κ is infinite regular. In particular the remaining set is nonempty; AC selects a coordinate ai in it. Some fixed a is selected for κ many indices. Indeed, if every fiber {i:ai=a} had size less than κ, it would be bounded in κ by F2; there are τ<κ such bounds, so F2 would bound their union, contradicting that the fibers cover κ.

step 2.1F1F2A1
4.1

Let T={i:ai=a} have size κ. For i<j in T, the chosen coordinate gives pvi(a)<fvi+1(a). If i+1=j the next comparison is equality; otherwise strong increase gives fvi+1(a)<fvj(a), since aZi+1Zj. Finally aEj, so the genuine ceiling rule gives fvj(a)pvj(a)S(a). Also pvi(a)S(a). Hence ipvi(a) is a strictly increasing injection of T into S(a), contradicting T=κ>S(a). The assumption in step 1.1 is impossible. For every admitted family S some projection therefore strictly bounds the sequence, exactly the asserted property. The finite-ideal countable case satisfies all these hypotheses with τ=0. QED.

step 1.1step 2.1step 3.1F1

Depends on

Used by

Dependency tree · two levels

27 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