Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedprecheck 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 topological space is Hausdorff if and only if every net has at most one limit

Statement

A topological space X is Hausdorff if and only if every net in X has at most one limit.

Facts & Assumptions

Given: A topological space X.

[A2]

A net converges to a point exactly when it is eventually in each of that point's neighbourhoods (Convergence and cluster points of a net in a topological space).

Proof

technique · constructive
1.1

Suppose X is Hausdorff and a net converges to both p and q. If p≠q, take disjoint neighbourhoods U of p and V of q; the net is eventually in both, and directedness supplies an index after both thresholds, whose value would lie in U∩V.

A1A2
1.2

Conversely, suppose X is not Hausdorff. Choose distinct p,q for which every neighbourhood of p meets every neighbourhood of q, and let E={(U,V,z):U∈N(p), V∈N(q), z∈U∩V}, ordered by reverse inclusion in the first two coordinates.

A1construct
2.1

Thus p=q, so every net has at most one limit.

step 1.1
2.2

The set E is directed: intersect the first two neighbourhood coordinates of two triples and choose a point in their intersection; the resulting triple is above both. The net sending (U,V,z) to z is eventually in every neighbourhood of p and every neighbourhood of q, hence converges to both distinct points.

step 1.2A1A2
3.1

Therefore uniqueness of all net limits forces X to be Hausdorff, and the two implications prove the result.

step 2.1step 2.2discharge-construct∎

Depends on

Used by

Dependency tree · two levels

11 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