Alphabeta Math
ExampleConstruction: AI-adaptedVerification: 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.

min⁡(∣x−y∣,1) on R has the usual topology and diameter at most 1

Example

On R, let dR(x,y)=∣x−y∣ be the usual metric (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 put

ρ(x,y):=min⁡{ ∣x−y∣, 1 }(x,y∈R).

Then:

  1. ρ is a metric on R, uniformly equivalent and therefore topologically equivalent to dR (Topologically, uniformly and Lipschitz equivalent metrics on a set, Lipschitz equivalence implies uniform equivalence implies topological equivalence); so (R,ρ) has exactly the usual topology of the real line.
  2. (R,ρ) is a bounded metric space and diam⁡(R)=1 in the metric ρ (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space), whereas (R,dR) is not bounded at all and has no diameter.

This is the concrete instance of min⁡(d,1) and d/(1+d) are metrics uniformly equivalent to d, so every metric space carries a bounded metric with the same topology on the real line, and it is the witness used for the failure of two plausible-sounding claims: that boundedness is topological, and that topologically equivalent metrics are Lipschitz equivalent.

Facts & Assumptions

Given: The real line with dR(x,y)=∣x−y∣ and the function ρ=min⁡{dR,1}; the set D:={ ρ(x,y):x,y∈R }.

[L2]

For any metric d, the function min⁡{d,1} is a metric, is bounded with diameter at most 1 on a nonempty space, and is uniformly equivalent to d (min⁡(d,1) and d/(1+d) are metrics uniformly equivalent to d, so every metric space carries a bounded metric with the same topology).

[L5]

The diameter is the least upper bound of the set of distances, so it is ≥ every distance and ≤ every upper bound of them; and it is unique (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space, Suprema and infima are unique, Complete ordered field (least-upper-bound property), Ordered field).

Verification

technique · direct
1.1

By [L1] the function dR is a metric on R and R is not bounded in it.

L1
1.2

ρ(0,1)=min⁡{∣0−1∣, 1}=min⁡{1,1}=1, so 1∈D.

L4
2.1

By [L2] applied to d=dR: ρ is a metric on R, the space (R,ρ) is bounded, diam⁡(R)≤1 in ρ, and ρ is uniformly equivalent to dR.

step 1.1L2
3.1

Claim 2: the diameter of R in ρ is an upper bound of D and 1∈D by step 1.2, so it is ≥1; combined with ≤1 from step 2.1 this gives diam⁡(R)=1 in the metric ρ, while by step 1.1 the space has no diameter at all in dR.

step 1.1step 1.2step 2.1L5
3.2

Claim 1: ρ is a metric uniformly equivalent to dR by step 2.1, hence topologically equivalent to it, so the metric topology of ρ is the usual topology of R.

step 2.1L3
4.1

Claims 1 and 2 hold by steps 3.2 and 3.1.

step 3.1step 3.2∎

Remarks

Depends on

Used by

Dependency tree · two levels

37 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