Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31
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.

Assuming the ultrafilter lemma, every net has a universal subnet

Statement

Assume the ultrafilter lemma. Every net has a universal subnet.

Facts & Assumptions

Given: A net x:DXx:D\to X and its tail filter Fx\mathcal F_x.

[A1]

Fx\mathcal F_x contains every tail TdT_d, and its members contain a tail (The tail filter of a net).

[L1]

The ultrafilter lemma extends Fx\mathcal F_x to an ultrafilter U\mathcal U (The ultrafilter lemma, from the Axiom of Choice: every filter extends to an ultrafilter).

[L2]

An ultrafilter contains every subset or its complement (Characterisation of ultrafilters: every set or its complement).

[A2]

A subnet uses an eventually cofinal index map (Subnet via an eventually cofinal index map).

[A3]

A universal net is eventually in every set or its complement (Universal net: eventually in every subset or eventually in its complement).

Proof

technique · constructive
1.1

Choose an ultrafilter UFx\mathcal U\supseteq\mathcal F_x by [L1]. Let E={(d,A):dD, AU, xdA}E=\{(d,A):d\in D,\ A\in\mathcal U,\ x_d\in A\}, ordered by (d,A)(e,B)(d,A)\preceq(e,B) when ded\le e and BAB\subseteq A, and put y(d,A)=xdy_{(d,A)}=x_d.

L1construct
2.1

The set EE is directed. Given (d,A),(e,B)(d,A),(e,B), choose hd,eh\ge d,e. Since ABA\cap B and the tail ThT_h belong to U\mathcal U, their intersection is nonempty; choose an index khk\ge h with xkABx_k\in A\cap B. Then (k,AB)(k,A\cap B) is above both pairs.

step 1.1A1choose
2.2

The map ϕ(d,A)=d\phi(d,A)=d is eventually cofinal: (d0,X)(d_0,X) is an index for every d0d_0, and every later index has first coordinate at least d0d_0. Thus yy is a subnet of xx.

step 1.1A2
2.3

For SXS\subseteq X, [L2] gives SUS\in\mathcal U or XSUX\setminus S\in\mathcal U. In the first case choose any d0Dd_0\in D. Since STd0US\cap T_{d_0}\in\mathcal U, choose jd0j\ge d_0 with xjSx_j\in S. Then (j,S)E(j,S)\in E, and every later value lies in SS. The complementary case is identical. Thus yy is universal.

step 1.1A1A3L2choose
3.1

The constructed yy is a universal subnet of xx.

step 2.2step 2.3discharge-construct

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 29 results over 7 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