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.
Weak convergence plus compactness gives strong convergence
Statement
Assume the Axiom of Choice. Let , let be a bounded extension domain and let be bounded in with weakly in . Then in .
Facts & Assumptions
Given: the Axiom of Choice, a bounded extension domain , , and a bounded sequence with weakly in .
First-order Rellich compactness. Since , every bounded sequence in has a subsequence converging in on this bounded extension domain. (Compactness of on bounded extension domains, The notation and the reserved zero-boundary symbol)
Finite-measure indicators test both limits. For each measurable , the functional is bounded on and on by H"older's inequality. Weak convergence and strong convergence therefore give the same limit for these integrals. Since is bounded, ; if its integral over every measurable set is zero, then its real and imaginary parts vanish almost everywhere. (Weak convergence of nets and sequences, Holder's inequality for integrals, including the endpoint cases, The space as the quotient by null functions)
Proof
Let be any subsequence. It is bounded in , so by [F1] it has a further subsequence converging in to some .
For each measurable , [F2] gives by weak convergence and by strong convergence. Thus for every such . Applying this to the sets where the real or imaginary part of is greater than or less than , for , shows that each part vanishes almost everywhere; hence in .
Every subsequence of therefore has a further subsequence converging in to . If the whole sequence did not converge to , some would admit a subsequence staying at distance at least from , contradicting the further-subsequence conclusion. Thus in . The Axiom of Choice is inherited through [F1].
Depends on
- Compactness of $W^{1,p}(\Omega)\hookrightarrow L^p(\Omega)$ on bounded extension domains
- The notation $H^k$ and the reserved zero-boundary symbol
- Weak convergence of nets and sequences
- Holder's inequality for integrals, including the endpoint cases
- The space $L^p(\mu)$ as the quotient by null functions
- 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
Dependency tree · two levels
39 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
- Richard S. Laugesen, Linear Analysis and Partial Differential Equations (University of Illinois, complete graduate notes) (standard reference, not scraped)