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.
A uniformly coercive elliptic variational state is C1 in its parameter
Statement
Assume Countable Choice and the setting of Parameter-dependent coercive elliptic variational states and objectives. On an open neighborhood , suppose the same constants and give boundedness and coercivity for every , and and are operator-norm . Then each state exists uniquely, the map is , and for each direction its derivative is the unique solution of Uniform coercivity is required on the parameter neighborhood; no differentiability conclusion is asserted at a loss of coercivity.
Facts & Assumptions
Given: Countable Choice, a real Hilbert space, the uniformly bounded/coercive family, operator-norm data, and the variational state definition in Parameter-dependent coercive elliptic variational states and objectives.
Lax–Milgram gives a unique variational solution and for each bounded linear datum (The Lax--Milgram theorem, The Axiom of Countable Choice ()).
Operator-norm data means the increments of and equal their first derivatives plus remainders whose norms are (Parameter-dependent coercive elliptic variational states and objectives).
The constants are uniform on the open parameter neighborhood , with .
Proof
For each , apply [F1] to and ; this gives a unique and the bound . Since is continuous, these state norms are locally bounded in .
For sufficiently small with , put , , and . Subtract the two variational equations to get . Taking , using coercivity and the dual norm, and dividing by when it is nonzero gives . The same bound is immediate when . Thus the state map is locally Lipschitz.
For each direction , define by . The right side is a bounded linear functional, so [F1] gives a unique . Uniqueness and linearity of the right side in show is linear.
Write and , where by [F2]. Subtract the equation for in step 2.2 from the state-difference equation in step 2.1. With , this gives . The first two terms have dual norm ; the last two have that order because , , and by step 2.1. Coercivity yields , proving Fréchet differentiability and the stated derivative equation.
The solution operator has norm at most . For nearby , the identity shows its operator-norm continuity. The formula in step 2.2, together with continuity of , , and , then shows is continuous. Hence the state map is .
Depends on
Used by
Dependency tree · two levels
19 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
- Hannes Meinlschmidt, Optimization with Partial Differential Equations, complete lecture notes, §§1.4 and 1.6 (standard reference, not scraped)
- Michael B. Giles and Niles A. Pierce, An Introduction to the Adjoint Approach to Design, §2.4 (standard reference, not scraped)