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 tightness hypothesis of the Fr'echet--Kolmogorov criterion cannot be dropped
Statement refuted
Refuted claim. The tightness condition (ii) of the Fr'echet--Kolmogorov criterion is redundant: an -bounded family that is uniformly translation continuous would already be relatively compact.
The witness is the family of translates of one compactly supported bump, which satisfies boundedness and uniform translation continuity but escapes to infinity and therefore has no convergent subsequence.
Facts & Assumptions
Given: Countable and Dependent Choice; a nonzero compactly supported , , as in Rellich compactness fails on by translations; and , .
Boundedness and translation invariance. and for all , by translation invariance of Lebesgue measure. (Translation of a function on , The space as the quotient by null functions)
Continuity of translation. as . ( in as , for )
Failure of relative compactness. The sequence has no -convergent subsequence. (Rellich compactness fails on by translations)
The criterion and total boundedness. Under Countable and Dependent Choice, a bounded family with vanishing tails and uniform translation control is totally bounded with compact closure; total boundedness is exactly the finite-net condition. (The Fr'echet--Kolmogorov compactness criterion in , Finite -net and totally bounded metric space)
Counterexample
By [F1] and [F2], is bounded, , and as : the family is uniformly translation continuous.
Fix and choose a radius with and then an integer ; then up to a null set the support of lies outside , so , and this value is independent of ; hence no makes the tails uniformly small, and the tightness condition of [F4] fails.
By [F3] the family is not relatively compact, so — although it is bounded and uniformly translation continuous — it violates the conclusion of the criterion [F4]; the two remaining hypotheses do not force compactness, and the refuted claim is false. Countable and Dependent Choice are used only through the criterion [F4] and its negated instance; the Sobolev and translation suppliers also use Countable Choice.
Depends on
- Rellich compactness fails on $\mathbb R^n$ by translations
- The Fr\'echet--Kolmogorov compactness criterion in $L^p(\mathbb R^n)$
- $\|\tau_h f - f\|_p \to 0$ in $L^p(\mathbb{R}^n)$ as $h \to 0$, for $1 \le p < \infty$
- Translation of a function on $\mathbb{R}^n$
- The space $L^p(\mu)$ as the quotient by null functions
- Finite $\varepsilon$-net and totally bounded metric space
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- The axiom of dependent choice: a relation in which every element is related to something admits an $\mathbb{N}$-indexed chain
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
45 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
- John K. Hunter, Notes on Partial Differential Equations (UC Davis, revised 18 June 2014, complete 242-page two-quarter notes) (standard reference, not scraped)
- Gerald Teschl, Partial Differential Equations: From Classical to Modern (archived 2025 author manuscript) (standard reference, not scraped)