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

Every nonempty closed subset A of R is the zero set of x↦d(x,A) and the intersection of the open sets {x:d(x,A)<1/(n+1)}, worked for [0,1] and for {0}

Example

Let R carry its usual metric dR(s,t)=∣s−t∣ and its usual topology (The absolute value makes R a metric space: d(x,y)=∣x−y∣ is a metric, its open balls are the intervals (x−r,x+r), and it is unbounded, Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not), and write 1/(n+1) for the inverse of the canonical natural ι(n+1) (The canonical natural ι(n)=n⋅1F of a field). Let A⊆R be nonempty and closed, and put d(x,A):=inf⁡{ ∣x−a∣:a∈A } (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space). Then, as the general metric theorem (In a metric space every closed set is a zero set and a Gδ, and the distance function separates a point from a closed set, so every metrizable space is Tychonoff and perfectly normal) specialises:

  1. x↦d(x,A) is continuous and A=Z(d(⋅,A)) (Zero sets and cozero sets of continuous real-valued functions), so A is a zero set.
  2. A=⋂n∈N{ x∈R:d(x,A)<1/(n+1) }, an intersection of open sets, so A is a Gδ of the topological space R (Gδ and Fσ subsets of a topological space, agreeing with the real-line notion) and hence a Gδ subset of R in the sense of Fσ and Gδ subsets of R, the two notions being the same one.

Two worked instances:

  • A=[0,1] (Intervals of R: the nine order-convex forms, nondegeneracy, and length). Here d(x,[0,1])={−xx<000≤x≤1x−1x>1 so Z(d(⋅,[0,1]))=[0,1] and, for every real ε>0, { x:d(x,[0,1])<ε }=(−ε, 1+ε). Taking ε=1/(n+1) gives [0,1]  =  ⋂n∈N(−1/(n+1), 1+1/(n+1)).
  • A={0}. Here d(x,{0})=∣x∣, so {0}  =  ⋂n∈N(−1/(n+1), 1/(n+1)), the standard presentation of a point of R as a Gδ.

The converse fails. A Gδ subset of R need not be closed: (0,1) is open, hence a Gδ by the constant sequence, and it is not closed.

Facts & Assumptions

Given: R with the usual metric and topology, a nonempty closed A⊆R, and reals x,a,ε with ε>0.

[A1]

d(x,A)=inf⁡{ ∣x−a∣:a∈A } exists for nonempty A, is a lower bound of that set, and is ≤∣x−a∣ for every a∈A; and any real that is a lower bound of the set is ≤d(x,A) (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space, Greatest lower bound (infimum)).

[L2]

The topological notions of Gδ and Fσ for R with its usual topology coincide with those of Fσ and Gδ subsets of R, the two collections of open subsets of R being one collection (Gδ and Fσ subsets of a topological space, agreeing with the real-line notion, Open subset of R (every point has a neighbourhood inside it), closed subset (complement open), and clopen).

[L3]

∣s∣≥0, ∣s∣=0 exactly when s=0, and for c>0 one has ∣s∣<c exactly when −c<s<c (Basic properties of the absolute value).

[L4]

[0,1]={ t:0≤t≤1 } and (u,v)={ t:u<t<v }; a two-element set of reals has a minimum (Intervals of R: the nine order-convex forms, nondegeneracy, and length, Maximum and minimum of a set).

Verification

technique · direct
1.1

Claims 1 and 2 are [L1] applied to the metric space R with dR, and the identification of the two readings of Gδ is [L2].

L1L2
1.2

For x<0: every a∈[0,1] has a≥0>x, so ∣x−a∣=a−x by [L3], and this is minimised over a∈[0,1] at a=0 with value −x; since −x belongs to the set and is a lower bound of it, d(x,[0,1])=−x by [A1].

A1L3L4
1.3

For 0≤x≤1: x∈[0,1] gives ∣x−x∣=0 in the set, and 0 is a lower bound by [L3], so d(x,[0,1])=0 by [A1].

A1L3L4
1.4

For x>1: every a∈[0,1] has a≤1<x, so ∣x−a∣=x−a, minimised at a=1 with value x−1, which lies in the set and is a lower bound; so d(x,[0,1])=x−1 by [A1].

A1L3L4
1.5

The set (0,1) is open, hence a Gδ by [L5], and is not closed, so a Gδ subset of R need not be closed.

L5
2.1

By steps 1.2, 1.3 and 1.4 the zero set of d(⋅,[0,1]) is {x:0≤x≤1}=[0,1], since −x>0 for x<0 and x−1>0 for x>1.

step 1.2step 1.3step 1.4L4
2.2

By steps 1.2, 1.3 and 1.4, for ε>0 the condition d(x,[0,1])<ε holds exactly when −x<ε for x<0, always for 0≤x≤1, and x−1<ε for x>1; that is, exactly when −ε<x<1+ε.

step 1.2step 1.3step 1.4L4
2.3

For A={0} the set { ∣x−a∣:a∈{0} } is the single value ∣x∣, so d(x,{0})=∣x∣ by [A1]; hence {x:d(x,{0})<1/(n+1)}=(−1/(n+1), 1/(n+1)) by [L3], and intersecting over n gives {0} by claim 2 of step 1.1.

step 1.1A1L3
3.1

Taking ε=1/(n+1) in step 2.2 and intersecting over n∈N gives [0,1]=⋂n(−1/(n+1), 1+1/(n+1)) by claim 2 of step 1.1.

step 1.1step 2.2
4.1

Steps 1.1, 3.1, 2.3 and 1.5 establish the two claims, the two worked instances and the failure of the converse.

step 1.1step 3.1step 2.3step 1.5∎

Remarks

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

71 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