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.
Dirichlet elasticity energy bound and Galerkin estimate
Statement
Assume Countable Choice and the data of Linear isotropic elasticity: displacement form and data. For every finite there is a unique such that for every . It satisfies
For every finite-dimensional conforming subspace , the Galerkin solution is unique and
Facts & Assumptions
Given: Countable Choice, , the model data, a finite , and .
Countable Choice is used for Hilbert completeness and the continuous Lax–Milgram and Céa applications. (The Axiom of Countable Choice ())
has the gradient norm, and the local homogeneous-Dirichlet Poincaré inequality makes that norm equivalent to the usual norm. (Linear isotropic elasticity: displacement form and data, A bounded-domain Poincare inequality for H1-zero fields)
Under Countable Choice, is Hilbert; is its closed subspace defined as the -closure of . (The Sobolev space is a Hilbert space, Zero-boundary Sobolev space as a norm closure, Integer-order Sobolev spaces and their norms)
For every , . (The homogeneous Dirichlet strain identity)
Cauchy–Schwarz bounds the pairing and the induced integral bilinear forms. (Cauchy-Schwarz inequality for )
A bounded coercive real bilinear form on a Hilbert space has a unique variational solution. (The Lax--Milgram theorem)
For a bounded coercive conforming Galerkin problem, . (Céa quasi-optimality for coercive conforming Galerkin problems)
Proof
Since and , [F4] gives . The form is real, symmetric, and bounded.
By [F3] and , ; the volumetric term is nonnegative.
By [F1]–[F2], is complete in . Applying [F5] to the bounded functional and the form of steps 1.1–1.2 yields a unique .
Testing with gives and, by step 1.2, . If , divide by ; if , the claimed bound is immediate. Substitution into the energy identity gives the second estimate.
The form bounds in step 1.1 and the coercivity constant in step 1.2 satisfy the hypotheses of [F6] on every finite-dimensional conforming . Thus its Galerkin solution is unique and the stated estimate is exactly , .
Depends on
- Linear isotropic elasticity: displacement form and data
- The homogeneous Dirichlet strain identity
- A bounded-domain Poincare inequality for H1-zero fields
- The Sobolev space $H^1$ is a Hilbert space
- Zero-boundary Sobolev space as a norm closure
- Integer-order Sobolev spaces and their norms
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Cauchy-Schwarz inequality for $L^2$
- The Lax--Milgram theorem
- Céa quasi-optimality for coercive conforming Galerkin problems
Used by
- A fixed-mesh P1 volumetric-locking obstruction Example
- Finite-Lamé isogeometric elasticity is conforming and quasi-optimal Theorem
- Uniform mini-element stability through the incompressible limit Theorem
Cited to discharge well-definedness by Linear isotropic elasticity: displacement form and data.
Dependency tree · two levels
49 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
- Long Chen, Introduction to Linear Elasticity and Its Finite Element Approximation (complete 13-page notes) (standard reference, not scraped)
- Daniele Boffi, Franco Brezzi, Michel Fortin, Mixed Finite Element Methods and Applications (complete 691-page text) (standard reference, not scraped)