Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-10
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 rescaled ultradistance defines a metric

Statement

For the bounded sequence space in the rescaled-ultralimit definition, D is a finite pseudometric, D(x,y)=0 is an equivalence relation, and dω([x],[y])=D(x,y) is a metric. Changes off a large set do not change a point. Representatives bounded only on a large set give the same quotient after replacement by the basepoints elsewhere.

Facts & Assumptions

Given: Pointed metric spaces (Xn,dn,en), positive scales, and the supplied ultrafilter; x,y,zB.

[F1]

The sequence space and zero-distance relation are the provisional constructions. (Rescaled ultralimits and asymptotic cones).

[F2]

Bounded real ultralimits exist and preserve sums, order and absolute values; large-set modifications do not affect them. (Free tail ultrafilters and bounded real ultralimit calculus).

[F3]

Metrics are symmetric, separate points, and satisfy the triangle inequality. (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric).

Proof

technique · direct
1.1

Symmetry and the triangle inequality give 0=dn(xn,xn)2dn(xn,yn), so distances are nonnegative. The bound λndn(xn,yn)λndn(xn,en)+λndn(yn,en) makes every pairwise distance sequence bounded. Thus D(x,y) exists and is finite.

F1F2F3
2.1

Passing the coordinate identities and inequalities to limits gives D(x,x)=0, D(x,y)=D(y,x)0 and D(x,z)D(x,y)+D(y,z). In particular D(x,y)=D(y,z)=0 implies D(x,z)=0, establishing transitivity as well as reflexivity and symmetry of the zero relation.

step 1.1F2F3
3.1

The coordinate triangle inequalities in both orders imply λndn(xn,yn)λndn(xn,yn)λndn(xn,xn)+λndn(yn,yn). When xx and yy, the right side has limit zero. Therefore D(x,y)=D(x,y) and the quotient formula is independent of representatives.

step 2.1F2F3
4.1

On the quotient, symmetry and the triangle inequality follow from those for D. Distance zero means exactly xy, which means [x]=[y]; conversely equal classes have distance zero. If representatives agree on a large set, their distance sequence is zero there, hence has limit zero.

step 2.1step 3.1F1F2
5.1

If λndn(xn,en)R only on a large set A, replace xn by en outside A. The replacement is globally bounded by R. Two such choices agree on the intersection of their large sets, so step 4.1 identifies them. Every globally bounded sequence is already of this form, proving equality of the quotient constructions, including the constant basepoint and one-point quotient.

step 4.1F1

Depends on

Used by

Cited to discharge well-definedness by Rescaled ultralimits and asymptotic cones.

Dependency tree · two levels

20 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