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 generators restrict, finitely cover, and carry scales
Statement
Assume AC. Let be a nonempty progressive set of infinite regular cardinals and fix generators . For cardinals outside put . Then:
- If and , then generates over , and equals any modulo the latter ideal.
- Every is covered by finitely many with . Consequently, for every cardinal , consists exactly of subsets of finite unions of with .
- Every universal -sequence, for , restricts to a strict cofinal scale on , of true cofinality .
- For a proper filter on and any cardinal , the following are equivalent: ; and ; every ultrafilter extending has product cofinality . In particular an ultrafilter's product cofinality is the least generator index it contains.
- The cofinality of under everywhere comparison is , whether cofinality is defined using weak or strict domination.
Facts & Assumptions
Given: The set , AC and generating sequence of the statement. A proper filter excludes the empty set; comparisons modulo a filter require the corresponding comparison set to belong to that filter.
PCF is monotone, ultrafilter support extension preserves product cofinality, and a strict cofinal chain has its stated regular true cofinality (Progressive products and true cofinality transfers).
Cofinality ideals restrict by intersection, and their membership criterion tests supported ultrafilters (Pcf cofinality ideals and cutoff conventions).
The ultrafilter cutoff equivalences identify cofinality with avoiding and meeting (Pcf ideal directedness and ultrafilter cofinality cutoffs).
Every nonempty progressive subset has a maximum possible cofinality (Progressive pcf has a maximum and continuous cutoff ideals).
Universal sequences exist for every index in PCF (Progressive pcf has universally cofinal sequences).
Generators are positive and unique modulo the smaller ideal; their criterion is larger-ideal membership and containment by every cofinality- ultrafilter (Pcf cofinality ideals have single generators).
Under AC every proper filter extends to an ultrafilter (The ultrafilter lemma, from the Axiom of Choice: every filter extends to an ultrafilter).
Infinite cardinal multiplication and addition absorb smaller cardinals (Absorption: for cardinals with infinite and , , and when ).
AC selects witnesses from nonempty sets (The Axiom of Choice).
Proof
For nonempty , progressiveness persists because . Fix and put . F6 gives , so F2 gives . If on has cofinality , define . F1 gives the same cofinality on , so F6 gives , which means . F6's criterion on the progressive support now proves generation; its uniqueness proves equality modulo with every chosen generator there.
Fix , , and any universal sequence . F6 says , so is proper and the restricted chain is strict. Suppose some is not strictly below any restricted modulo this ideal. Then is positive for each . For , outside the -small failure set of we have . Hence for any finitely many indices with largest index , their -intersection contains minus a finite union of small sets and is positive. Its intersection with for any is still nonempty. Thus the family of these sets and the dual ideal on has the finite intersection property and generates a proper filter. By F7 extend it to an ultrafilter on , and extend by support to on using F1. This contains , avoids , and meets through ; F3 gives cofinality . Extend by zero off to a product function . Every yields . Universality gives with , a contradiction to those two inequalities on their -large intersection. Here is a product member because every coordinate is an infinite cardinal. Thus every is strictly dominated by a restricted term. F1 gives true cofinality , proving clause 3.
Put , which exists by F4 and is infinite by F1. Every everywhere-cofinal family maps to a cofinal family in an ultraproduct of cofinality , so has cardinality at least . For the opposite inequality, use A1 and F5 to choose a universal sequence for every . Its terms are indexed by pairs with and ; there are at most such pairs by F8, since the set of cardinals at most injects into , which has cardinality . Let consist of all finite pointwise maxima of those terms, including the empty maximum . For each finite length, F8 bounds the number of tuples by ; the countable union still has size at most by F8 and AC. All members of belong to the product and is closed under binary maxima. Given , put . The identity shows that if no , the subsets of these sets form a proper ideal: its empty member comes from , its union closure is the displayed identity, and it omits . Extend its proper dual filter by F7 to . For every , , so . But belongs to and its chosen universal sequence is contained in ; cofinality of that sequence dominates in , contradicting its bound by . Some , proving strict everywhere domination. Weak cofinality has the same lower bound and strict cofinality the proved upper bound, so both equal .
The empty set is covered by the empty family. Suppose a nonempty failed clause 2, and choose such an with least ; F4 applies by progressiveness as in step 1.1. By that step, generates the larger ideal on . Since , its remainder belongs to . If is empty, alone covers . Otherwise F4 gives by F2. Minimality of the counterexample gives a finite cover of by generators indexed in , using F1. Adjoining covers , again a contradiction. Thus the finite-cover assertion holds. If , each index in this cover is below by F2. Conversely for with , by F2 and F6; indices outside PCF contribute empty sets. Downward and finite-union closure prove the converse ideal characterization, including .
For any proper filter , a set lies in every ultrafilter extension if and only if . One direction is inclusion. For the other, if , each meets , since would force . Finite intersections in show that adjoining has the finite intersection property; its generated filter is proper and F7 extends it to an ultrafilter omitting . Now if a strict cofinal regular -chain exists modulo , it remains strict and cofinal in every ultrafilter extension. F1 therefore gives cofinality in all of them. Conversely suppose every extension has that cofinality. There is at least one extension by F7, so . By F6 each extension contains , and by F3 each avoids , hence contains each member of its dual. Applying the just-proved intersection property separately to these sets gives and . Finally suppose these latter conditions hold. They imply , hence by our empty-generator convention. By F5 and step 1.2 take a scale on modulo the restricted ideal and extend each term by zero off . For every comparison its successful set contains for some , which belongs to . For any product function, restrict it to and use the scale there; the same set calculation proves cofinality modulo . Strictness and F1 give true cofinality . This proves all three implications and covers cardinals outside PCF as well.
For an ultrafilter , set . F6 puts and F3 makes avoid . If , then by the ideal inclusion calculated in step 2.1 (or is empty), so . Thus the least generator index in exists and equals , which also proves the converse characterization of that least index. Clauses 1, 3 and 5 were proved in steps 1.1–1.3, clause 2 in step 2.1 and the filter equivalence in step 2.2. QED.
Depends on
- Progressive products and true cofinality transfers
- Pcf cofinality ideals and cutoff conventions
- Pcf ideal directedness and ultrafilter cofinality cutoffs
- Progressive pcf has a maximum and continuous cutoff ideals
- Progressive pcf has universally cofinal sequences
- Universal pcf sequences have strong increase and exact bounds
- Pcf cofinality ideals have single generators
- 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$
- The ultrafilter lemma, from the Axiom of Choice: every filter extends to an ultrafilter
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
56 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.