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.
Strong L2 convergence in periodic Dirichlet homogenization
Statement
Under the hypotheses and notation of Periodic scalar Dirichlet homogenization on the unit cube, strongly in .
Facts & Assumptions
Given: The periodic weak solutions satisfy the oscillatory equation, every weak cluster limit is , and the cube embedding is compact.
Periodic scalar Dirichlet homogenization on the unit cube: in and hence weakly in .
Separable H1-zero space and compact L2 inclusion on a cube: every bounded sequence has a strongly -convergent subsequence.
Uniformly elliptic periodic scalar diffusion data and Separable H1-zero space and compact L2 inclusion on a cube: testing the oscillatory equation with and using a.e. and gives (with the zero-gradient case immediate).
The Axiom of Countable Choice (): subsequence selections use Countable Choice.
Proof
Suppose strong convergence failed. Then some and sequence satisfy for every . Testing the oscillatory weak equation with and using [F3] gives a uniform bound: if , divide by that norm, and if it is zero the bound is immediate. By [F2] and [A1], a subsequence converges strongly in to some . Its weak limit is also by [F1], so uniqueness of weak limits in the Hilbert space gives . This contradicts the lower bound .
The contradiction proves as .
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
32 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
- Grégoire Allaire, Introduction to Homogenization Theory, Lecture 1 (standard reference, not scraped)
- Zhongwei Shen, Lectures on Periodic Homogenization of Elliptic Systems (standard reference, not scraped)