Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge 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.

The comparison constants between 1\lVert\cdot\rVert_1, 2\lVert\cdot\rVert_2 and \lVert\cdot\rVert_\infty on R2\mathbb{R}^{2}, and vectors attaining each

Example

On R2\mathbb{R}^{2} with the norms of The pp-norms xp\lVert x\rVert_p for rational p1p \ge 1, and x\lVert x\rVert_\infty, the comparison chain of The finite and reverse triangle inequalities for a norm; and for n1n \ge 1 every norm NN on Rn\mathbb{R}^n satisfies N(x)Cx1N(x) \le C\lVert x\rVert_1 and is Lipschitz, hence continuous, for d2d_2 clause 3 reads

x    x2    x1    ι(2)x,x1    ι(2)  x2.\lVert x\rVert_\infty \;\le\; \lVert x\rVert_2 \;\le\; \lVert x\rVert_1 \;\le\; \iota(2)\,\lVert x\rVert_\infty, \qquad \lVert x\rVert_1 \;\le\; \sqrt{\iota(2)}\;\lVert x\rVert_2 .

Each of these four constants is attained, so none can be improved:

  • e0=(1,0)e_0 = (1,0) has e0=e02=e01=1\lVert e_0\rVert_\infty = \lVert e_0\rVert_2 = \lVert e_0\rVert_1 = 1, so the first and second inequalities are equalities there;
  • (1,1)(1,1) has (1,1)=1\lVert(1,1)\rVert_\infty = 1, (1,1)2=ι(2)\lVert(1,1)\rVert_2 = \sqrt{\iota(2)} and (1,1)1=ι(2)\lVert(1,1)\rVert_1 = \iota(2), so the third and fourth inequalities are equalities there.

The general theorem For n1n \ge 1 all norms on Rn\mathbb{R}^n are equivalent supplies constants but no attaining vectors; that is what this computation adds.

Unit balls. Writing Bp:={xR2:xp1}B_p := \{\, x \in \mathbb{R}^{2} : \lVert x\rVert_p \le 1 \,\} for p{1,2,}p \in \{1,2,\infty\}, the chain gives B1B2BB_1 \subseteq B_2 \subseteq B_\infty, and both inclusions are strict: (1,1)(1,1) lies in BB_\infty and not in B2B_2, and (3/ι(5))(1,1)\bigl(3/\iota(5)\bigr)(1,1) lies in B2B_2 and not in B1B_1. The scalar has to be chosen strictly between 1/ι(2)1/\iota(2) and 1/ι(2)1/\sqrt{\iota(2)}: at the endpoint 1/ι(2)1/\iota(2) the vector (1,1)/ι(2)(1,1)/\iota(2) has 1=1\lVert\cdot\rVert_1 = 1 and so still lies in B1B_1.

Facts & Assumptions

Given: The space R2\mathbb{R}^{2} with x1=x0+x1\lVert x\rVert_1 = |x_0|+|x_1|, x2=x02+x12\lVert x\rVert_2 = \sqrt{x_0^{2}+x_1^{2}} and x=max{x0,x1}\lVert x\rVert_\infty = \max\{|x_0|,|x_1|\} (The pp-norms xp\lVert x\rVert_p for rational p1p \ge 1, and x\lVert x\rVert_\infty, Laws of finite sums and finite products, Finite sums and finite products, by recursion, Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set); the vectors e0=(1,0)e_0 = (1,0), e1=(0,1)e_1 = (0,1) and u:=(1,1)u := (1,1) (The standard list e:nFne : n \to F^{n} with ei(i)=1Fe_i(i) = 1_F and ei(j)=0Fe_i(j) = 0_F for jij \ne i is an ordered basis of FnF^{n}; hence dimFFn=n\dim_F F^{n} = n, and F0F^{0} is the zero space with basis \varnothing and dimension 00).

[L1]

The comparison chain on Rn\mathbb{R}^{n} for n1n \ge 1, at n=2n = 2: xx2x1ι(2)x\lVert x\rVert_\infty \le \lVert x\rVert_2 \le \lVert x\rVert_1 \le \iota(2)\lVert x\rVert_\infty and x1ι(2)x2\lVert x\rVert_1 \le \sqrt{\iota(2)}\lVert x\rVert_2 (The finite and reverse triangle inequalities for a norm; and for n1n \ge 1 every norm NN on Rn\mathbb{R}^n satisfies N(x)Cx1N(x) \le C\lVert x\rVert_1 and is Lipschitz, hence continuous, for d2d_2 clause 3, The Cauchy-Schwarz inequality for finite sums).

[L3]

Square roots: c\sqrt{c} is the unique nonnegative ss with s2=cs^{2} = c, so 1=1\sqrt{1} = 1, and squaring is strictly monotone on the nonnegatives (Square roots exist: a unique a0\sqrt{a} \ge 0 with (a)2=a(\sqrt{a})^2 = a; the positives are {x2:x0}\{x^2 : x \neq 0\}, Squaring is monotone on the nonnegatives).

[L4]

Canonical naturals: ι(1)=1\iota(1) = 1, ι(2)=1+1>1\iota(2) = 1+1 > 1, ι(2)>0\iota(2) > 0, and ι\iota is strictly increasing (The canonical natural ι(n)=n1F\iota(n) = n \cdot 1_F of a field, Canonical naturals are positive and strictly increasing).

[L5]

Absolute value: 1=1|1| = 1, 0=0|0| = 0, t0|t| \ge 0 (Absolute value in an ordered field, Basic properties of the absolute value).

Verification

technique · direct
1.1

e01=1+0=1\lVert e_0\rVert_1 = |1|+|0| = 1, e02=12+02=1=1\lVert e_0\rVert_2 = \sqrt{1^{2}+0^{2}} = \sqrt{1} = 1, and e0=max{1,0}=1\lVert e_0\rVert_\infty = \max\{1,0\} = 1.

L3L5
1.2

u1=1+1=ι(2)\lVert u\rVert_1 = |1|+|1| = \iota(2), u2=12+12=ι(2)\lVert u\rVert_2 = \sqrt{1^{2}+1^{2}} = \sqrt{\iota(2)}, and u=max{1,1}=1\lVert u\rVert_\infty = \max\{1,1\} = 1.

L3L4L5
1.3

The inclusions B1B2BB_1 \subseteq B_2 \subseteq B_\infty follow from the chain: x11\lVert x\rVert_1 \le 1 gives x21\lVert x\rVert_2 \le 1, and that gives x1\lVert x\rVert_\infty \le 1.

L1L2
2.1

At x=e0x = e_0 the first inequality of [L1] reads 111 \le 1 and the second reads 111 \le 1: both are equalities, so neither 2\lVert\cdot\rVert_\infty \le \lVert\cdot\rVert_2 nor 21\lVert\cdot\rVert_2 \le \lVert\cdot\rVert_1 can be improved by a constant smaller than 11.

step 1.1L1
2.2

At x=ux = u the third inequality of [L1] reads ι(2)ι(2)1\iota(2) \le \iota(2)\cdot 1 and the fourth reads ι(2)ι(2)ι(2)=ι(2)\iota(2) \le \sqrt{\iota(2)}\cdot\sqrt{\iota(2)} = \iota(2): both are equalities, so the constants ι(2)\iota(2) and ι(2)\sqrt{\iota(2)} are best possible.

step 1.2L1L3
2.3

The inclusions are strict: uu has u=1\lVert u\rVert_\infty = 1 and u2=ι(2)>1\lVert u\rVert_2 = \sqrt{\iota(2)} > 1 since ι(2)>1\iota(2) > 1, so uBB2u \in B_\infty \setminus B_2; and w:=(3/ι(5))uw := \bigl(3/\iota(5)\bigr)u has w1=ι(2)3/ι(5)=ι(6)/ι(5)>1\lVert w\rVert_1 = \iota(2)\cdot 3/\iota(5) = \iota(6)/\iota(5) > 1 while w2=ι(2)3/ι(5)\lVert w\rVert_2 = \sqrt{\iota(2)}\cdot 3/\iota(5) satisfies w22=ι(2)ι(9)/ι(25)=ι(18)/ι(25)<1\lVert w\rVert_2^{2} = \iota(2)\cdot\iota(9)/\iota(25) = \iota(18)/\iota(25) < 1, so wB2B1w \in B_2\setminus B_1.

step 1.2L2L3L4
3.1

Steps 2.1 and 2.2 exhibit an attaining vector for each of the four inequalities, and steps 1.3 and 2.3 give the strict inclusions of the unit balls.

step 2.1step 2.2step 1.3step 2.3

Remarks

  • Sharpness is not the same as equivalence. For n1n \ge 1 all norms on Rn\mathbb{R}^n are equivalent asserts that constants exist and produces some; nothing in it says which are smallest. The computation above supplies attaining vectors, and those are what make the constants of the chain best possible on R2\mathbb{R}^{2}.

  • Both attaining vectors are extreme in the expected way. A vector with a single nonzero coordinate makes all three norms agree; a vector whose two coordinates have equal absolute value spreads the mass as evenly as possible and is where 1\lVert\cdot\rVert_1 is largest relative to the other two. On Rn\mathbb{R}^{n} the same two vectors give equality with ι(n)\iota(n) and ι(n)\sqrt{\iota(n)} in place of ι(2)\iota(2) and ι(2)\sqrt{\iota(2)}; only the case n=2n = 2 is verified here.

  • The strictness computation in step 2.3 is arithmetic, not geometry. The scalar 3/ι(5)3/\iota(5) was chosen to lie strictly between 1/ι(2)1/\iota(2) and 1/ι(2)1/\sqrt{\iota(2)}; any scalar in that open interval would serve, and the interval is nonempty exactly because ι(2)<ι(2)\sqrt{\iota(2)} < \iota(2).

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 176 results over 30 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