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.
One-point extension of a nonexpansive map in finite dimensions
Statement
Let with its Euclidean norm, let , and let satisfy for all . For every there exists such that Equivalently, one value can be added at the new input without violating the Lipschitz constant .
Facts & Assumptions
Given: as in the Statement.
The map is 1-Lipschitz and .
Cauchy-Schwarz with its equality case, the triangle inequality for , the parallelogram law and polarisation: for , is a norm inducing , and the parallelogram and polarization identities hold.
Semicontinuous extreme value theorem on compact Euclidean sets: for , a continuous real function on a nonempty compact subset of attains its minimum.
Every point has a unique nearest point in a nonempty closed Euclidean convex set and Metric projection onto a closed convex set satisfies the variational inequality: in for , a nonempty closed convex subset has a nearest point to any point, and that projection satisfies the variational inequality.
A metric space is compact if and only if every family of closed subsets with the finite intersection property has nonempty intersection: a family of closed subsets of a compact space with the finite-intersection property has nonempty total intersection.
Proof
If , then . If is empty choose ; if it is nonempty then , , and satisfies the inequality. Hence assume . If , any works. Otherwise consider any finite nonempty list and set By [F1], , so each and their finite maximum are continuous. Also, when , which tends to as ; thus is coercive. The nonempty sublevel is closed and bounded, hence compact by [F2]; [F3] gives a global minimizer of .
Let be the nonempty active set. Its gradients' convex hull is the image of the closed bounded simplex under the continuous affine map (with zero weights outside ). The simplex is compact by [F2]; pulling an open cover back to it shows its continuous image is compact, and [F2] then makes that image closed. If were not in the convex hull, project onto it using [F4]. The projection vector obeys for each , by the variational inequality. For sufficiently small , every active decreases strictly; the finitely many inactive terms have a strict gap below and remain below it by continuity. This contradicts minimality. Therefore there are weights , supported on , with and .
Put . Expanding squares and using gives The nonexpansive hypothesis bounds the double sum by . The variance identity also gives . Hence . Thus every finite family of the closed balls has nonempty intersection.
Choose one . The ball is compact by [F2]. The sets are closed in , and every finite intersection is nonempty by step 3.1 applied with included. [F5] therefore supplies a point in their total intersection, which satisfies every required inequality. The proof used only finite-dimensional compactness and finite convex combinations; no choice principle is invoked.
Depends on
- The Euclidean inner product $\langle x,y\rangle = \sum_{k<n} x_k y_k$ on $\mathbb{R}^n$
- 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
- Heine-Borel in $\mathbb{R}^n$: with the Euclidean metric a subset of $\mathbb{R}^n$ is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line
- Semicontinuous extreme value theorem on compact Euclidean sets
- Every point has a unique nearest point in a nonempty closed Euclidean convex set
- Metric projection onto a closed convex set satisfies the variational inequality
- A metric space is compact if and only if every family of closed subsets with the finite intersection property has nonempty intersection
Used by
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.