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.
Ultrafilter
Definition
Let be a set and let be the set of all filters on (Filter on a set). Since every filter is a subset of , the family is a subset of and is therefore a set, carved out by Separation. Inclusion is a partial order on it (Partial order and partially ordered set): is reflexive, antisymmetric by extensionality, and transitive.
An ultrafilter on is a filter on that is a maximal element of (Maximal element and greatest element): a filter on such that no filter on strictly contains , equivalently such that every filter on with satisfies .
An ultrafilter is principal if it is of the form for some , and free, or non-principal, otherwise.
Remarks
- Maximal is not greatest, and here the distinction is not academic. A greatest element of would be a filter containing every filter, and as soon as has two distinct points no such filter exists: it would contain the principal filters at and at , hence both and , hence their intersection , which properness forbids (Filter on a set). So on such an there is no greatest filter, and reading "maximal" as "greatest" is the error recorded in FALSE: every maximal element is a greatest element. Note what that argument does and does not deliver. It says nothing whatever about which filters are maximal, nor that any is: the absence of a greatest element is compatible with there being no maximal element at all. What does follow, from maximality itself and not from the argument above, is that two distinct ultrafilters are never comparable, since with maximal forces . How many ultrafilters there are is a separate question again, which the argument above does not touch and which this library does not answer at all: the ultrafilter lemma gives EXISTENCE (every filter extends to an ultrafilter), never a count, and The ultrafilter lemma, from the Axiom of Choice: every filter extends to an ultrafilter says so in its own remarks. See the existence bullet below.
- Maximality is a negative condition, which is what makes it usable: it says nothing can be added, not that everything is already there. The positive reformulation, that decides every subset by containing either or its complement, is Characterisation of ultrafilters: every set or its complement, and it is the form used in practice.
- Existence is free; extension and freeness are not. Ultrafilters exist on every nonempty set with no choice principle at all: the principal filter at a point is one, as the next bullet verifies outright. Two stronger existence statements are what cost something. That every filter is contained in an ultrafilter is The ultrafilter lemma, from the Axiom of Choice: every filter extends to an ultrafilter, proved here from Zorn's lemma (Zorn's lemma); and that some ultrafilter is free is what the ultrafilter lemma buys, since extending the filter of cofinite subsets of produces a non-principal one. Neither is a theorem of ZF alone: if ZF is consistent, ZF does not prove that a free ultrafilter on exists (Feferman 1965, Feferman 1965: ZF does not prove that a free ultrafilter on the naturals exists ‡), and hence does not prove the ultrafilter lemma either. That external result is recorded, not proved, in this library, and the strength the lemma costs is set out in The proved choice cost of the ultrafilter lemma. So on the principal ultrafilters are the only ones ZF alone can be relied on to produce. The same conclusion for every set at once does not follow from Feferman's model, which concerns ; it is the separate and stronger external result Blass 1977: a model of ZF with no free ultrafilter on any set ‡, likewise recorded and not proved here. Once the ultrafilter lemma is available -- and this library proves it from the Axiom of Choice (The ultrafilter lemma, from the Axiom of Choice: every filter extends to an ultrafilter) -- the principal ultrafilters are nevertheless not all of them (FALSE, once the ultrafilter lemma is available: every ultrafilter is principal); in ZF alone that cannot be concluded.
- Principal ultrafilters really are ultrafilters: is a filter, and if a filter contains it then any must meet , since otherwise lies in , so and is contained in the principal filter at . This is the one family of examples available without any choice principle.
Depends on
Used by
- The tail-flip symmetric model has no free ultrafilter on omega Corollary
- The tail-flip symmetric model refutes BPI Corollary
- A free ultrafilter induces a finitely additive zero-one probability that is not countably additive Counterexample
- Finite bit flips cannot defeat a free ultrafilter Counterexample
- If the exclusion of ∅ is dropped, P(X) becomes the unique maximal improper filter Counterexample
- Complete ultrafilters and measurable cardinals Definition
- Rescaled ultralimits and asymptotic cones Definition
- Set ultraproducts and constant-map ultrapowers Definition
- The ultrafilter extension principle (UL/BPI) Definition
- An ultrafilter extending the Fréchet filter on ℕ is free, and its existence uses the ultrafilter lemma Example
- Assuming the ultrafilter lemma, a free ultrafilter on ℕ converges to the added point in the one-point convergent-sequence space Example
- On finite sets the ultrafilter monad is naturally isomorphic to the identity; assuming the ultrafilter lemma, its unit is not invertible on the natural numbers Example
- The subsets of X containing a fixed point x form the principal ultrafilter at x Example
- FALSE, once the ultrafilter lemma is available: every ultrafilter is principal False statement
- A given ultrafilter on a compact Hausdorff space has a unique limit Lemma
- Every cluster point of an ultrafilter is a limit of that ultrafilter Lemma
- Every ultrafilter on a totally bounded uniform space is Cauchy Lemma
- Progressive products and true cofinality transfers Lemma
- Pushforward sends ultrafilters to ultrafilters and is functorial Lemma
- The open-set family induced by an ultrafilter algebra is a topology Lemma
- The principal-ultrafilter and ultrafilter-flattening formulas are well-defined and natural Lemma
- Ultrafilters are prime: a union in U has a member in U Lemma
- A free ultrafilter on ℕ, viewed as a subset of {0,1}^ℕ and hence of [0,1], is not Lebesgue measurable Theorem
- A net is universal exactly when its tail filter is an ultrafilter, and the canonical net of an ultrafilter is universal Theorem
- BPI and the set ultrafilter lemma are equivalent Theorem
- BPI and the set ultrafilter lemma are equivalent over ZF Theorem
- Characterisation of ultrafilters: every set or its complement Theorem
- Every ultrafilter on every set is principal in Blass's model Theorem
- Products of cofinite spaces are compact exactly under BPI Theorem
- Small forcing does not create measurable cardinals Theorem
- The codensity monad of the small skeleton of finite sets is the ultrafilter monad Theorem
- The ultrafilter lemma, from the Axiom of Choice: every filter extends to an ultrafilter Theorem
Dependency tree · two levels
6 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
- Ultrafilter (Wikipedia) (standard reference, not scraped)
- Ultrafilter (set theory) (Wikipedia) (standard reference, not scraped)