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.

Club continuity produces strongly increasing subsequences

Statement

Assume AC. Let I be any proper ideal on an infinite set A, let κ be uncountable regular, and let λ>κ++ be regular. Suppose (fα)α<λ is a strictly <I increasing sequence of ordinal functions on A. Suppose also that for every δ<λ with cf⁡(δ)=κ++ there are a club Eδ⊆δ and β<λ such that

sup⁡α∈Eδfα<Ifβ,

where the supremum is pointwise. Then (∗)κ holds: every unbounded U⊆λ contains indices of order type κ forming a strongly increasing subsequence. In particular this holds for countably many coordinates and the finite ideal. No completeness or singleton-membership assumption on I is required.

Facts & Assumptions

Given: The hypotheses in the statement and an arbitrary unbounded U⊆λ.

[F1]

Strong increase has individual witnesses Zα∈I with fα(a)<fβ(a) outside Zα∪Zβ for α<β; (∗)κ requires this on an order-type-κ subsequence of every unbounded set (Strong increase and bounding projections in countable ordinal products).

[F2]

For θ=κ++ there are clubs Cη⊆η of order type κ, indexed by η∈Eκθ, such that every club of θ contains one Cη (Club guessing at the double successor of an uncountable regular cardinal).

[F3]

Two clubs in an ordinal of uncountable cofinality have club intersection (Intersections of fewer than the cofinality many clubs).

[F5]

A specified rule recurses on a well-order (Transfinite recursion).

[A1]

AC supplies simultaneous witnesses when required (The Axiom of Choice).

Proof

1.1F1F2F4F5A1

Put θ=κ++ and fix the family in F2. Define a continuous strictly increasing ξ:θ→λ. Start with ξ(0)=0. At a nonzero limit take the supremum of previous values. At stage i+1, for every η∈Eκθ put hη,i(a)=sup⁡{fξ(j)(a):j∈Cη∩(i+1)}, with empty supremum zero. If some σ<λ with σ>ξ(i) satisfies hη,i<Ifσ, record the least such σ; otherwise record ξ(i)+1. Choose ξ(i+1) to be the least element of U strictly above ξ(i) and all recorded ordinals. There are at most θ<λ records, so F4 makes their supremum less than λ, and unboundedness of U supplies that least point. Limit stages likewise remain below λ. F5 defines the recursion. Whenever a genuine bound was recorded, transitivity of <I gives hη,i<Ifξ(i+1): outside the union of the two comparison-failure sets, the two strict ordinal inequalities compose.

2.1step 1.1F2F3F4F6

Let δ=sup⁡i<θξ(i). F4 gives δ<λ. The increasing cofinal enumeration shows cf⁡(δ)≤θ. If B⊆δ were cofinal of size less than θ, send each b∈B to the least i with b<ξ(i). These indices would be unbounded in θ, contradicting its regularity from F6. Thus cf⁡(δ)=θ. The range D of ξ is club in δ: continuity includes every nonzero limit point below δ, and its supremum is δ. By hypothesis choose Eδ and a bound fβ. F3 makes D∩Eδ club in δ; pulling back under the continuous enumeration gives a club C={i<θ:ξ(i)∈Eδ} in θ. In detail unboundedness follows from that of D∩Eδ, and at a nonzero limit of indices in C, continuity of ξ and closure of Eδ give membership in C. By F2 fix η with Cη⊆C.

3.1step 1.1step 2.1F1

Every prefix supremum hη,i now has a strict bound in the chain: it is pointwise at most sup⁡α∈Eδfα<Ifβ, and a chain member of index greater than both β and ξ(i) is also a strict bound. Thus all its bound questions in step 1.1 were positive. If i<j belong to Cη, then i+1≤j and hη,i<Ifξ(i+1)≤Ifξ(j). The last comparison allows equality when j=i+1. Hence hη,i<Ifξ(j) for all such pairs.

4.1step 3.1F1

Enumerate Cη continuously as (cρ)ρ<κ. Its nonaccumulation points other than its first point are exactly cρ+1 for ρ<κ: at a nonzero limit the enumeration is continuous, whereas a successor has previous maximum cρ. Write jρ=cρ+1 and tρ=fξ(jρ). Define Zρ={a:hη,cρ(a)≥tρ(a)}∈I by step 3.1. For ρ<σ, jρ≤cσ, so tρ≤hη,cσ pointwise, and therefore tρ(a)<tσ(a) whenever a∉Zσ. In particular (tρ)ρ<κ is strongly increasing, witnessed by (Zρ).

5.1step 1.1step 4.1F1

To obtain indices in U, set uρ=fξ(jρ+1). Its index belongs to U by step 1.1, and these indices strictly increase with ρ. Since jρ<jρ+1≤jρ+1, the chain gives tρ<Iuρ≤Itρ+1. Put Pρ={a:tρ(a)≥uρ(a)} and Qρ={a:uρ(a)>tρ+1(a)}, both in I, and set Wρ=Zρ∪Zρ+1∪Pρ∪Qρ. For ρ<σ and a∉Wρ∪Wσ, one has uρ(a)≤tρ+1(a)≤tσ(a)<uσ(a). The middle inequality is equality if σ=ρ+1, and is strict by step 4.1 otherwise. Thus the uρ are strongly increasing with witnesses Wρ∈I. They form an order-type-κ subsequence indexed in the arbitrary U, proving (∗)κ. Only finite unions of ideal sets were used; the countable finite-ideal specialization follows by taking those sets to be finite. QED.

Depends on

Used by

Dependency tree · two levels

40 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