Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-26
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.

The closure equals the set together with its limit points, equals the set of points every neighbourhood of which meets it, and is the smallest closed superset; a set is closed iff it contains its limit points

Statement

Let A⊆R, with closure A‾ as in Interior, closure, boundary and exterior of a subset of R and derived set A′ as in Limit point, isolated point, adherent point, derived set, and dense subset of R. Write

E  :=  { x∈R:Nε(x)∩A≠∅ for every real ε>0 }

for the set of adherent points of A (The ε-neighbourhood and the punctured ε-neighbourhood of a point of R). Then:

  1. A‾=E.
  2. A‾=A∪A′.
  3. A‾ is the smallest closed superset of A: it is closed, it contains A, and it is contained in every closed F with A⊆F.
  4. A is closed if and only if A=A‾, if and only if A′⊆A.

Claim 3 is the content of the definition of A‾ and is restated here so that the four descriptions stand together; claims 1, 2 and 4 are the ones that carry work.

Facts & Assumptions

Given: A subset A⊆R, and the set E of adherent points of A as displayed in the Statement.

[L1]

U is open when every x∈U admits ε>0 with Nε(x)⊆U; F is closed when R∖F is open (Open subset of R (every point has a neighbourhood inside it), closed subset (complement open), and clopen).

[L2]

x∈Nε(x); Nε∗(x)=Nε(x)∖{x}⊆Nε(x); and if y∈Nε(x) then δ:=ε−∣y−x∣>0 and Nδ(y)⊆Nε(x) (The ε-neighbourhood and the punctured ε-neighbourhood of a point of R).

[L3]

A‾ is the intersection of the nonempty family of closed supersets of A; it is closed, it contains A, and it is contained in every closed superset of A (Interior, closure, boundary and exterior of a subset of R, Arbitrary unions and finite intersections of open subsets of R are open, and dually for closed sets).

[L4]

x is an adherent point of A when every Nε(x) meets A, a limit point when every Nε∗(x) meets A, and A′ is the set of limit points (Limit point, isolated point, adherent point, derived set, and dense subset of R).

Proof

technique · direct
1.1

A⊆E: for x∈A and any ε>0 one has x∈Nε(x)∩A, so that intersection is nonempty.

L2L4
1.2

Let x∈R∖E; by the definition of E there is a real ε>0 with Nε(x)∩A=∅.

L4choose
1.3

Let F be closed with A⊆F, and let x∈R∖F; since R∖F is open there is a real η>0 with Nη(x)⊆R∖F.

L1choose
2.1

For every y∈Nε(x) the radius δ:=ε−∣y−x∣ is positive and Nδ(y)⊆Nε(x), so Nδ(y)∩A=∅ and y∉E; hence Nε(x)⊆R∖E, and since x was an arbitrary point of R∖E that set is open, that is, E is closed.

step 1.2L1L2L4
2.2

From Nη(x)⊆R∖F⊆R∖A we get Nη(x)∩A=∅, so x∉E; hence R∖F⊆R∖E, that is, E⊆F, for every closed F⊇A.

step 1.3L4
3.1

By steps 1.1 and 2.1 the set E is a closed superset of A, so A‾⊆E by the leastness in [L3]; and A‾ is itself a closed superset of A by [L3], so step 2.2 applied to F=A‾ gives E⊆A‾. Hence A‾=E, which is claim 1.

step 1.1step 2.1step 2.2L3
4.1

E=A∪A′: if x∈E and x∉A then for every ε>0 some a∈Nε(x)∩A exists, and a≠x because x∉A, so a∈Nε∗(x)∩A and x∈A′; conversely A⊆E by step 1.1, and A′⊆E because Nε∗(x)⊆Nε(x). Combining with step 3.1 gives A‾=A∪A′, which is claim 2.

step 1.1step 3.1L2L4
5.1

Claim 4: if A is closed then A is a closed superset of itself, so A‾⊆A by [L3], while A⊆A‾ by [L3], whence A=A‾; conversely if A=A‾ then A is closed because A‾ is. Finally A=A‾ says A=A∪A′ by step 4.1, and A=A∪A′ holds exactly when A′⊆A.

step 4.1L3
6.1

Claim 3 is [L3] restated, and claims 1, 2 and 4 are steps 3.1, 4.1 and 5.1, so all four hold.

step 3.1step 4.1step 5.1L3∎

Remarks

  • Which claim does the work in practice. Claim 1 is the one used almost everywhere below: to show a point lies in A‾ one exhibits, for each ε>0, a point of A within ε of it. Claim 2 is what separates the two ways a point can be adherent, by membership or by accumulation, and it is what makes the notion of an isolated point visible.

  • No special property of R is used. The argument uses the definitions of open, closed, neighbourhood and closure, and the order enters only through the nesting property of neighbourhoods; neither the least-upper-bound property nor the Archimedean property appears at any step. The results of this page that do use them are flagged in Which results on this page use the order of R and therefore have no general-topological analogue.

  • The sequential form is a separate theorem and costs more. Replacing "every neighbourhood meets A" by "some sequence in A converges to x" is A point lies in the closure of A⊆R iff some sequence in A converges to it, so a subset of R is closed iff it is sequentially closed, and the passage from the first to the second spends the axiom of countable choice, since it selects one point of A from each of infinitely many neighbourhoods. The characterisation proved above is choice free.

Depends on

Used by

…and 1 more result.

Dependency tree · two levels

14 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