Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)judge 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.

Equivalent norms, and the dictionary with equivalent metrics

Definition

Let VV be a vector space over R\mathbb{R} (Vector space over a field) and let MM and NN be norms on VV (A norm on a real vector space, the induced metric, and the dictionary with the metric axioms). MM and NN are equivalent when there are reals c>0c > 0 and C>0C > 0 with

cM(v)    N(v)    CM(v)for every vV.c\,M(v) \;\le\; N(v) \;\le\; C\,M(v) \qquad \text{for every } v \in V .

The constants are not part of the data and are not unique: any smaller cc and any larger CC serve as well.

This is an equivalence relation on the norms on VV

  • Reflexive: take c=C=1c = C = 1.
  • Symmetric: from cMNCMcM \le N \le CM and c,C>0c, C > 0 one gets C1NMc1NC^{-1}N \le M \le c^{-1}N, dividing by the positive constants (Inverses of positives are positive, and reciprocation reverses order).
  • Transitive: if cMNCMcM \le N \le CM and cNPCNc'N \le P \le C'N then ccMPCCMc'c\,M \le P \le C'C\,M, and cc>0c'c > 0, CC>0C'C > 0, a product of positives being positive.

The dictionary with equivalent metrics

Let dM(u,v)=M(uv)d_M(u,v) = M(u-v) and dN(u,v)=N(uv)d_N(u,v) = N(u-v) be the induced metrics (A norm on a real vector space, the induced metric, and the dictionary with the metric axioms). Substituting v:=uwv := u - w in the displayed condition gives

cdM(u,w)    dN(u,w)    CdM(u,w)for all u,wV,c\,d_M(u,w) \;\le\; d_N(u,w) \;\le\; C\,d_M(u,w) \qquad \text{for all } u, w \in V ,

which is verbatim the Lipschitz equivalence of dMd_M and dNd_N in the sense of Topologically, uniformly and Lipschitz equivalent metrics on a set, with α=c\alpha = c and β=C\beta = C. That is the strongest of the three tiers that item distinguishes: by Lipschitz equivalence implies uniform equivalence implies topological equivalence, Lipschitz equivalence implies uniform equivalence, which implies topological equivalence. So equivalent norms give

The last line deserves its two-line verification, since it is used constantly below and is not literally a clause of Lipschitz equivalence implies uniform equivalence implies topological equivalence. If dM(vk,v)0d_M(v_k, v) \to 0 then 0dN(vk,v)CdM(vk,v)0 \le d_N(v_k,v) \le C\,d_M(v_k,v), so given a rational ε>0\varepsilon > 0 an index beyond which dM(vk,v)<ε/Cd_M(v_k,v) < \varepsilon/C serves for dNd_N; the converse uses dMc1dNd_M \le c^{-1}d_N in the same way. The Cauchy statement is the same estimate applied to dN(vk,vl)d_N(v_k,v_l). In particular (V,dM)(V, d_M) is complete if and only if (V,dN)(V,d_N) is.

Naming. Many texts say strongly equivalent for what Topologically, uniformly and Lipschitz equivalent metrics on a set calls Lipschitz equivalent, and simply equivalent for what it calls topologically equivalent. As there, this library always writes the qualifier for metrics. For norms there is no fork to guard against: the condition displayed above is the only one anyone calls equivalence of norms, and it is always the Lipschitz-strength one.

Remarks

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 145 results over 24 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources