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 Fr'echet--Kolmogorov compactness criterion in
Statement
Assume the Axiom of Countable Choice and the Axiom of Dependent Choice. Let and let . In each of the three displayed nonnegative suprema, take the value if . Assume satisfies: (i) ; (ii) for every there is with ; and (iii) for every there is with whenever . Then is totally bounded in , the closure of is compact, and every sequence in has a subsequence converging in .
Facts & Assumptions
Given: the Axioms of Countable and Dependent Choice, , and a family satisfying conditions (i)--(iii) of the statement; write . For and put , and for each let be the radial mollifier at scale of A radial mollifier family in Rn.
Mollification. For , the function is smooth and . (Convolution with a mollifier is smooth, and derivatives pass under the integral sign)
H"older's inequality. For conjugate exponents , ; in particular and pointwise. (Holder's inequality for integrals, including the endpoint cases)
Minkowski's integral inequality. For measurable on a product of sigma-finite measure spaces with , . (Minkowski's integral inequality)
Translations are -isometries. for every and every , since Lebesgue measure is translation invariant. (Translation of a function on , Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation, The space as the quotient by null functions)
Finite nets for equicontinuous families. An equicontinuous pointwise bounded family in , a compact metric space, is totally bounded for the supremum metric; the same holds after applying the statement to real and imaginary parts of a complex-valued family, and Arzelà--Ascoli for real under Countable Choice and Dependent Choice: compact closure iff equicontinuous and pointwise bounded records the equivalent compact-closure form. (An equicontinuous pointwise-bounded family in has a finite net in the supremum metric, Arzelà--Ascoli for real under Countable Choice and Dependent Choice: compact closure iff equicontinuous and pointwise bounded)
Total boundedness and its closure. A metric space is totally bounded when it has a finite -net for every ; total boundedness passes to subsets and to closures, and for supported in a compact ball one has . (Finite -net and totally bounded metric space, A totally bounded metric space is bounded, every subspace of a totally bounded space is totally bounded, and the closure of a totally bounded subset is totally bounded, Open ball, closed ball and sphere in a metric space)
Completeness and compactness of . is complete; a closed subspace of a complete metric space is complete, and a complete and totally bounded metric space is compact under Countable Choice; compactness and sequential compactness of a metric space are equivalent under Countable and Dependent Choice. (Riesz-Fischer completeness of for , Closed subspaces of complete metric spaces are complete; the converse under countable choice, A complete, totally bounded metric space is compact, proved from countable choice used exactly once, For a metric space, compact, countably compact, limit point compact, sequentially compact, and complete together with totally bounded are all equivalent, given countable choice and dependent choice, The Axiom of Countable Choice (), The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain)
Proof
If it is totally bounded and its closure is empty. Otherwise fix . By (ii) choose with for every , and by (iii) choose with for every and every ; let be the radial mollifier at scale , so , and .
For every and every , by step 1.1 and [F4]. Since , [F3] gives , and therefore .
By [F1] and [F2], every satisfies and , and vanishes off the ball of radius because vanishes off the ball of radius ; hence the family is uniformly bounded and uniformly Lipschitz, and all its elements are supported in the compact ball .
The real parts are equicontinuous and pointwise bounded on the compact metric space , and likewise the imaginary parts; by [F5] both families are totally bounded in the supremum metric, and combining the finitely many real and imaginary sup-balls, is totally bounded in the supremum metric over . Since every is supported in , the supremum over equals the supremum over , so for every the family has a finite covering by -balls of radius by [F6].
Let and apply steps 1.1--3.1 with , covering by finitely many -balls of radius . Step 2.1 then covers by the same centres with radius . Discard empty intersections with and choose one point of in each remaining ball. Their radius- balls cover by the triangle inequality, so the centres belong to as required by [F6]. Thus is totally bounded.
By [F6] the closure is totally bounded, and it is closed in the complete space , hence complete by [F7]; a complete and totally bounded metric space is compact by [F7], and compactness is equivalent to sequential compactness by [F7], so every sequence in has a subsequence converging in . The empty case was disposed of in step 1.1, and no other choice principle is used: Countable Choice covers the completeness-to-compactness step and the finite-net selection, Dependent Choice covers the compactness-sequential equivalence.
Depends on
- A radial mollifier family in Rn
- Convolution with a mollifier is smooth, and derivatives pass under the integral sign
- Young's convolution inequality under Countable Choice
- Minkowski's integral inequality
- Holder's inequality for integrals, including the endpoint cases
- Translation of a function on $\mathbb{R}^n$
- An equicontinuous pointwise-bounded family in $C(K,\mathbb R)$ has a finite net in the supremum metric
- Arzelà--Ascoli for real $C(K)$ under Countable Choice and Dependent Choice: compact closure iff equicontinuous and pointwise bounded
- Finite $\varepsilon$-net and totally bounded metric space
- A totally bounded metric space is bounded, every subspace of a totally bounded space is totally bounded, and the closure of a totally bounded subset is totally bounded
- Closed subspaces of complete metric spaces are complete; the converse under countable choice
- A complete, totally bounded metric space is compact, proved from countable choice used exactly once
- Riesz-Fischer completeness of $L^p$ for $1 \le p \le \infty$
- For a metric space, compact, countably compact, limit point compact, sequentially compact, and complete together with totally bounded are all equivalent, given countable choice and dependent choice
- Open ball, closed ball and sphere in a metric space
- The space $L^p(\mu)$ as the quotient by null functions
- Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation
- 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
- The tightness hypothesis of the Fr'echet--Kolmogorov criterion cannot be dropped Counterexample
- Vanishing-viscosity families are locally precompact in L¹ Lemma
- Rellich compactness is strictly subcritical Remark
- Compactness of W^1,p(Ω)↪ Lᵖ(Ω) on bounded extension domains Theorem
- Compactness of W^1,p₀(Ω)↪ Lᵖ(Ω) on bounded open sets Theorem
- Subcritical compactness for compactly supported Slobodeckij functions Theorem
Dependency tree · two levels
107 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)
- Juha Kinnunen, Sobolev Spaces (Aalto University, 2026, complete graduate lecture notes) (standard reference, not scraped)