LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (openai/gpt-5.4)verified 2026-07-26 (claude-opus-5)

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.

Ultrafilters are prime: a union in $U$ has a member in $U$

Statement

Let $U$ be an ultrafilter on a set $X$ (Ultrafilter) and let $A, B \subseteq X$ . If $A \cup B \in U$ then $A \in U$ or $B \in U$ .

More generally, for every $n \in N$ and every finite list $s : n \to P (X)$ (The natural numbers $N$ (von Neumann)), writing $⋃_{i \in n} s (i) = {x \in X : x \in s (i) for some i \in n}$ , which is $\emptyset$ when $n = 0$ : if $⋃_{i \in n} s (i) \in U$ then $s (i) \in U$ for some $i \in n$ .

Facts & Assumptions

Given: A set $X$ , an ultrafilter $U$ on $X$ , and subsets $A, B \subseteq X$ with $A \cup B \in U$ .

[A1]

$U$ is a filter on $X$ : $X \in U$ , $\emptyset \notin U$ , $U$ is closed under pairwise intersection, and closed upward in $X$ (Filter on a set, Ultrafilter).

[L1]

For every $C \subseteq X$ , exactly one of $C \in U$ and $X ∖ C \in U$ holds (Characterisation of ultrafilters: every set or its complement).

[L2]

Induction on $N$ : a property holding at $0$ and passing from $n$ to $σ (n)$ holds for every natural number; and $σ (n) = n \cup {n}$ (The principle of mathematical induction, The natural numbers $N$ (von Neumann)).

Proof

technique · direct

1.1

Suppose $A \notin U$ ; then $X ∖ A \in U$ .

L1assume-hyp

1.2

As sets, $(A \cup B) \cap (X ∖ A) = B \cap (X ∖ A) \subseteq B \subseteq X$ .

given

2.1

Both $A \cup B$ and $X ∖ A$ lie in $U$ , hence so does their intersection.

step 1.1givenA1

3.1

Upward closure applied to $(A \cup B) \cap (X ∖ A) \subseteq B$ gives $B \in U$ ; so $A \in U$ or $B \in U$ .

step 2.1step 1.2A1

4.1

The finite case follows by induction on $n$ : for $n = 0$ the union is empty and $\emptyset \notin U$ , so the hypothesis never holds and the claim is vacuous; and if the claim holds for lists of length $n$ , then for $s : σ (n) \to P (X)$ one has $⋃_{i \in σ (n)} s (i) = (⋃_{i \in n} s (i)) \cup s (n)$ , so the binary case puts either $s (n)$ or $⋃_{i \in n} s (i)$ in $U$ , and in the second alternative the claim for $n$ supplies an $i \in n$ with $s (i) \in U$ .

step 3.1A1L2

5.1

So an ultrafilter is prime: it contains a member of every finite union it contains.

step 3.1step 4.1∎

Remarks

The converse holds too, and is worth stating even though it is not needed below: a filter $U$ with the property that $A \cup B \in U$ implies $A \in U$ or $B \in U$ is an ultrafilter, because $A \cup (X ∖ A) = X \in U$ forces one of $A$ and $X ∖ A$ into $U$ , which is Characterisation of ultrafilters: every set or its complement. Primeness and maximality are therefore the same condition, which is why the ultrafilter lemma is a form of the Boolean prime ideal theorem (The proved choice cost of the ultrafilter lemma).
The finite case does not extend to infinite unions. On $N$ an ultrafilter containing every tail contains $N = ⋃_{x \in N} {x}$ but no singleton (FALSE, once the ultrafilter lemma is available: every ultrafilter is principal), so a union of infinitely many sets can lie in $U$ with no single member of the union doing so.
Read through the two-valued measure of Characterisation of ultrafilters: every set or its complement, primeness says that a union of finitely many null sets is null, the complementary form of closure under finite intersection.

Depends on

Used by

Dependency tree · two levels

16 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 (set theory) (Wikipedia) (standard reference, not scraped)
Boolean prime ideal theorem (Wikipedia) (standard reference, not scraped)
Ultrafilter (Wikipedia) (standard reference, not scraped)

Ultrafilters are prime: a union in UU has a member in UU