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 cofinality ideals have single generators

Statement

Assume AC. For a nonempty progressive set A of infinite regular cardinals and λ∈pcf⁡(A) there is Bλ⊆A such that

J≤λ[A]=J<λ[A]+Bλ={X⊆A:X∖Bλ∈J<λ[A]}.

For any B⊆A, this equality holds if and only if B∈J≤λ[A] and every ultrafilter D on A with cf⁡(∏A/D)=λ contains B. Such a generator is positive modulo J<λ[A] and unique modulo that ideal. AC gives a simultaneous family (Bλ)λ∈pcf⁡(A). Neither smoothness nor transitivity of this family is asserted.

Facts & Assumptions

Given: AC, progressive A, λ∈pcf⁡(A); write I=J<λ[A] and K=J≤λ[A].

[F1]

These are increasing ideals, I is proper, and membership of X in either is equivalent to its supported ultrafilter cofinalities satisfying the corresponding bound (Pcf cofinality ideals and cutoff conventions).

[F2]

An ultrafilter has product cofinality λ exactly when it avoids I and meets K; meeting I is equivalent to cofinality below λ (Pcf ideal directedness and ultrafilter cofinality cutoffs).

[F3]

There is a universal strict λ-sequence with a positive limit-valued exact bound h(a)≤a everywhere, including finite supports (Universal pcf sequences have strong increase and exact bounds).

[F5]

Product ultrafilter cofinalities and true cofinalities are regular, and a strict cofinal chain of regular length has that true cofinality (Progressive products and true cofinality transfers).

[A1]

AC chooses members simultaneously from nonempty sets (The Axiom of Choice).

Proof

1.1F1F2given

First prove the criterion. If K=I+B, then B∈K because B∖B=∅∈I. If D has cofinality λ, F2 gives X∈D∩K and D∩I=∅. Now X∖B∈I, so it is not in D, and its complement is in D. Intersecting with X gives X∩B∈D, hence B∈D. Conversely suppose B∈K and every cofinality-λ ultrafilter contains B. For X∈K, any ultrafilter containing X∖B contains X, so its cofinality is at most λ by F1. It cannot equal λ, since it then contains both B and X∖B. Thus every such ultrafilter has cofinality below λ, and F1 gives X∖B∈I. This proves K⊆I+B. If X∖B∈I, then X⊆(X∖B)∪B∈K because I⊆K and K is an ideal. Thus I+B⊆K as well. The complementary-pair rule used here follows directly from maximality of a proper filter: if adjoining a missing set preserved properness it would contradict maximality, so some old member is disjoint from it.

1.2F3F4F5

Take f,h from F3 and put B={a∈A:h(a)=a}. Every term satisfies fξ<Ih: fξ<Ifξ+1≤Ih, and ξ+1<λ because λ is an infinite cardinal by F5. For an ultrafilter D avoiding I, its dual ideal ID={X⊆A:A∖X∈D} contains I and is proper. Thus the chain remains strict modulo D. Its exactness transfers by F4 if A is infinite. For finite A the same transfer follows directly: for g<Dh, reset g to zero where it fails g<h. The reset function is everywhere below positive h, so exactness modulo I makes it <I some fξ. Returning the old values changes it only on an ID-small set, giving g<Dfξ. This reset argument works for infinite A too, and explains the transfer without requiring singleton-smallness.

2.1step 1.2F1F2F5

Let D contain B. If it meets I, F2 gives cofinality below λ. Otherwise step 1.2 applies. For any g∈∏A, g(a)<a=h(a) on B, so g<Dh. Transferred exactness supplies ξ with g<Dfξ. Therefore the strict chain f is cofinal in ∏A/D, and F5 makes its cofinality λ. Both cases give cofinality at most λ for every D containing B. The supported-ultrafilter test F1 therefore gives B∈K.

2.2step 1.1step 1.2F2F3

Let D have cofinality λ. It avoids I by F2. If B∉D, the complement belongs to D by the rule proved in step 1.1. Define u(a)=h(a) off B and u(a)=0 on B. Off B we have h(a)<a, and on B we have 0<a, so u∈∏A. Step 1.2 gives fξ<Dh=Du for all ξ. But universality from F3 supplies η with u≤Dfη, contradicting the strict reverse inequality on the nonempty intersection of two D-large comparison sets. Hence B∈D.

3.1step 1.1step 2.1step 2.2F1F2A1

Steps 2.1–2.2 meet the criterion of step 1.1, giving K=I+B. A cofinality-λ ultrafilter exists by the hypothesis λ∈pcf⁡(A); it contains B and avoids I, so B∉I and in particular B≠∅. If C also generates K, then B,C∈K and the two generation equalities give B∖C∈I and C∖B∈I. Their union B△C lies in I. Conversely changing B on an I-small set does not change the condition X∖B∈I, by taking the union with that small set in each direction. Finally pcf⁡(A) is a set: ultrafilters on A form a subset of P(P(A)), and Replacement collects their cofinalities. For each such λ the subsets of A generating its ideal form a nonempty set by the proof above. Apply A1 to this indexed family to select all Bλ. No compatibility condition between distinct selections was used or follows from this choice. QED.

Depends on

Used by

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