Alphabeta Math
CounterexampleConstruction: Literature-sourcedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01
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.

Topologically equivalent metrics on a vector space need not come from equivalent norms

Statement refuted

If two metrics on a vector space are topologically equivalent and one is induced by a norm, then the other is induced by an equivalent norm.

Facts & Assumptions

Given: A nonzero normed space (V,) and the norm metric d(x,y):=xy.

[L2]

A norm metric satisfies dM(λx,λy)=λdM(x,y) for every scalar λ (A norm on a real vector space, the induced metric, and the dictionary with the metric axioms).

Counterexample

technique · direct
1.1

By [L1], the metric d(x,y):=min{d(x,y),1} has the same topology as the original norm metric d.

L1
2.1

Suppose d were induced by some norm M on V. Choose a nonzero vector v; then M(v)>0, so [L2] gives d(tv,0)=M(tv)=tM(v) for every scalar t.

step 1.1L2assume-contra
3.1

The right-hand side of step 2.1 is unbounded as t, but by definition d(tv,0)1 for every t. This contradiction shows that d is not induced by any norm at all.

step 2.1discharge-contradiction
4.1

Hence d is topologically equivalent to a norm metric while failing even to come from a norm, so it certainly does not come from a norm equivalent to the original one. This refutes the statement.

step 1.1step 3.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

34 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