Alphabeta Math
LemmaStatement: 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 filter and its canonical derived net have the same limits and cluster points

Statement

A filter F and the net derived from it have exactly the same limits and cluster points.

Facts & Assumptions

Given: A filter F on X, its derived net, and p∈X.

[A1]

The derived net is indexed by (A,x) with A∈F, x∈A, ordered by reverse inclusion of the first coordinate (The canonical net indexed by the pairs (A,x) with A in a filter and x∈A).

[A2]

Filter and net convergence and cluster points have their stated neighbourhood formulations (Convergence and cluster points of a filter on a topological space, Convergence and cluster points of a net in a topological space).

Proof

technique · direct
1.1

If a neighbourhood N of p belongs to F, choose x∈N; then (N,x) is an index, and every later (B,y) has B⊆N, hence y∈N. Thus filter convergence implies convergence of the derived net.

A1A2
2.1

If the derived net is eventually in N, take a threshold (A,x). Applying eventuality to indices (A,y) with y∈A gives A⊆N; upward closure of the filter gives N∈F. Thus convergence is equivalent.

step 1.1A1A2
3.1

The derived net is frequently in N exactly when every A∈F meets N: after (A,x) a point of A∩N supplies a later index, and conversely frequent membership after (A,x) supplies such a point. Therefore its cluster points are exactly those of F.

A1A2∎

Depends on

Used by

Dependency tree · two levels

7 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