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.
Bounded Sobolev sequences have strongly convergent subsequences with the weak limit as limit
Statement
Assume the Axiom of Choice. Let , let be a bounded extension domain, let , , and let be bounded in with weakly in . Then in for every ; the convergence is of the whole sequence, not merely of a subsequence.
Facts & Assumptions
Given: the Axiom of Choice, a bounded extension domain , , a bounded sequence with weakly in , and .
Rellich--Kondrachov. Every bounded sequence in has a subsequence converging in . (The Rellich--Kondrachov theorem for on bounded extension domains, Sobolev extension domains and extension operators)
Weak convergence tested against . For with , the functional is bounded on , so . In particular for every measurable of finite measure. For complex-valued classes, these integral identities are read componentwise. (Weak convergence of nets and sequences, Holder's inequality for integrals, including the endpoint cases, The space as the quotient by null functions)
Strong convergence tested against . If in and , then by H"older's inequality. (Holder's inequality for integrals, including the endpoint cases)
Proof
Proof technique: every subsequence has a further -convergent subsequence; identify its limit with the weak limit by testing against finite-measure set indicators; conclude that the whole sequence converges.
Let be any subsequence. It is bounded in , so by [F1] it has a further subsequence converging in to some .
For every measurable of finite measure, [F2] applied to gives , while [F3] applied to gives ; hence . For each , apply this to the sets where the real or imaginary part of is greater than or less than , intersected with . Each such set has measure zero, since the corresponding signed part of the integral has magnitude at least its measure divided by . As is bounded, these sets cover the nonzero real and imaginary parts, so almost everywhere on .
Thus every subsequence of has a further subsequence converging in to the same limit ; in a metric space this forces the whole sequence to converge to , because otherwise some would admit a subsequence staying -away from , and that subsequence would in turn have a further subsequence converging to . The Axiom of Choice is inherited through [F1], and the weak topology is Hausdorff as recorded in Weak topology is hausdorff.
Remarks
The identification of the strong limit with the weak limit does not use the density of test functions in for : the finite-measure indicator test functions lie in and separate almost-everywhere classes.
Depends on
- The Rellich--Kondrachov theorem for $1\le p<n$ on bounded extension domains
- Weak convergence of nets and sequences
- Weak topology is hausdorff
- C_c(X) is dense in L^p(mu) for a Radon measure
- Holder's inequality for integrals, including the endpoint cases
- Sobolev extension domains and extension operators
- The space $L^p(\mu)$ as the quotient by null functions
- A nonnegative measurable function has integral $0$ exactly when it vanishes almost everywhere
- Measure-null sets and almost-everywhere statements relative to a measure
- 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
- The Axiom of Choice
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
57 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
- Juha Kinnunen, Sobolev Spaces (Aalto University, 2026, complete graduate lecture notes) (standard reference, not scraped)
- Gerald Teschl, Partial Differential Equations: From Classical to Modern (archived 2025 author manuscript) (standard reference, not scraped)
- Richard S. Laugesen, Linear Analysis and Partial Differential Equations (University of Illinois, complete graduate notes) (standard reference, not scraped)