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.
Uniformly elliptic periodic scalar diffusion data
Definition
Fix an integer and the unit cell with Lebesgue measure . Assume Countable Choice for the conventions of The Axiom of Countable Choice (). A uniformly elliptic periodic scalar diffusion coefficient is a measurable real function such that for almost every and every , and there are constants with almost everywhere on . Coefficients are identified when they agree almost everywhere.
For , the physical scalar coefficient is and the associated matrix is . The bounded-domain branch used on this page is with homogeneous zero boundary values. Its weak equation for datum is No coefficient regularity beyond measurability and the displayed bounds is part of this definition.
For every , the map is a diffeomorphism of . By A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions, its pullback preserves Lebesgue measurability and takes null-set changes to null-set changes (apply the theorem also to the inverse map). Thus is a well-defined almost-everywhere class independent of the representative of . The same result applies to every affine translation and positive dilation used in periodic sampling below, so almost-everywhere coefficient bounds are preserved under those pullbacks.
The ellipticity bounds hold almost everywhere on all of , not just on : periodicity transfers the exceptional null set from to each lattice translate, translations preserve null sets by the same change-of-variables theorem, and the countably many translates cover up to their null boundaries.
Axiom use
Countable Choice is inherited through the real and complex and Sobolev class conventions. No Axiom of Choice or Dependent Choice is asserted here.
Depends on
Used by
- Periodic FE-HMM with simplicial macro and periodic P1 micro meshes Algorithm
- Strong L2 convergence in periodic Dirichlet homogenization Corollary
- Periodic correctors and effective tensor Definition
- Periodic scalar cell problem Definition
- Antisymmetric periodic flux potential Lemma
- Existence and uniqueness of periodic cell correctors Lemma
- No sampling resonance for period-aligned periodic micro cells Lemma
- One-dimensional nonaligned micro sampling resonance bound Lemma
- Well-posedness of the finite FE-HMM micro solves Lemma
- Boundary-cutoff corrector estimate for regular periodic data Theorem
- Periodic scalar Dirichlet homogenization on the unit cube Theorem
- Symmetry and uniform ellipticity of the effective tensor Theorem
Dependency tree · two levels
15 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)