Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck 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 ARA \subseteq \mathbb{R}, with closure A\overline{A} as in Interior, closure, boundary and exterior of a subset of R\mathbb{R} and derived set AA' as in Limit point, isolated point, adherent point, derived set, and dense subset of R\mathbb{R}. Write

E  :=  {xR:Nε(x)A for every real ε>0}E \;:=\; \{\, x \in \mathbb{R} : N_\varepsilon(x) \cap A \ne \varnothing \text{ for every real } \varepsilon > 0 \,\}

for the set of adherent points of AA (The ε\varepsilon-neighbourhood and the punctured ε\varepsilon-neighbourhood of a point of R\mathbb{R}). Then:

  1. A=E\overline{A} = E.
  2. A=AA\overline{A} = A \cup A'.
  3. A\overline{A} is the smallest closed superset of AA: it is closed, it contains AA, and it is contained in every closed FF with AFA \subseteq F.
  4. AA is closed if and only if A=AA = \overline{A}, if and only if AAA' \subseteq A.

Claim 3 is the content of the definition of A\overline{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 ARA \subseteq \mathbb{R}, and the set EE of adherent points of AA as displayed in the Statement.

[L1]

UU is open when every xUx \in U admits ε>0\varepsilon > 0 with Nε(x)UN_\varepsilon(x) \subseteq U; FF is closed when RF\mathbb{R} \setminus F is open (Open subset of R\mathbb{R} (every point has a neighbourhood inside it), closed subset (complement open), and clopen).

[L2]

xNε(x)x \in N_\varepsilon(x); Nε(x)=Nε(x){x}Nε(x)N^{*}_\varepsilon(x) = N_\varepsilon(x) \setminus \{x\} \subseteq N_\varepsilon(x); and if yNε(x)y \in N_\varepsilon(x) then δ:=εyx>0\delta := \varepsilon - |y - x| > 0 and Nδ(y)Nε(x)N_\delta(y) \subseteq N_\varepsilon(x) (The ε\varepsilon-neighbourhood and the punctured ε\varepsilon-neighbourhood of a point of R\mathbb{R}).

[L3]

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

[L4]

xx is an adherent point of AA when every Nε(x)N_\varepsilon(x) meets AA, a limit point when every Nε(x)N^{*}_\varepsilon(x) meets AA, and AA' is the set of limit points (Limit point, isolated point, adherent point, derived set, and dense subset of R\mathbb{R}).

Proof

technique · direct
1.1

AEA \subseteq E: for xAx \in A and any ε>0\varepsilon > 0 one has xNε(x)Ax \in N_\varepsilon(x) \cap A, so that intersection is nonempty.

L2L4
1.2

Let xREx \in \mathbb{R} \setminus E; by the definition of EE there is a real ε>0\varepsilon > 0 with Nε(x)A=N_\varepsilon(x) \cap A = \varnothing.

L4choose
1.3

Let FF be closed with AFA \subseteq F, and let xRFx \in \mathbb{R} \setminus F; since RF\mathbb{R} \setminus F is open there is a real η>0\eta > 0 with Nη(x)RFN_\eta(x) \subseteq \mathbb{R} \setminus F.

L1choose
2.1

For every yNε(x)y \in N_\varepsilon(x) the radius δ:=εyx\delta := \varepsilon - |y - x| is positive and Nδ(y)Nε(x)N_\delta(y) \subseteq N_\varepsilon(x), so Nδ(y)A=N_\delta(y) \cap A = \varnothing and yEy \notin E; hence Nε(x)REN_\varepsilon(x) \subseteq \mathbb{R} \setminus E, and since xx was an arbitrary point of RE\mathbb{R} \setminus E that set is open, that is, EE is closed.

step 1.2L1L2L4
2.2

From Nη(x)RFRAN_\eta(x) \subseteq \mathbb{R} \setminus F \subseteq \mathbb{R} \setminus A we get Nη(x)A=N_\eta(x) \cap A = \varnothing, so xEx \notin E; hence RFRE\mathbb{R} \setminus F \subseteq \mathbb{R} \setminus E, that is, EFE \subseteq F, for every closed FAF \supseteq A.

step 1.3L4
3.1

By steps 1.1 and 2.1 the set EE is a closed superset of AA, so AE\overline{A} \subseteq E by the leastness in [L3]; and A\overline{A} is itself a closed superset of AA by [L3], so step 2.2 applied to F=AF = \overline{A} gives EAE \subseteq \overline{A}. Hence A=E\overline{A} = E, which is claim 1.

step 1.1step 2.1step 2.2L3
4.1

E=AAE = A \cup A': if xEx \in E and xAx \notin A then for every ε>0\varepsilon > 0 some aNε(x)Aa \in N_\varepsilon(x) \cap A exists, and axa \ne x because xAx \notin A, so aNε(x)Aa \in N^{*}_\varepsilon(x) \cap A and xAx \in A'; conversely AEA \subseteq E by step 1.1, and AEA' \subseteq E because Nε(x)Nε(x)N^{*}_\varepsilon(x) \subseteq N_\varepsilon(x). Combining with step 3.1 gives A=AA\overline{A} = A \cup A', which is claim 2.

step 1.1step 3.1L2L4
5.1

Claim 4: if AA is closed then AA is a closed superset of itself, so AA\overline{A} \subseteq A by [L3], while AAA \subseteq \overline{A} by [L3], whence A=AA = \overline{A}; conversely if A=AA = \overline{A} then AA is closed because A\overline{A} is. Finally A=AA = \overline{A} says A=AAA = A \cup A' by step 4.1, and A=AAA = A \cup A' holds exactly when AAA' \subseteq 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

Depends on

Used by

Dependency tree · next 3 levels

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