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.
flattening preserves uniform ellipticity quantitatively
Statement
Assume Countable Choice. In the setting of Weak divergence-form equations are invariant under boundary charts with compactly contained in the domain of a flattening chart of a bounded domain (Bounded C^k domains and boundary charts), suppose bounds and together with their reciprocals on the relevant closure: and for all . Then the transformed coefficients of Weak divergence-form equations are invariant under boundary charts satisfy, for a.e. in the flattened half-ball, so the transformed operator is uniformly elliptic with an explicitly computable constant depending only on , while the transformed coefficients satisfy . The first-order and zero-order coefficients satisfy and , hence also the scaffold's non-sharp bounds for and for , since . The constants are not asserted sharp. Ellipticity alone does not imply the coefficient regularity required for an estimate. If additionally on the original patch, then the transformed principal coefficients are on the compact half-patch, with bounds also depending on and the second chart/inverse derivatives.
Facts & Assumptions
Given: Countable Choice; the chart and its inverse with the two-sided bounds of the Statement; the coefficients with ellipticity constant and bounds ; and the transformed coefficients of the boundary-chart lemma.
Transformed coefficients: for a.e. , , and . (Weak divergence-form equations are invariant under boundary charts)
Chart bounds: with and one has , , , and for every . The latter follows because and have the same singular values and the Statement bounds the smallest singular value of below by . (Bounded C^k domains and boundary charts)
Uniform ellipticity of the original form: for a.e. and all . (Uniformly elliptic divergence-form operators and their sesquilinear forms)
Proof
Setup. Fix in the flattened half-ball and put , and , so that . By [F2] and .
Coefficient bounds. From [F1], the coefficient bounds and [F2], while and . Since and , this implies the non-sharp bounds and for suitable .
Quadratic form. Substituting the definition of from [F1] and interchanging the finite sums gives
Ellipticity. Taking real parts in step 2.1 and applying [F3] to gives , where the last inequality uses and step 1.1.
The transformed coefficients satisfy the stated ellipticity and size bounds. For the additional regularity clause, the first-order weak pullback formula follows by smooth approximation on compact interior subsets; change of variables and the compact ambient chart bounds bound the resulting derivative fields uniformly up to the flat boundary. Thus there. Apply the multiplier rule of The cutoff difference-quotient commutator estimate to the factors , and in [F1]. Their first derivatives use and the second chart/inverse derivatives, giving the asserted bounds. Flat-boundary H2 estimates require this additional regularity and admissible boundary data.
Source notes
Hunter (printed p. 114) performs the same substitution immediately after the coefficient formulas and notes that boundary regularity is what makes the transformed coefficients ; Teschl's Lemma 10.18 (printed p. 242) uses the same computation. The scaffold's displayed lower bound is reproduced in step 3.1; the sharper coefficient bounds in step 4.1 imply the scaffold's non-sharp versions.
Depends on
Used by
Dependency tree · two levels
37 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 graduate notes) (standard reference, not scraped)
- Gerald Teschl, Partial Differential Equations: From Classical to Modern (2025 archived author manuscript, complete 392 pages) (standard reference, not scraped)