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 be a nonempty progressive set of infinite regular cardinals. For every cardinal , 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 on ,
These assertions include finite and all finite, infinite and singular cutoffs . For , 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.
PCF is monotone, preserves finite unions, equals for finite , and consists of infinite regular ultraproduct cofinalities; restrictions to ultrafilter supports preserve the quotient order (Progressive products and true cofinality transfers).
The cutoff families are ideals and restrict to subsets; means some ultrafilter supported on has product cofinality at least . Every such ultrafilter contains (Pcf cofinality ideals and cutoff conventions).
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 is small (Directed progressive products have club continuous chains).
Strong increase with regular gives the projection property (Strongly increasing subsequences force a bounding projection).
For regular length greater than , the 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).
A set smaller than the cofinality of a limit ordinal is bounded; cofinal subsets of that cardinality exist (; and ; for a limit ordinal the value is an infinite cardinal with , so it is regular; and every cofinal subset of has cardinality at least , a value that is attained, (c)–(d)).
Successor cardinals are regular under AC ( is regular in ZF; assuming the Axiom of Choice every successor aleph is regular; , so is singular, and under choice it is the least singular infinite cardinal, (b)).
An ultrafilter contains exactly one of each set and its complement (Characterisation of ultrafilters: every set or its complement).
AC supplies enumerations and simultaneous bound witnesses (The Axiom of Choice).
Proof
If , the empty function is the sole product member; no ultrafilter exists by F1. If is improper, every comparison failure set belongs to , so the zero function weakly bounds every family. Assume henceforth that and is proper. For finite , F1–F2 give with . For , define on , and on . At each remaining coordinate, , so F6 gives . Thus strictly bounds modulo . The empty has supremum zero. At there are no families of size less than , so directedness is vacuous.
Let be infinite and . Progressiveness gives for all . If , there are at most three cardinals in below . Their set belongs to by the finite PCF calculation in F1. The supremum formula of step 1.1 on again bounds every family. If , remove instead , also finite and -small. Let and by F2. Restriction and zero extension preserve and reflect comparisons modulo these ideals: a failure set differs from its restricted version only inside . Bounds on therefore extend to bounds on . We have , infinite and . If were improper, would imply , impossible. It remains to bound families on this proper reduced support.
Keep fixed and prove, by induction on cardinals , that every family of size has a bound. This induction is valid because a nonempty set of failed cardinal sizes below would have a least member. If , the pointwise formula is below every by F6 and is a strict bound. If is singular and all smaller sizes are bounded, enumerate by AC and fix cofinal indices in . Each subfamily with has a bound by induction. AC chooses these bounds simultaneously; the family of bounds has size at most , so induction bounds it too. For each choose with ; composing its two weak comparisons gives a common weak bound for , and a coordinate successor gives a strict bound.
It remains to consider regular . The induction assumption makes the product -directed. Put , regular by F7 and uncountable because is infinite. Then , , and . Apply F3 to an enumeration of , obtaining a strict -chain with each enumerated member pointwise below and with . Set . 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 . Cap it pointwise at the coordinate identity, writing . This is still an upper bound since both entries of the minimum are upper bounds. It is exact because implies , which is strictly below some by exactness. Also is positive and limit-valued. Replace by , so now everywhere.
Put . If , F2 gives an ultrafilter on containing , of cofinality at least , and containing . Let , a larger proper ideal; comparison modulo is comparison modulo . F5 transfers exactness of to . In the linear order , the chain cannot be cofinal, by its cofinality lower bound, so a point witnessing noncofinality strictly bounds the entire chain. Represent it by . On , , hence . Exactness modulo then gives for some , contradicting that bounds every chain term. Therefore . Reset to zero on . The result belongs to because off , and it remains an upper bound modulo . Since each member of is below a chain term, it bounds . This closes the regular case of the induction. Steps 1.1–3.1 now give directedness for every cutoff, including singular , after extension to .
Write . If , F2 gives . Conversely, suppose avoids 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 , hence modulo : the complement of every ideal-small set belongs to , 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.
Depends on
- Progressive products and true cofinality transfers
- Pcf cofinality ideals and cutoff conventions
- Directed progressive products have club continuous chains
- Strongly increasing subsequences force a bounding projection
- Bounding projections produce an exact upper bound with large coordinate cofinalities
- The Axiom of Choice
- $\operatorname{cf}(\alpha) \le \alpha$; $\operatorname{cf}(0) = 0$ and $\operatorname{cf}(\alpha + 1) = 1$; for a limit ordinal $\lambda$ the value $\operatorname{cf}(\lambda)$ is an infinite cardinal with $\operatorname{cf}(\operatorname{cf}(\lambda)) = \operatorname{cf}(\lambda)$, so it is regular; and every cofinal subset of $\lambda$ has cardinality at least $\operatorname{cf}(\lambda)$, a value that is attained
- $\aleph_0$ is regular in ZF; assuming the Axiom of Choice every successor aleph $\aleph_{\alpha+1}$ is regular; $\operatorname{cf}(\aleph_\omega) = \aleph_0$, so $\aleph_\omega$ is singular, and under choice it is the least singular infinite cardinal
- Transfinite recursion
- Commutativity, associativity, distributivity and monotonicity of $\oplus$ and $\otimes$, the unit laws, the two exponent laws, and $\kappa \le \lambda$ if and only if $\kappa$ injects into $\lambda$
- Absorption: for cardinals $\kappa, \lambda$ with $\kappa$ infinite and $\lambda \le \kappa$, $\kappa \oplus \lambda = \kappa$, and $\kappa \otimes \lambda = \kappa$ when $\lambda \ne 0$
- Characterisation of ultrafilters: every set or its complement
Used by
- Universal pcf sequences have strong increase and exact bounds Lemma
- Pcf cofinality ideals have single generators Theorem
- Pcf generators restrict, finitely cover, and carry scales Theorem
- Pcf has no holes for progressive intervals Theorem
- Progressive pcf has a maximum and continuous cutoff ideals Theorem
- Progressive pcf has universally cofinal sequences Theorem
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
- Abraham and Magidor, Cardinal Arithmetic, Theorem 3.4 and Corollary 3.5, pp. 32–33 (standard reference, not scraped)