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.

Progressive pcf has a maximum and continuous cutoff ideals

Statement

Assume AC. Every nonempty progressive set A of infinite regular cardinals has a largest possible cofinality M=max⁡pcf⁡(A), and

∣pcf⁡(A)∣≤2∣A∣.

For every nonzero cardinal λ,

J<λ[A]=⋃θ<λ, θ a cardinalJ≤θ[A].

For every nonzero limit cardinal λ one also has J<λ[A]=⋃θ<λ, θ a cardinalJ<θ[A]. The maximum assertion excludes A=∅; for that support PCF is empty, the cardinal bound and both stated positive-cutoff identities remain valid. At λ=0 either displayed union is empty whereas J<0[A]={∅}, so no zero-cutoff union identity is asserted.

Facts & Assumptions

Given: AC and a nonempty progressive A, until the empty-support clause is treated. All ideal cutoffs below are cardinal cutoffs.

[F1]

PCF is a set of infinite regular cardinals, contains A, is monotone, and equals A for finite A (Progressive products and true cofinality transfers).

[F2]

J<λ[A] is increasing with λ, is proper for λ∈pcf⁡(A), and consists of X with pcf⁡(X)⊆λ; J≤λ=J<λ+ (Pcf cofinality ideals and cutoff conventions).

[F3]

An ultrafilter has cofinality at least λ exactly when it avoids J<λ, and has cofinality equal to λ exactly when it avoids J<λ and meets J≤λ (Pcf ideal directedness and ultrafilter cofinality cutoffs).

[F4]

Under AC every proper filter extends to an ultrafilter (The ultrafilter lemma, from the Axiom of Choice: every filter extends to an ultrafilter).

[A1]

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

Proof

1.1F1F2F4

Put P=pcf⁡(A), a nonempty set by F1, and I=⋃λ∈PJ<λ[A]. This is an ideal: it contains the empty set because P≠∅; it is downward closed by F2; and if two members lie in the ideals with cutoffs λ,μ∈P, both lie in the ideal with the larger of those two cutoffs, which also contains their union. It is proper because every constituent omits A. Its dual I∗={A∖X:X∈I} contains A, omits the empty set and is upward closed and closed under finite intersections, by complementing the ideal axioms. It is therefore a proper filter. F4 supplies an ultrafilter D⊇I∗. This D avoids I, since containing both X and its complement would put the empty set in D.

1.2F1F2F3F5A1

For each λ∈P there is an ultrafilter of cofinality λ, and F3 supplies Xλ∈J≤λ[A]∖J<λ[A]. The corresponding nonempty witness sets lie in P(A); AC selects Xλ simultaneously. If λ<μ in P, every member of pcf⁡(Xλ) is at most λ<μ, so Xλ∈J<μ[A], whereas Xμ∉J<μ[A]. Thus Xλ≠Xμ. This injection P→P(A) gives ∣P∣≤∣P(A)∣=2∣A∣ by F5: subsets correspond bijectively to their characteristic functions, and a bijection ∣A∣→A transports these to binary functions on ∣A∣.

2.1step 1.1F1F3F5

Put M=cf⁡(∏A/D)∈P by F1. For each λ∈P, step 1.1 shows that D avoids J<λ; hence M≥λ by F3. Since M itself belongs to P, it is its maximum. In particular the maximum is infinite regular, not merely a supremum outside PCF. This proof applies to every nonempty progressive subset X⊆A, since ∣X∣≤∣A∣<min⁡A≤min⁡X; the first inequality follows from its inclusion by F5.

3.1step 2.1F1F2

Fix λ>0. If nonempty X∈J<λ[A], step 2.1 applied to X gives the cardinal θ=max⁡pcf⁡(X)<λ. Every possible cofinality of X is at most θ, hence X∈J≤θ[A]. For X=∅, use θ=0<λ and pcf⁡(∅)=∅ from F1. Conversely, if X∈J≤θ[A] with cardinal θ<λ, every member of pcf⁡(X) is at most θ and hence below λ; thus X∈J<λ[A]. This proves both inclusions in the first identity for every nonzero cutoff, including one and singular cutoffs.

4.1step 2.1step 1.2step 3.1F1F2

If λ is a nonzero limit cardinal, it is infinite. For nonempty X∈J<λ take μ=max⁡pcf⁡(X)<λ as in step 3.1; since λ is not a successor, μ+<λ, and X∈J<μ+. For the empty X choose cutoff zero, which is below λ and whose ideal contains the empty set. The reverse inclusion follows from monotonicity of the cutoff ideals, proving the second identity. If A=∅, F1 gives empty PCF and every cutoff ideal equals {∅}; each positive-cutoff union has an index (zero), so equals that same ideal, and 0≤20=1 gives the cardinal bound. If A is finite nonempty, F1 gives P=A, whose largest element is its maximum, in agreement with step 2.1. Finally at cutoff zero, F1 and singleton monotonicity show that no nonempty subset is null; hence J<0[A]={∅}, while the union indexed below zero has no members. This verifies the stated exceptions. QED.

Depends on

Used by

Dependency tree · two levels

52 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