Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicableSession-authored (Fable 5 assisted)judge pass (deepseek-v4-pro + gpt-5.6-terra)verified 2026-08-04 (gpt-5.6-sol-codex-subscription)
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 XX be a set and let Filt(X)\mathrm{Filt}(X) be the set of all filters on XX (Filter on a set). Since every filter is a subset of P(X)\mathcal{P}(X), the family Filt(X)\mathrm{Filt}(X) is a subset of P(P(X))\mathcal{P}(\mathcal{P}(X)) and is therefore a set, carved out by Separation. Inclusion is a partial order on it (Partial order and partially ordered set): \subseteq is reflexive, antisymmetric by extensionality, and transitive.

An ultrafilter on XX is a filter on XX that is a maximal element of (Filt(X),)(\mathrm{Filt}(X), \subseteq) (Maximal element and greatest element): a filter U\mathcal{U} on XX such that no filter on XX strictly contains U\mathcal{U}, equivalently such that every filter G\mathcal{G} on XX with UG\mathcal{U} \subseteq \mathcal{G} satisfies G=U\mathcal{G} = \mathcal{U}.

An ultrafilter is principal if it is of the form {AX:xA}\{\, A \subseteq X : x \in A \,\} for some xXx \in X, and free, or non-principal, otherwise.

Remarks

  • Maximal is not greatest, and here the distinction is not academic. A greatest element of (Filt(X),)(\mathrm{Filt}(X), \subseteq) would be a filter containing every filter, and as soon as XX has two distinct points xyx \neq y no such filter exists: it would contain the principal filters at xx and at yy, hence both {x}\{x\} and {y}\{y\}, hence their intersection \emptyset, which properness forbids (Filter on a set). So on such an XX 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 UV\mathcal{U} \subseteq \mathcal{V} with U\mathcal{U} maximal forces V=U\mathcal{V} = \mathcal{U}. 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 U\mathcal{U} decides every subset by containing either AA 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 N\mathbb{N} 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 N\mathbb{N} 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 What the ultrafilter lemma costs: a choice principle strictly weaker than AC. So on N\mathbb{N} 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 N\mathbb{N}; 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: {AX:xA}\{A \subseteq X : x \in A\} is a filter, and if a filter G\mathcal{G} contains it then any BGB \in \mathcal{G} must meet {x}\{x\}, since otherwise B{x}=B \cap \{x\} = \emptyset lies in G\mathcal{G}, so xBx \in B and G\mathcal{G} is contained in the principal filter at xx. This is the one family of examples available without any choice principle.

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 13 results over 6 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources