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 Euclidean norm and its square are convex, with a ball of subgradients at zero for the norm
Example
Let . The Euclidean norm is convex and its subdifferential at zero is the closed unit ball. The squared norm is strictly convex and satisfies
Facts & Assumptions
Given: The Euclidean norm The -norms for rational , and , convexity Convex and strictly convex functions on Euclidean convex sets, and uniqueness of the subgradient of a differentiable convex function The subdifferential of a differentiable convex function is its gradient singleton.
The Euclidean norm is a norm on and therefore satisfies the triangle inequality and homogeneity (Cauchy-Schwarz with its equality case, the triangle inequality for , the parallelogram law and polarisation).
A function on an open convex set is convex if and only if its Hessian is positive semidefinite everywhere (A function is convex exactly when its Hessian is positive semidefinite).
A function on an open convex set whose Hessian is positive definite everywhere is strictly convex (An everywhere-positive-definite Hessian implies strict convexity).
The Euclidean inner product satisfies (Cauchy-Schwarz with its equality case, the triangle inequality for , the parallelogram law and polarisation).
The derivative of is for every integer (For a natural the function is differentiable everywhere with derivative ; for it is the constant , with derivative ; for a natural the function is differentiable at every with derivative ; consequently every polynomial function is differentiable at every real, with the derivative computed term by term).
Sums and scalar multiples of differentiable real functions are differentiable with the expected derivatives (Sums, scalar multiples, products and quotients: , , , and when ).
Sums and scalar multiples of totally differentiable Euclidean maps are totally differentiable with the expected derivatives (Sums and scalar multiples of totally differentiable maps are totally differentiable with the expected derivatives).
Verification
Homogeneity and the triangle inequality in [L1] give so the norm is convex.
If , [L4] gives , so is a subgradient of the norm at zero. Conversely, a subgradient satisfies for all ; taking gives , hence .
Since , coordinatewise differentiation with [L5]–[L7] gives gradient and constant Hessian , so is and its Hessian is positive definite. Thus [L2] gives convexity, [L3] gives strict convexity, and differentiable subgradient uniqueness gives .
Depends on
- Convex and strictly convex functions on Euclidean convex sets
- A $C^2$ function is convex exactly when its Hessian is positive semidefinite
- An everywhere-positive-definite Hessian implies strict convexity
- The subdifferential of a differentiable convex function is its gradient singleton
- The $p$-norms $\lVert x\rVert_p$ for rational $p \ge 1$, and $\lVert x\rVert_\infty$
- Cauchy-Schwarz $\lvert\langle x,y\rangle\rvert \le \lVert x\rVert_2\lVert y\rVert_2$ with its equality case, the triangle inequality for $\lVert\cdot\rVert_2$, the parallelogram law and polarisation
- For a natural $n \ge 1$ the function $x \mapsto x^{n}$ is differentiable everywhere with derivative $\iota(n)\,x^{\,n-1}$; for $n = 0$ it is the constant $1$, with derivative $0$; for a natural $n \ge 1$ the function $x \mapsto x^{-n}$ is differentiable at every $x \ne 0$ with derivative $-\iota(n)\,x^{-n-1}$; consequently every polynomial function is differentiable at every real, with the derivative computed term by term
- Sums, scalar multiples, products and quotients: $(f+g)'(c) = f'(c) + g'(c)$, $(\alpha f)'(c) = \alpha f'(c)$, $(fg)'(c) = f'(c)g(c) + f(c)g'(c)$, and $(f/g)'(c) = \bigl(f'(c)g(c) - f(c)g'(c)\bigr)/g(c)^{2}$ when $g(c) \ne 0$
- Sums and scalar multiples of totally differentiable maps are totally differentiable with the expected derivatives
Used by
- FALSE: every convex function is differentiable False statement
Dependency tree · two levels
54 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
- S. Boyd and L. Vandenberghe, Convex Optimization, §§3.1–3.2 (standard reference, not scraped)
- D. Bertsekas, MIT 6.253 Convex Analysis and Optimization, Lecture 12 (standard reference, not scraped)