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.
A norm on a real vector space, the induced metric, and the dictionary with the metric axioms
Definition
Throughout this page is the complete ordered field (Complete ordered field (least-upper-bound property)) constructed in this library, in particular a field, so that "vector space" below always means vector space over (Vector space over a field).
Let be a vector space over , with zero vector . A norm on is a function such that for all and all :
- (N1) Separation. if and only if .
- (N2) Absolute homogeneity. , the absolute value being that of Absolute value in an ordered field.
- (N3) Triangle inequality. .
A normed space is a pair consisting of a vector space over and a norm on it. When only one norm is in play we write for ; when several are, the norm is always named.
The values of a norm are real numbers. The codomain is , so is an honest element of the complete ordered field and no infinite value is permitted. This is the same convention Which metric axiom list this library uses, the live naming fork between semimetric and pseudometric, and why extended metrics are not treated here records for metrics.
Nonnegativity is a theorem, not an axiom
Many texts add a fourth condition . It is redundant. Applying (N2) with gives (Basic properties of the absolute value, In any vector space , , , , and forces or for ), and then (N3) with and gives
where is (N1). So , and if then by addition of inequalities, which trichotomy forbids (Complete ordered field (least-upper-bound property)). Hence for every .
Consequently the verification of a candidate norm has three things to check and not four, exactly as the verification of a candidate metric has three and not four (Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric, Nonnegativity of a metric is a consequence of the other axioms, not an axiom). No item in this library assumes nonnegativity of a norm before the argument above.
The induced metric
Let be a norm on and define
where (Vector space over a field). Then is a metric on (Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric), and the three axioms are the three conditions above, in order:
- (M1) means , which by (N1) says , that is ; and conversely .
- (M2) , by (N2), Basic properties of the absolute value and (In any vector space , , , , and forces or ).
- (M3) , by (N3).
A normed space is therefore a metric space, and every notion defined for metric spaces — open set (The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement), convergence, Cauchyness, continuity, compactness — is available in it with no further definition. This library never introduces a second notion of any of them for normed spaces.
Two properties an arbitrary metric need not have
The metric satisfies, for all and :
- translation invariance, ;
- absolute homogeneity, , by (N2).
Not every metric on a vector space arises from a norm, and homogeneity is what fails. The published bounded remetrisation and are metrics uniformly equivalent to , so every metric space carries a bounded metric with the same topology replaces a metric by , a metric with the same topology whose values never exceed ; on a vector space containing a vector with this cannot be for any norm , since absolute homogeneity would force , which is unbounded in , while is bounded by . So the passage from norms to metrics is not reversible, and a statement about a metric on a vector space is strictly weaker than the corresponding statement about a norm.
Remarks
-
Why (N1) is stated as an equivalence. The direction is forced by (N2) with , since (In any vector space , , , , and forces or ) gives . Only the direction " implies " is a genuine assumption, and dropping it gives what is usually called a seminorm, a notion this library does not use. The situation is exactly the one Which metric axiom list this library uses, the live naming fork between semimetric and pseudometric, and why extended metrics are not treated here describes for (M1) and the pseudometric.
-
The zero space carries exactly one norm. If then the only function satisfying (N1) is the one with value , and it satisfies (N2) and (N3) trivially. In particular , the function space on the empty index set (The vector space of all functions with pointwise operations, and as the case ), is a normed space, although the metrics of the published metric theory on are defined only for .
-
What is not defined here. This item does not define linear maps; their published definition is Linear map between vector spaces over the same field. It also does not define operator norms, dual spaces, or abstract inner product spaces. Conventions of this page, the standing hypothesis, and what is taken up elsewhere in the reading order records the remaining scope boundaries and what each later development would license.
Depends on
- Vector space over a field
- The vector space $F^{X}$ of all functions $X \to F$ with pointwise operations, and $F^{n}$ as the case $X = n = \{0, 1, \dots, n-1\}$
- Linear map between vector spaces over the same field
- Metric space: $d(x,y) = 0$ iff $x = y$, symmetry, and the triangle inequality; pseudometric and ultrametric
- Nonnegativity of a metric is a consequence of the other axioms, not an axiom
- The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement
- $\min(d,1)$ and $d/(1+d)$ are metrics uniformly equivalent to $d$, so every metric space carries a bounded metric with the same topology
- Which metric axiom list this library uses, the live naming fork between semimetric and pseudometric, and why extended metrics are not treated here
- Absolute value in an ordered field
- Basic properties of the absolute value
- The triangle inequality
- Complete ordered field (least-upper-bound property)
- In any vector space $0_F v = 0_V$, $\lambda 0_V = 0_V$, $(-\lambda)v = -(\lambda v)$, $(-1_F)v = -v$, and $\lambda v = 0_V$ forces $\lambda = 0_F$ or $v = 0_V$
Used by
- Every connected component of an open subset of ℝⁿ is open and polygonally connected Corollary
- For n ≥ 1 every bounded sequence in ℝⁿ has a convergent subsequence Corollary
- If f : [a,b] → ℝᵐ is differentiable with integrable f' then ∫ₐᵇ f' = f(b)-f(a); and a bounded derivative makes f Lipschitz Corollary
- ℝⁿ is polygonally connected, connected, locally path-connected and locally connected Corollary
- ‖·‖₁ on ℝ² violates the parallelogram law, so no symmetric bilinear form induces it Counterexample
- A curve for which the mean value inequality is an equality, showing the constant cannot be improved Counterexample
- f(t) = (t², t³) on [0,1]: no ξ satisfies f(1)-f(0) = f'(ξ) Counterexample
- g(x,y) = xy/(x²+y²), extended by g(0,0)=0, is continuous in each variable separately and not continuous at the origin Counterexample
- Equivalent norms, and the dictionary with equivalent metrics Definition
- Euclidean spheres and closed balls as subspaces of ℝⁿ Definition
- Series of vectors in ℝⁿ, absolute convergence, rearrangement, and the set of rearrangement sums Definition
- The Euclidean inner product ⟨ x,y⟩ = ∑_k<n xₖ yₖ on ℝⁿ Definition
- The p-norms ‖ x‖ₚ for rational p ≥ 1, and ‖ x‖_∞ Definition
- The subspace Γ of directions along which a series converges absolutely, and its orthogonal complement Γ^⊥ Definition
- The total (Fréchet) derivative Df(a) as the linear first-order approximation with o(‖h‖₂) remainder Definition
- Vector-valued functions f : A → ℝᵐ, their limits and continuity, with the dictionary to the metric notions Definition
- A convergent sequence in ℝ³ and the integral ∫₀¹ (1, t, t²), computed componentwise Example
- A convergent series in ℝ² with Γ a line and Γ^⊥ a line, computed from the definition Example
- Every convex subset of ℝⁿ, in particular every ball and ℝⁿ itself, is path-connected and hence connected Example
- Steinitz's confinement bound realised on an explicit list of six unit vectors in ℝ² summing to zero Example
- The comparison constants between ‖·‖₁, ‖·‖₂ and ‖·‖_∞ on ℝ², and vectors attaining each Example
- The straight segment between two points of an open Euclidean ball stays in the ball Example
- FALSE: all norms on a real vector space are equivalent False statement
- FALSE: every connected subset of ℝⁿ is polygonally connected False statement
- FALSE: if a convergent series in ℝⁿ does not converge absolutely, then every point of ℝⁿ is the sum of some rearrangement of it False statement
- FALSE: in every normed space a closed bounded set is compact False statement
- Each ‖·‖ₚ is a norm on ℝⁿ, and the induced metrics are exactly d₁, d₂ and d_∞ of the published metric-spaces page Lemma
- Every Euclidean linear map has a unique matrix and satisfies ‖Lh‖₂≤ K‖h‖₂ for some K≥0 Lemma
- For n≥2, the punctured space ℝⁿ∖{0} is polygonally connected Lemma
- The finite and reverse triangle inequalities for a norm; and for n ≥ 1 every norm N on ℝⁿ satisfies N(x) ≤ C‖ x‖₁ and is Lipschitz, hence continuous, for d₂ Lemma
- Conventions of this page, the standing n ≥ 1 hypothesis, and what is taken up elsewhere in the reading order Remark
- A vector-valued function has a limit, or is continuous, if and only if each of its components does; with the algebra of continuous vector-valued functions Theorem
- An absolutely convergent series in ℝⁿ converges, and every rearrangement converges to the same sum Theorem
- Cauchy-Schwarz |⟨ x,y⟩| ≤ ‖ x‖₂‖ y‖₂ with its equality case, the triangle inequality for ‖·‖₂, the parallelogram law and polarisation Theorem
- For a ≤ b and f : [a,b] → ℝᵐ integrable when a<b, ‖∫ₐᵇ f‖₂ ≤ ∫ₐᵇ ‖ f‖₂; for a<b, ‖ f‖₂ is integrable Theorem
- For n ≥ 1 a sequence in ℝⁿ converges iff each coordinate sequence converges, is Cauchy iff each coordinate sequence is Cauchy, and ℝⁿ is complete in every norm Theorem
- For n ≥ 1 all norms on ℝⁿ are equivalent Theorem
- Steinitz's polygonal confinement theorem: finitely many vectors of norm at most 1 summing to 0 can be ordered so that every partial sum has norm at most n Theorem
- Sums and scalar multiples of totally differentiable maps are totally differentiable with the expected derivatives Theorem
- The mean value inequality: if f : [a,b] → ℝᵐ is continuous and differentiable on (a,b) with ‖ f'‖₂ ≤ M, then ‖ f(b)-f(a)‖₂ ≤ M(b-a) Theorem
…and 1 more result.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 77 results over 14 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
- Norm (mathematics) (Wikipedia) (standard reference, not scraped)
- Normed vector space (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)