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 ideal directedness and ultrafilter cofinality cutoffs

Statement

Assume AC. Let A be a nonempty progressive set of infinite regular cardinals. For every cardinal λ, A/J<λ[A] is λ-directed: every family of fewer than λ functions has a weak upper bound. If the ideal is proper, bounds can be taken strict; for an improper ideal only weak directedness is intended. For every ultrafilter D on A,

cf(A/D)<λDJ<λ[A],

cf(A/D)=λDJ<λ[A]=  and  DJλ[A].

These assertions include finite A and all finite, infinite and singular cutoffs λ. For A=, the product is a singleton, all these ideals are improper, weak directedness holds and the ultrafilter assertions are vacuous.

Facts & Assumptions

Given: AC and the product and cutoff conventions of the statement. A weak upper bound becomes strict upon adding one at each infinite-cardinal coordinate, when the ideal is proper.

[F1]

PCF is monotone, preserves finite unions, equals A for finite A, and consists of infinite regular ultraproduct cofinalities; restrictions to ultrafilter supports preserve the quotient order (Progressive products and true cofinality transfers).

[F2]

The cutoff families are ideals and restrict to subsets; BJ<λ[A] means some ultrafilter supported on B has product cofinality at least λ. Every such ultrafilter contains J<λ[A] (Pcf cofinality ideals and cutoff conventions).

[F3]

A regular-length directed product has a strictly increasing chain dominating any prescribed family at successor stages, with ()κ when κ is uncountable regular, κ++ is below that length and {a:aκ++} is small (Directed progressive products have club continuous chains).

[F4]

Strong increase with regular A<κ gives the κ projection property (Strongly increasing subsequences force a bounding projection).

[F5]

For regular length greater than A+, the A+ projection property gives a unique exact upper bound, with a positive limit-valued representative; exactness passes to larger proper ideals (Bounding projections produce an exact upper bound with large coordinate cofinalities).

[F8]

An ultrafilter contains exactly one of each set and its complement (Characterisation of ultrafilters: every set or its complement).

[A1]

AC supplies enumerations and simultaneous bound witnesses (The Axiom of Choice).

Proof

1.1

If A=, the empty function is the sole product member; no ultrafilter exists by F1. If I=J<λ[A] is improper, every comparison failure set belongs to I, so the zero function weakly bounds every family. Assume henceforth that A and I is proper. For finite A, F1–F2 give I=P(S) with S={aA:a<λ}. For H<λ, define b(a)=sup{f(a)+1:fH} on AS, and b(a)=0 on S. At each remaining coordinate, H<λa=cf(a), so F6 gives b(a)<a. Thus b strictly bounds H modulo I. The empty H has supremum zero. At λ=0 there are no families of size less than λ, so directedness is vacuous.

F1F2F6given
2.1

Let A be infinite and τ=A. Progressiveness gives a>τ for all aA. If λτ+3, there are at most three cardinals in A below λ. Their set S belongs to I by the finite PCF calculation in F1. The supremum formula of step 1.1 on AS again bounds every <λ family. If λ>τ+3, remove instead S=A(τ+3+1), also finite and I-small. Let A=AS and I=IP(A)=J<λ[A] by F2. Restriction and zero extension preserve and reflect comparisons modulo these ideals: a failure set differs from its restricted version only inside SI. Bounds on A therefore extend to bounds on A. We have minA>τ+3, A infinite and Aτ. If I were improper, A=ASI would imply AI, impossible. It remains to bound families on this proper reduced support.

step 1.1F1F2F6
3.1

Keep I fixed and prove, by induction on cardinals ρ<λ, that every family HA of size ρ has a bound. This induction is valid because a nonempty set of failed cardinal sizes below λ would have a least member. If ρ<minA, the pointwise formula b(a)=supfH(f(a)+1) is below every a by F6 and is a strict bound. If ρ is singular and all smaller sizes are bounded, enumerate H=(hξ)ξ<ρ by AC and fix cofinal indices (γj)j<cf(ρ) in ρ. Each subfamily with ξ<γj has a bound by induction. AC chooses these bounds simultaneously; the family of bounds has size at most cf(ρ)<ρ, so induction bounds it too. For each hξ choose j with ξ<γj; composing its two weak comparisons gives a common weak bound for H, and a coordinate successor gives a strict bound.

step 2.1F1F6A1
4.1

It remains to consider regular ρminA>τ+3. The induction assumption makes the product ρ-directed. Put κ=τ+, regular by F7 and uncountable because τ is infinite. Then κ++=τ+3<ρ, Aτ<κ, and {aA:aκ++}=I. Apply F3 to an enumeration of H, obtaining a strict ρ-chain (fξ) with each enumerated member pointwise below fξ+1 and with ()κ. Set τ=A. Restrict those strong subsequences to their first (τ)+ terms; F7 makes that cardinal regular and (τ)+τ+=κ<ρ. F4 gives the (τ)+ projection property, and F5 gives a positive limit-valued exact bound h. Cap it pointwise at the coordinate identity, writing h(a)=min{h(a),a}. This is still an upper bound since both entries of the minimum are upper bounds. It is exact because g<Ih implies g<Ih, which is strictly below some fξ by exactness. Also h is positive and limit-valued. Replace h by h, so now h(a)a everywhere.

step 3.1F3F4F5F7A1
5.1

Put B={aA:h(a)=a}. If BI, F2 gives an ultrafilter D on A containing B, of cofinality at least λ, and containing (I). Let J={XA:AXD}, a larger proper ideal; comparison modulo J is comparison modulo D. F5 transfers exactness of h to J. In the linear order A/D, the ρ<λ chain cannot be cofinal, by its cofinality lower bound, so a point witnessing noncofinality strictly bounds the entire chain. Represent it by tA. On BD, t(a)<a=h(a), hence t<Dh. Exactness modulo D then gives t<Dfξ for some ξ, contradicting that t bounds every chain term. Therefore BI. Reset h to zero on B. The result belongs to A because h(a)<a off B, and it remains an upper bound modulo I. Since each member of H is below a chain term, it bounds H. This closes the regular case of the induction. Steps 1.1–3.1 now give directedness for every cutoff, including singular λ, after extension to A.

step 1.1step 2.1step 3.1step 4.1F1F2F5
6.1

Write ν=cf(A/D). If XDJ<λ[A], F2 gives ν<λ. Conversely, suppose D avoids J<λ[A] and ν<λ. AC selects representatives of a cofinal family of ν quotient classes. The directedness just proved gives these representatives a strict upper bound modulo the proper ideal J<λ[A], hence modulo D: the complement of every ideal-small set belongs to D, since an ultrafilter contains either a set or its complement. A strict bound cannot bound a cofinal family in a linear order without a last element (F1). This contradiction proves νλ when the ideal is avoided, and establishes both directions of the first equivalence. Apply it also at λ+: avoidance at λ means νλ, and meeting at λ+ means ν<λ+. Since ν is a cardinal, these two inequalities hold exactly when ν=λ. This proves both directions of the second equivalence. If λ is finite or singular, ν=λ is impossible because F1 makes ν infinite regular, and the equivalent right side is correspondingly impossible. QED.

step 5.1F1F2F8A1

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