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 locally constant step map on the disconnected open set has zero total derivative but is not globally Lipschitz
Statement refuted
A uniform total-derivative bound on every open domain implies a global Lipschitz bound on that domain.
Facts & Assumptions
Given: and defined by for and for .
In the total-derivative definition, the normalized remainder tends to zero as tends to zero (The total (Fréchet) derivative as the linear first-order approximation with remainder).
A map is Lipschitz with constant when for every pair of points in its domain (Lipschitz map, -Hölder map for rational , and contraction).
Counterexample
Each has a small interval contained in its own component of , on which is constant; hence by [L1].
For any , take . The points satisfy , so [L2] fails for that .
The segment from to contains , so is not convex; this is exactly the omitted hypothesis of the mean-value inequality.
Depends on
- The total (Fréchet) derivative $Df(a)$ as the linear first-order approximation with $o(\|h\|_2)$ remainder
- On a convex open set, a uniform bound $\|Df(z)v\|_2\le M\|v\|_2$ implies $\|f(y)-f(x)\|_2\le M\|y-x\|_2$
- Vector-valued functions $f : A \to \mathbb{R}^m$, their limits and continuity, with the dictionary to the metric notions
- Lipschitz map, $\alpha$-Hölder map for rational $0 < \alpha \le 1$, and contraction
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: 125 results over 23 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
- J. Lebl, Basic Analysis I, §8.4 (standard reference, not scraped)