Alphabeta Math
TheoremStatement: AI-adaptedProof: 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.

Pcf has no holes for progressive intervals

Statement

Assume AC. A nonempty set A of infinite regular cardinals is an interval of regular cardinals if every regular cardinal between two members of A belongs to A. If A is such an interval and is progressive, then

pcf(A)={λ:λ is an infinite regular cardinal and minAλmaxpcf(A)}.

The following directed no-holes assertion is also proved: if A is a progressive interval, λ>supA is regular, I is a proper ideal on A, and A/I is λ-directed, then λpcf(A).

The interval hypothesis is essential; no conclusion that PCF fills every intervening regular cardinal is asserted for arbitrary progressive sets.

Facts & Assumptions

Given: AC and the progressive interval A. In the directed assertion also fix the stated λ and I.

[F1]

PCF contains its coordinate set, is monotone, preserves finite unions and equals the coordinate set on finite sets. Coordinate cofinal enumerations and repeated-cardinal range reduction preserve true cofinality with their stated hypotheses, and a scale modulo a proper ideal yields a PCF witness (Progressive products and true cofinality transfers).

[F2]

Cofinality ideals are defined by J<λ[A]={XA:pcf(X)λ} (Pcf cofinality ideals and cutoff conventions).

[F3]

The product modulo J<λ is λ-directed (Pcf ideal directedness and ultrafilter cofinality cutoffs).

[F4]

Every nonempty progressive set has a maximum possible cofinality (Progressive pcf has a maximum and continuous cutoff ideals).

[F5]

A directed product has a chain satisfying every eligible uncountable regular strong-increase property, with projection and exact-bound consequences when their cardinal inequalities hold (Directed progressive products have club continuous chains).

[F6]

The exact bound is least, can be made positive and limit-valued, and each additional regular κ projection property gives an ideal-small set of coordinates with cofinality below κ (Bounding projections produce an exact upper bound with large coordinate cofinalities).

[A1]

AC supplies simultaneous choices of cofinal enumerations (The Axiom of Choice).

Proof

1.1

Begin with the directed assertion. Every singleton {a} belongs to I: otherwise the family (uξ)ξ<a with uξ(a)=ξ and uξ(b)=0 for ba has size a<λ, yet no weak bound v in the product, since uv(a)+1(a)>v(a) and this failure singleton is positive. The index v(a)+1<a because a is an infinite cardinal. Directedness contradicts this. Let β be the least ordinal for which A0=Aβ is positive; it exists since A=A(supA+1) is positive. It is not a successor: its preceding initial segment and the possible newly added singleton would both be small. Nor can A0 be bounded below β, for then an earlier initial segment would equal it. Thus β=supA0=μ is a limit cardinal, as a supremum of unbounded cardinal coordinates, and A0 has no last member. Every proper initial segment of A0 is small. By F7, cf(μ)A0<minA0<μ, so μ is singular. Put I0=IP(A0). It is proper, and directedness restricts: extend any small family of functions by zero outside A0, take an I-bound and restrict it. In particular A0 is infinite and progressive and remains an interval.

F7given
1.2

Independently, the proposed interval identity holds if A is finite, since F1 gives pcf(A)=A and the interval condition includes exactly all regular cardinals from its minimum to its maximum. For every nonempty progressive A, F1 and F4 also give the easy inclusion: its possible cofinalities are regular, at least minA and at most M=maxpcf(A).

F1F4given
2.1

Continue the directed assertion on A0, with τ=A0. Since μ is a limit cardinal greater than τ, τ+<μsupA<λ. For each uncountable regular κ<μ, κ+++1<μ, and hence {aA0:aκ++}I0 by step 1.1. F5 applies to this restricted directed product with the constant zero prescribed family and supplies one strict λ-chain f with every such ()κ. In particular τ+ is eligible and regular by F8. The exact-bound clause of F5 applies because λ>τ+, giving an exact bound v. Also κ=minA0 is uncountable, regular, greater than τ and below μ, so F5 gives its projection property; F6 makes {a:cf(v(a))<minA0} small. First choose a positive limit representative using F6, and cap it at the identity: leastness gives vI0(aa), so min(v(a),a) is the same ideal class. Off a small set this has cofinality at least minA0; on the exceptional set replace its value by a. Denote the resulting bound by h. It remains exact, positive and limit-valued and satisfies minA0c(a)=cf(h(a))a for every a. The upper inequality follows because h(a)a and a cofinal subset has size at most h(a)a. By F7 c(a) is regular. The interval property, with endpoints minA0 and a, now gives c(a)A0. This is the use of the interval hypothesis in the directed argument.

step 1.1F5F6F7F8
3.1

For each ξ, fξ<I0h because fξ<I0fξ+1I0h. Reset fξ to zero on its individual small failure set to obtain f~ξh. These changes preserve strict comparisons. Exactness makes this chain cofinal in h/I0, so its true cofinality is λ by F1. By F7 and A1 choose strictly increasing cofinal maps ea:c(a)h(a) for all a. F1 transfers true cofinality to aA0c(a)/I0. Put C=rancA0 and J={EC:c1[E]I0}. Preimages preserve finite unions and subsets, and c1[C]=A0I0, so J is proper. Moreover A0<minA0minC, precisely the cardinal bound in F1's repetition transfer. Thus C/J has true cofinality λ, and F1 gives λpcf(C)pcf(A0)pcf(A). This proves the directed assertion.

step 1.1step 2.1F1F7A1
4.1

Suppose now A has no largest member. Its supremum μ is a limit cardinal and cf(μ)A<minA<μ by F7, so it is singular. Each regular cardinal ρ with minAρ<μ lies in A: choose a member of A above ρ and apply the interval property. It therefore belongs to PCF by F1. For a regular ρ with μ<ρM, the ideal J<ρ[A] is proper by F2, since Mpcf(A) is not below ρ. F3 gives ρ-directedness, so step 3.1 applied with λ=ρ gives ρpcf(A). There is no regular cardinal equal to singular μ. Together with step 1.2's opposite inclusion this proves the interval identity when there is no last member.

step 1.2step 3.1F1F2F3F7
5.1

Finally let A be infinite with a last member. The order type of A is δ+n for a nonzero limit ordinal δ and a positive finite n. Indeed, repeatedly taking predecessors of a successor order type must reach a limit or zero after finitely many steps: failure would give an infinite descending sequence of ordinals, whose set of values has a least member followed by a smaller one. Reaching zero would make the original order type finite. Split off this finite terminal interval F and let A0 be the initial interval of order type δ, with no maximum. Step 4.1 gives pcf(A0) as the regular interval through M0=maxpcf(A0), and F1 gives pcf(A)=pcf(A0)F. There is no missing regular between the start of A and max(M0,maxF): a regular ρM0 is in the first interval; if M0<ρmaxF, then ρ>supA0 because M0supA0 by F1, and the original interval condition puts ρA, necessarily in F. The maximum of this union is max(M0,maxF). This proves the identity in the remaining infinite case, while step 1.2 proves the finite case and step 3.1 proves the directed assertion. QED.

step 1.2step 3.1step 4.1F1F4

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

49 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