Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27
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 distance ψ(x)=d(x,Z) from a real number to the integers is 1-Lipschitz, hence uniformly continuous, takes values in [0,1/2], and vanishes exactly on Z

Example

Take R with its usual metric d(x,y)=∣x−y∣ (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), identify Z with its canonical copy inside R (The integers as equivalence classes of pairs of naturals, The naturals embed in the integers, The integers embed in the rationals, The rationals embed densely in the reals), and let

ψ(x)  :=  d(x,Z)  =  inf⁡{ ∣x−n∣ : n∈Z }

be the distance from x to the nonempty set Z (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space). Then:

  1. ψ is 1-Lipschitz on R: ∣ψ(x)−ψ(y)∣≤∣x−y∣ for all real x,y. Consequently ψ is uniformly continuous on R (Uniform continuity of f:A→R: one δ serving every pair of points of A) and continuous on R (Continuity of f:A→R at a point of A and on A: the ε-δ condition, its agreement with lim⁡x→cf(x)=f(c) at a limit point, and continuity at an isolated point).
  2. The infimum is attained, and computed. Writing m:=⌊x⌋ for the integer part of x (Integer part: for every real x there is exactly one integer m with m≤x<m+1) and t:=x−m, so that 0≤t<1, ψ(x)  =  min⁡{ t, 1−t }  =  min⁡{ ∣x−m∣, ∣x−(m+1)∣ }, so ψ(x)=∣x−n∣ for n=m or n=m+1.
  3. Range. 0≤ψ(x)≤1/2 for every real x (Intervals of R: the nine order-convex forms, nondegeneracy, and length).
  4. Zero set. ψ(x)=0 if and only if x∈Z.

Why this example is here. It is the standard uniformly continuous function of this track that is not defined by a formula in the field operations, and it is obtained from the metric machinery rather than rebuilt: claim 1 is ∣d(x,A)−d(y,A)∣≤d(x,y), so the distance to a fixed nonempty set is 1-Lipschitz applied to A:=Z in the metric space R, transported to a statement about a real function by Dictionary: for A⊆R with the metric d(x,y)=∣x−y∣, continuity and uniform continuity of f:A→R agree with the metric-space notions, the Lipschitz and Hölder conditions are the metric ones instantiated, and a subset of R is compact in the open-cover sense of R exactly when it is a compact metric subspace, clause 3. Only claims 2 to 4, which compute the value, need an argument of their own.

The same function is computed elsewhere, and nothing here depends on that. The trigonometry-free oscillator ψ(x)=inf⁡n∈Z∣x−n∣ is well defined and attained at a nearest integer, takes values in [0,1/2], vanishes exactly on Z, equals 1/2 at half-integers, and is 1-periodic introduces ψ on the companion page of The ε-δ limit lim⁡x→cf(x)=L of f:A→R at a limit point c of A and proves the same computation together with 1-periodicity and the value at half-integers. That item lives on an examples page, which is a leaf of the dependency graph, so no item may rest on it; the verification below is therefore self-contained, and the duplication is deliberate rather than an oversight.

Facts & Assumptions

Given: R with the metric d(x,y)=∣x−y∣; the canonical copy of Z inside R; a real x, the integer m:=⌊x⌋ and the real t:=x−m; and ψ(x):=d(x,Z).

[L1]

Distance to a nonempty set: for nonempty A⊆X in a metric space, d(x,A):=inf⁡{ d(x,a):a∈A }, the infimum existing because the set of distances is nonempty and bounded below by 0 (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space, Greatest lower bound (infimum), Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric).

[L2]

∣d(x,A)−d(y,A)∣≤d(x,y): the distance to a fixed nonempty set is 1-Lipschitz as a map of metric spaces (∣d(x,A)−d(y,A)∣≤d(x,y), so the distance to a fixed nonempty set is 1-Lipschitz).

[L4]

R with d(x,y)=∣x−y∣ is a metric space (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), and Z sits inside R as a totally ordered subring containing 0 and 1 and closed under n↦n±1, with no integer strictly between n and n+1 (The integers as equivalence classes of pairs of naturals, The naturals embed in the integers, The integers embed in the rationals, The rationals embed densely in the reals).

[L5]

Integer part: for every real x there is exactly one integer m with m≤x<m+1 (Integer part: for every real x there is exactly one integer m with m≤x<m+1).

[L6]

Infimum and minimum: a lower bound of a set that belongs to the set is its infimum and its minimum (Greatest lower bound (infimum), Maximum and minimum of a set); and the minimum of a two-element set of reals exists and is one of the two (Every nonempty finite set of reals has a maximum and a minimum).

[L7]

Absolute value and order: ∣u∣≥0; ∣u∣=0 exactly when u=0; ∣u∣=u for u≥0 and ∣u∣=−u for u≤0; the order is total; 1/2>0 and 1−1/2=1/2 (Basic properties of the absolute value, Ordered field, Intervals of R: the nine order-convex forms, nondegeneracy, and length).

Verification

technique · direct
1.1

Z is a nonempty subset of the metric space R, since 0∈Z, so ψ(x)=d(x,Z) is defined for every real x by [L1], and ψ(x)≥0.

L1L4L7
1.2

By [L5] the integer m=⌊x⌋ satisfies m≤x<m+1, so t=x−m satisfies 0≤t<1, and (m+1)−x=1−t satisfies 0<1−t≤1.

L5L7
2.1

Claim 1. By [L2], ∣ψ(x)−ψ(y)∣=∣d(x,Z)−d(y,Z)∣≤d(x,y)=∣x−y∣ for all real x,y; by [L3] this says exactly that ψ is Lipschitz with constant 1 as a real function on R, hence uniformly continuous on R and continuous on R.

step 1.1L2L3
2.2

Every distance from x to an integer is at least min⁡{t,1−t}. Let n∈Z. By [L4] and totality either n≤m or m<n, and in the second case m+1≤n. If n≤m then x−n≥x−m=t≥0, so ∣x−n∣=x−n≥t. If m+1≤n then n−x≥(m+1)−x=1−t>0, so ∣x−n∣=n−x≥1−t. Either way ∣x−n∣≥min⁡{t,1−t}.

step 1.2L4L6L7
2.3

Both candidate values occur. Since t≥0 we have t=∣x−m∣, and since 1−t>0 we have 1−t=∣x−(m+1)∣, with m and m+1 in Z.

step 1.2L4L7
3.1

Claim 2. By steps 2.2 and 2.3 the real min⁡{t,1−t} is a lower bound of { ∣x−n∣:n∈Z } belonging to that set, so by [L6] it is the infimum and the minimum: ψ(x)=min⁡{t,1−t}=min⁡{∣x−m∣,∣x−(m+1)∣}, attained at n=m or n=m+1.

step 2.2step 2.3L1L6
4.1

Claim 3. ψ(x)≥0 since t≥0 and 1−t>0. And ψ(x)≤1/2: if t≤1/2 then ψ(x)≤t≤1/2, while if t>1/2 then 1−t<1−1/2=1/2 and ψ(x)≤1−t<1/2. So 0≤ψ(x)≤1/2.

step 1.2step 3.1L7
4.2

Claim 4. If ψ(x)=0 then min⁡{t,1−t}=0 by step 3.1; since 1−t>0 this forces t=0, that is x=m∈Z. Conversely if x∈Z then ∣x−x∣=0 is a member of the set of distances and 0 is a lower bound of it by step 1.1, so ψ(x)=0 by [L6].

step 1.1step 1.2step 3.1L6L7
5.1

Claims 1 to 4 are verified: ψ is 1-Lipschitz and therefore uniformly continuous and continuous on R, its value at x is min⁡{t,1−t} and is attained at a nearest integer, its values lie in [0,1/2], and it vanishes exactly on Z.

step 2.1step 3.1step 4.1step 4.2∎

Remarks

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

81 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