Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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.

A point lies in the closure of a set if and only if a net in the set converges to it

Statement

For AXA\subseteq X and pXp\in X, one has pAp\in\overline A if and only if there is a net in AA converging to pp.

Facts & Assumptions

Given: A subset AA of a topological space XX and a point pXp\in X.

[L2]
[L3]

A net converges exactly when it is eventually in every neighbourhood (Convergence and cluster points of a net in a topological space).

Proof

technique · constructive
1.1

Suppose pAp\in\overline A. Let E={(N,a):NN(p), aNA}E=\{(N,a):N\in\mathcal N(p),\ a\in N\cap A\}, ordered by (N,a)(M,b)(N,a)\preceq(M,b) when MNM\subseteq N, and put x(N,a)=ax_{(N,a)}=a.

L1construct
1.2

Conversely, if a net xx in AA converges to pp, every neighbourhood NN of pp contains some eventual value xdAx_d\in A, so NAN\cap A\ne\varnothing and pAp\in\overline A.

L1L3
2.1

The index set is directed: for (N,a),(M,b)(N,a),(M,b), the set NMN\cap M is a neighbourhood and meets AA; for c(NM)Ac\in(N\cap M)\cap A, the pair (NM,c)(N\cap M,c) is above both.

step 1.1L1L2
2.2

Given a neighbourhood NN of pp, choose (N,a)E(N,a)\in E. Every later pair has its second coordinate in a subset of NN, so xx is eventually in NN and therefore converges to pp.

step 1.1L3
3.1

Steps 1.1--2.1 construct the required net and step 1.2 proves the converse.

step 2.2step 1.2discharge-construct

Depends on

Used by

Dependency tree · next 3 levels

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