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 , and on , and vectors attaining each
Example
On with the norms of The -norms for rational , and , the comparison chain of The finite and reverse triangle inequalities for a norm; and for every norm on satisfies and is Lipschitz, hence continuous, for clause 3 reads
Each of these four constants is attained, so none can be improved:
- has , so the first and second inequalities are equalities there;
- has , and , so the third and fourth inequalities are equalities there.
The general theorem For all norms on are equivalent supplies constants but no attaining vectors; that is what this computation adds.
Unit balls. Writing for , the chain gives , and both inclusions are strict: lies in and not in , and lies in and not in . The scalar has to be chosen strictly between and : at the endpoint the vector has and so still lies in .
Facts & Assumptions
Given: The space with , and (The -norms for rational , and , 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 , and (The standard list with and for is an ordered basis of ; hence , and is the zero space with basis and dimension ).
The comparison chain on for , at : and (The finite and reverse triangle inequalities for a norm; and for every norm on satisfies and is Lipschitz, hence continuous, for clause 3, The Cauchy-Schwarz inequality for finite sums).
Each of the three is a norm and induces the correspondingly named published metric (Each is a norm on , and the induced metrics are exactly , and of the published metric-spaces page, A norm on a real vector space, the induced metric, and the dictionary with the metric axioms, Equivalent norms, and the dictionary with equivalent metrics, Open ball, closed ball and sphere in a metric space).
Square roots: is the unique nonnegative with , so , and squaring is strictly monotone on the nonnegatives (Square roots exist: a unique with ; the positives are , Squaring is monotone on the nonnegatives).
Canonical naturals: , , , and is strictly increasing (The canonical natural of a field, Canonical naturals are positive and strictly increasing).
Absolute value: , , (Absolute value in an ordered field, Basic properties of the absolute value).
Verification
, , and .
, , and .
The inclusions follow from the chain: gives , and that gives .
At the first inequality of [L1] reads and the second reads : both are equalities, so neither nor can be improved by a constant smaller than .
At the third inequality of [L1] reads and the fourth reads : both are equalities, so the constants and are best possible.
The inclusions are strict: has and since , so ; and has while satisfies , so .
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.
Remarks
-
Sharpness is not the same as equivalence. For all norms on 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 .
-
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 is largest relative to the other two. On the same two vectors give equality with and in place of and ; only the case is verified here.
-
The strictness computation in step 2.3 is arithmetic, not geometry. The scalar was chosen to lie strictly between and ; any scalar in that open interval would serve, and the interval is nonempty exactly because .
Depends on
- The $p$-norms $\lVert x\rVert_p$ for rational $p \ge 1$, and $\lVert x\rVert_\infty$
- Each $\lVert\cdot\rVert_p$ is a norm on $\mathbb{R}^n$, and the induced metrics are exactly $d_1$, $d_2$ and $d_\infty$ of the published metric-spaces page
- The finite and reverse triangle inequalities for a norm; and for $n \ge 1$ every norm $N$ on $\mathbb{R}^n$ satisfies $N(x) \le C\lVert x\rVert_1$ and is Lipschitz, hence continuous, for $d_2$
- For $n \ge 1$ all norms on $\mathbb{R}^n$ are equivalent
- Equivalent norms, and the dictionary with equivalent metrics
- A norm on a real vector space, the induced metric, and the dictionary with the metric axioms
- The Cauchy-Schwarz inequality for finite sums
- Square roots exist: a unique $\sqrt{a} \ge 0$ with $(\sqrt{a})^2 = a$; the positives are $\{x^2 : x \neq 0\}$
- Squaring is monotone on the nonnegatives
- The standard list $e : n \to F^{n}$ with $e_i(i) = 1_F$ and $e_i(j) = 0_F$ for $j \ne i$ is an ordered basis of $F^{n}$; hence $\dim_F F^{n} = n$, and $F^{0}$ is the zero space with basis $\varnothing$ and dimension $0$
- The canonical natural $\iota(n) = n \cdot 1_F$ of a field
- Canonical naturals are positive and strictly increasing
- Open ball, closed ball and sphere in a metric space
- 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
- Absolute value in an ordered field
- Basic properties of the absolute value
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
- Lp space (Wikipedia) (standard reference, not scraped)
- Norm (mathematics) (Wikipedia) (standard reference, not scraped)
- J. Demmel, MA221 Lecture 3: Vector Norms (standard reference, not scraped)
- G. Zitelli, Math 641 Functional Analysis, Part I (standard reference, not scraped)