Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablejudge 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 ε-neighbourhood and the punctured ε-neighbourhood of a point of R

Definition

Throughout, R is the complete ordered field (Complete ordered field (least-upper-bound property), Ordered field) with its order (Order on the reals) and its absolute value (Absolute value in an ordered field).

Let x∈R and let ε∈R with ε>0. The ε-neighbourhood of x is

Nε(x)  :=  { y∈R:∣y−x∣<ε },

and the punctured ε-neighbourhood of x is

Nε∗(x)  :=  Nε(x)∖{x}  =  { y∈R:0<∣y−x∣<ε }.

The two descriptions of Nε∗(x) agree because ∣y−x∣=0 holds exactly when y=x (Basic properties of the absolute value).

A neighbourhood is an open interval. For every x and every ε>0,

Nε(x)  =  (x−ε, x+ε),

the interval of Intervals of R: the nine order-convex forms, nondegeneracy, and length. Indeed Basic properties of the absolute value gives, for ε>0, the equivalence ∣y−x∣<ε  ⟺  −ε<y−x<ε, and adding x throughout turns the right-hand side into x−ε<y<x+ε (Ordered field).

The centre lies in its own neighbourhoods. x∈Nε(x), since ∣x−x∣=∣0∣=0<ε (Basic properties of the absolute value).

Punctured neighbourhoods are never empty. The element y:=x+ε/2 satisfies ∣y−x∣=ε/2, which is >0 and <ε, so y∈Nε∗(x) (Basic properties of the absolute value, Ordered field).

Monotonicity in the radius. If 0<δ≤ε then Nδ(x)⊆Nε(x), because ∣y−x∣<δ≤ε (Ordered field).

Nesting at an interior point. If y∈Nε(x) and 0<δ≤ε−∣y−x∣, then

Nδ(y)  ⊆  Nε(x).

Indeed for z∈Nδ(y) the triangle inequality (The triangle inequality) gives ∣z−x∣=∣(z−y)+(y−x)∣≤∣z−y∣+∣y−x∣<δ+∣y−x∣≤ε. Note that ε−∣y−x∣>0 precisely because y∈Nε(x), so such a δ always exists.

Remarks

  • The radius is a real number, not a rational. Nothing on this page tests a condition against rational radii only. That convention belongs to Limits and Cauchy sequences of reals, where the quantifier is over rational ε and the passage between the rational and the real form is the sanctioned remark of Sequences of reals: bounded, eventually, frequently, tails, subsequences. Here ε ranges over the positive reals throughout, and every statement above is proved for an arbitrary positive real.

  • Why the punctured version is separated out. A limit point of a set is a point every punctured neighbourhood of which meets the set (Limit point, isolated point, adherent point, derived set, and dense subset of R), and deleting the centre is exactly what stops a point of the set from qualifying automatically. The unpunctured condition defines the weaker notion of an adherent point, and the difference between the two is precisely an isolated point.

  • Nesting is the workhorse. Almost every openness verification on this page has the shape "given y in the set, shrink the radius by the distance already travelled", which is the nesting property above. It is recorded here once so that no later proof has to redo the triangle inequality in passing.

Depends on

Used by

…and 84 more results.

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