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.
Variational crimes and Strang lemmas
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Absolute Continuity and the Sharp Fundamental Theorem of Calculus
- Arc Length and Rectifiable Curves
- Areas of Elementary Plane Figures
- Banach Valued Integration and the Radon Nikodym Property
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Bounded Variation and the Riemann–Stieltjes Integral
- Céa and Aubin–Nitsche error estimates
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Coordinate and Path Transport
- Complex Lp Spaces and Test-Function Conventions
- Complex Norms and Realification
- Complex Subspace Realification
- Complexification, Realification and Real Structures
- Composite quadrature rules
- Connectedness
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Contour Integration
- Convexity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Darboux, L'Hôpital, and Taylor's Theorem
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Differentiation of Monotone Functions and the Vitali Covering Theorem
- Distributions Test Functions and Differentiation
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Dual Spaces Adjoint Operators and Annihilators
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Dimensional Normed Spaces and Riesz Lemma
- Finite-element meshes and interpolation
- Foundations of the Real Numbers for Analysis
- Fubini and Change of Variables
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Harmonic Functions and Mean Values in Rn
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Lax--Milgram and Weak Elliptic Solutions
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Norming and Separation under Hahn–Banach
- Order, Zorn's Lemma, and the Axiom of Choice
- Orthonormal Bases, Parseval and Fourier Series
- Outer Measure and the Caratheodory Extension Theorem
- Pointwise Extended-Real Function Products
- Poisson Problems and Interior Harmonic Estimates
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Schwartz Space and the Plancherel Theorem
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Smooth Approximation and Sobolev Extension
- Smooth Manifolds and Smooth Maps
- Smooth Partitions of Unity and Exhaustions
- Sobolev Poincare and Morrey Inequalities
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tangent Cotangent and the Differential
- The Analytic Hahn Banach Theorem
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Inverse and Implicit Function Theorems
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Maximal Function and Lebesgue Differentiation
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Derivatives and Sobolev Spaces
2 · Summary
The first Strang estimate treats conforming Galerkin spaces with perturbed forms and loads. Its discrete coercivity is a separate hypothesis, and its form and load defects remain explicit; the load term includes source approximation and data oscillation. The second estimate uses the common comparison space and requires a bounded extension of the discrete form there. That extension is not assumed to exist for every penalty or discontinuous Galerkin method.
For curved-domain lifts, the transformed diffusion tensor records the Jacobian and inverse-map factors. Cellwise tensor discrepancies give a form-defect bound. Stability follows only after a separate quantitative smallness condition and on a Hilbert trial space whose norm is the gradient norm; a lift alone gives no geometry rate. The one-dimensional midpoint P1 result combines a direct quadrature defect with interpolation and obtains coercivity from the positive sampled coefficient. The shape-regular affine P1 result assumes bounded reference nodal functionals and keeps the interpolation contribution separate from geometry, quadrature and load defects. Quadrature exactness by itself is not used as a mesh-uniform stability argument.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Variational-crime settings and consistency defects
Definition
Let . In the exact variational problem, is a Hilbert space, is a bounded coercive sesquilinear form (bilinear when ), linear in its first argument and conjugate-linear in its second when , and is bounded and has the same linearity in its test argument as the second argument of . Exact solutions satisfy for every . Boundedness and coercivity have the meanings in Bounded, coercive and symmetric sesquilinear forms.
For a conforming perturbed Galerkin problem, is a finite-dimensional subspace, and are the discrete form and load, and solves . Its discrete coercivity constant is any such that for every . For , define
If , both defects are defined to be zero. The load defect includes any source approximation or data oscillation; it is not assumed small or zero without a separate bound.
For a nonconforming problem, the exact space and finite-dimensional trial space need not satisfy . Put and equip it with a norm whose restrictions to and are norms. The discrete form is defined on , and a bounded extension means on and . For an exact solution , define the nonconforming consistency defect
with value zero if . This residual need not vanish: the exact weak equation is only asserted for tests in .
Geometry and quadrature defects are components of the appropriate form defect when the implemented form is compared with the pulled-back exact form. No exact Galerkin orthogonality is asserted after replacing the form or test space.
A bounded form defect preserves discrete coercivity
Statement
Let be a Hilbert space and let be a subspace. Suppose the exact form is coercive with constant in the norm . Let be a discrete form on and suppose
for some . Then is coercive with constant at least whenever . In particular, if , then its coercivity constant is at least .
Facts & Assumptions
Given: A Hilbert space , a subspace , a coercive form with constant , a discrete form , and the diagonal defect bound with constant .
Bounded, coercive and symmetric sesquilinear forms: coercivity means ; symmetry is not required.
For every , .
Proof
Fix . By coercivity [F1] and the defect hypothesis [A1], .
If , then , so the inequality in step 1.1 is precisely coercivity with that constant. If , then .
First Strang estimate for conforming perturbed Galerkin problems
Statement
Assume Countable Choice. Let be a real or complex Hilbert space, a bounded coercive form with boundedness constant and coercivity constant , and a bounded functional linear in the real case and conjugate-linear in the complex test argument. Let be finite-dimensional, and let and be bounded, with having the same test-linearity as , and coercive with constant in the inherited norm. Both and are sesquilinear (bilinear over ), linear in their first argument and conjugate-linear in their second over . There are unique exact and discrete solutions and , and
where the defects are those of Variational-crime settings and consistency defects. For a family of meshes this is a uniform estimate whenever and the displayed approximation and defect terms are uniformly controlled. The term retains source approximation and data oscillation.
Facts & Assumptions
Given: Countable Choice; with the Hilbert, boundedness, coercivity, and finite-dimensional hypotheses of the Statement.
Bounded, coercive and symmetric sesquilinear forms: and ; the real bilinear case does not require symmetry.
The Lax--Milgram theorem under The Axiom of Countable Choice (): a bounded coercive form on a Hilbert space with a bounded functional has a unique solution to its variational equation.
A finite-dimensional normed subspace is closed: a finite-dimensional subspace of a normed space is closed; therefore with the inherited inner product is a Hilbert space.
Variational-crime settings and consistency defects: and are the indicated suprema of the form and load defects against nonzero tests in .
is sesquilinear (bilinear over ), with the stated first- and second-argument conventions; it is bounded and on ; is bounded.
Proof
The hypotheses on are exactly those of [F2], so [F2] gives a unique satisfying for every .
By [F3], is closed in , hence complete in its inherited Hilbert norm. The restriction of is bounded and coercive by [A1], and is bounded; applying [F2] on gives a unique with for every .
Fix any and put . Discrete coercivity and the discrete equation give .
Since , the exact equation gives , and . The boundedness of [F1] and the defect definitions [F4] therefore imply .
If the comparison is immediate; otherwise divide step 3.1 by and use . This proves the displayed bound for each , and taking the infimum proves the theorem.
Second Strang estimate with a bounded extension to the comparison space
Statement
Assume Countable Choice. Let be a real or complex Hilbert space, a bounded coercive sesquilinear form (bilinear over ), and a bounded functional with the test-linearity required by . Let be a finite-dimensional Hilbert space with norm , not necessarily a subspace of . Suppose the algebraic sum is equipped with a norm extending these norms, and is a bounded sesquilinear extension of a discrete form with bound . Over , both forms are linear in the first argument and conjugate-linear in the second; over , they are bilinear. Assume is coercive on with constant , and let be bounded on with the matching test-linearity. The exact and discrete equations have unique solutions and , and
where when , and when . The estimate requires the bounded extension and does not assert that every nonconforming, penalty, or discontinuous Galerkin form has one.
For a family of these problems, suppose and uniformly. Writing , the uniform bound is Thus uniform control of and gives a uniform error budget; if both tend to zero, the errors tend to zero, and if both are for a fixed , the error is . No rate is inferred without those approximation, residual, and stability bounds.
Facts & Assumptions
Given: Countable Choice; the exact Hilbert problem on ; the nonconforming space and common comparison norm on ; a bounded extension ; discrete coercivity ; and a bounded discrete load.
The Lax--Milgram theorem under The Axiom of Countable Choice (): the exact bounded coercive Hilbert problem has a unique solution.
By hypothesis, is sesquilinear with the stated slot conventions (bilinear over ). By definition, agrees with on and on (Variational-crime settings and consistency defects).
for every .
is the consistency residual at the exact solution, as defined in Variational-crime settings and consistency defects.
Proof
Apply [F1] on to obtain the unique exact solution .
The finite-dimensional Hilbert problem on has bounded coercive form and bounded load , so the same Lax–Milgram theorem [F1] gives a unique .
Fix and set . Then , and [A1] gives .
By the discrete equation and extension identity, . The extension bound [F2] and residual definition [A2] therefore give .
If there is nothing to divide by; otherwise divide step 3.1 by . The triangle inequality gives . Taking the infimum over proves the per-mesh bound. For the stated family, replace by and by . The resulting constants are independent of , yielding the stated uniform, convergence and rate consequences when the two explicit error terms have the corresponding control.
Geometry lift and transformed elliptic tensor
Definition
Assume Countable Choice. Let be open, and let be a diffeomorphism. Write . Let be Lebesgue measurable, real symmetric almost everywhere, and satisfy almost everywhere, for constants . The physical exact form on real-valued functions with square-integrable gradients is . The pulled-back exact tensor and form are
The lifted form is defined for real-valued with measurable gradients and finite pulled-back energies and . The pointwise Cauchy–Schwarz inequality for the positive tensor bounds the absolute cross density by the product of the square roots of these energy densities, which is integrable by Holder's inequality for integrals, including the endpoint cases. Square-integrability of alone does not guarantee these energy conditions for an arbitrary diffeomorphism.
The geometry tensor discrepancy of an implemented tensor on a cell is , where is the Euclidean operator norm. The geometry-lifted form defect is the difference between and the form using , on pairs for which both displayed cross densities are absolutely integrable. No meshwise approximation rate is part of this definition.
Cellwise geometry tensor gaps bound form error and stability loss
Statement
Assume the geometry setting of Geometry lift and transformed elliptic tensor, and suppose has a nonempty finite measurable partition into bounded cells , with and . For real-valued with , put and , and assume their gradients are square-integrable on each cell. Then the physical exact form pulled back by is . Suppose the implemented tensors are real symmetric and measurable, with . The form satisfies
where . If for , the form defect is at most . Moreover, if , , and , then with . For the stability conclusion, let be a real Hilbert space of pullback functions with inner product , so its norm is . Restrict the exact and implemented forms to . If , the implemented form is coercive on with constant at least . The rate assumption is separate from the lift; neither it nor completeness of the gradient-norm space follows from a lift alone.
Facts & Assumptions
Given: Countable Choice; the geometry definition; a nonempty finite measurable cell partition; physical functions and their pullbacks as stated; a real symmetric measurable tensor with ; a diffeomorphism with positive Jacobian; measurable symmetric implemented tensors with finite cell discrepancies; and, for the coercivity conclusion, the real Hilbert space with the gradient inner product specified in the Statement.
The chain rule for total derivatives: : differentiating gives , so .
A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions: under Countable Choice, a diffeomorphism changes variables by the positive factor for every nonnegative measurable integrand.
Holder's inequality for integrals, including the endpoint cases and Cauchy-Schwarz with its equality case, the triangle inequality for , the parallelogram law and polarisation: integral Cauchy–Schwarz applies on each cell, and the finite sum of cell products is bounded by the product of the two Euclidean norms of the cellwise L2 norms.
A bounded form defect preserves discrete coercivity: a diagonal perturbation bounded by lowers a coercivity constant by at most .
Bounded, coercive and symmetric sesquilinear forms: coercivity in a real Hilbert space means for every vector.
Nonnegative Lebesgue integration over measurable sets is a measure (The indefinite integral of a nonnegative measurable function is a measure), and the integral is linear on (The Lebesgue integral is linear on ). Finite products and sums of measurable real functions are measurable (Arithmetic and lattice operations preserve measurability whenever they are defined).
Countable Choice is the explicit assumption of the change-of-variables supplier [F3] (The Axiom of Countable Choice ()).
, , and .
On each cell , for the stated optional rate conclusion.
Proof
Set and . By [F2], and likewise for . Under the Countable Choice hypothesis [A3], apply [F3] to the nonnegative measurable energy density to obtain ; the same applies to and . The physical energies are finite since and all three physical gradients are in . Their nonnegative pulled-back energy densities therefore have finite integrals. The pointwise polarization identity expresses the pulled-back cross density as half the difference of these three integrable nonnegative densities, hence makes that cross density absolutely integrable. The physical cross density is integrable by the same argument. Since and are symmetric, the real polarization identity yields .
For every vector , [A1] and imply . Thus . The change-of-variables supplier [F3] carries the null exceptional set in the a.e. coefficient bounds to a null set under , so these estimates hold almost everywhere after pullback. These same bounds also make the lifted forms finite on every vector with an gradient: all singular values of are at most and their product is , so almost everywhere; also . Hence , and the finite cellwise discrepancies make essentially bounded as well.
The finite measurable partition and the assumed finite cellwise squared-gradient integrals give global square integrability: apply the measure property [F7] to and to obtain and the analogous identity for . The tensor and gradient entries are measurable, so the defect density is measurable by [F7]. On each cell almost everywhere; [F4] makes this an integrable majorant, and the finite sum makes globally . Step 1.1 has established that the exact lifted cross density is . Thus the implemented cross density, the exact cross density minus , is also . Their finite indicator decompositions over the partition and linearity [F7] justify subtracting and summing cell integrals. The operator-norm estimate and integral Cauchy–Schwarz [F4] then give . Summing over cells and using together with finite Cauchy–Schwarz [F4] proves both displayed form-defect bounds; under [A2], .
The diagonal estimate in step 2.1 has constant . On , the exact lifted form is coercive with constant by step 1.2 and [F6]. Apply [F5] with to obtain coercivity of the implemented form with constant at least .
Perturbed conforming solves are controlled by the exact Galerkin baseline
Statement
Assume Countable Choice and the exact conforming Galerkin hypotheses of Hermitian Galerkin solutions are best in the energy norm, with Hermitian form bounded by in . Let be the exact Galerkin solution. Let be a bounded discrete form on the same , coercive in with constant , and let be a bounded discrete load with the matching test-linearity. Its unique perturbed solution satisfies
where , defined as zero if . This uses the exact Galerkin solution as a baseline; must be bounded from the actual form and load defects.
Facts & Assumptions
Given: The Countable-Choice bounded coercive Hermitian Galerkin setting, its exact Galerkin solution , and a bounded coercive perturbed form/load with the stated residual , including its zero-space convention.
The Lax--Milgram theorem under The Axiom of Countable Choice (): the perturbed bounded coercive form on the finite-dimensional Hilbert space has a unique solution .
Bounded, coercive and symmetric sesquilinear forms: boundedness gives and discrete coercivity gives .
is the residual supremum in the Statement, with the stated value zero when .
Proof
The perturbed form and load are bounded and coercive on , so [F2] gives a unique satisfying for all .
Put . Use the discrete equation with test and the residual definition [A1] to obtain .
If the claim is immediate; otherwise divide step 2.1 by and use [F3] to get .
The triangle inequality and [F1] now give , as required.
One-dimensional P1 interpolation has a first-derivative error bound
Statement
Assume Countable Choice. Let be a finite interval partition, , and . Let be the continuous piecewise-linear function with nodal values . Then
If , then also vanishes at both endpoints.
Facts & Assumptions
Given: Countable Choice, a finite interval partition, its maximum cell length, and .
The second fundamental theorem: if is differentiable on with and is integrable, then : if a differentiable function has an integrable derivative, its increment is the integral of that derivative.
If on and both are integrable then ; and : for an integrable function bounded in absolute value by , the integral over an interval of length has absolute value at most .
Under Countable Choice, for every nonnegative measurable the map is a measure, hence finitely additive on disjoint measurable cells (The indefinite integral of a nonnegative measurable function is a measure). Nonnegative Lebesgue integrals preserve bounds (Monotonicity and nonnegative homogeneity of the nonnegative integral); a constant bound integrates as that constant times the interval length by the simple-integral formula and the box-measure theorem (The nonnegative integral agrees with the simple integral on simple functions, A box in with parameters is Lebesgue measurable of measure , whichever of its faces are included), whose interval-measure statement assumes Countable Choice (The Axiom of Countable Choice ()).
Extreme value theorem: a continuous real function on a nonempty compact subset of attains a greatest and a least value: a continuous function on the compact interval has a finite maximum and minimum.
Proof
Fix a cell of length . Its interpolant slope is by [F1].
For every , . A second use of [F1] and then [F2] gives , hence .
The continuous function has a finite maximum by [F4]. On each open cell , is continuous and hence measurable; define at the finitely many nodes. This gives a nonnegative measurable representative of the squared derivative error, bounded by the finite cell bounds in step 2.1. The Lebesgue interval-measure and monotonicity facts in [F3] give . The open cells are disjoint and their complement consists of finitely many nodes of Lebesgue measure zero. Finite additivity of the measure from [F3], with zero contribution from the nodes where , therefore identifies the global Lebesgue squared norm with the sum of these cell integrals. Using and gives . Taking nonnegative square roots proves the estimate; endpoint values follow from the nodal definition.
Zero-boundary Poincaré inequality on the unit interval
Statement
Assume Countable Choice. For every real ,
Consequently .
Facts & Assumptions
Given: Countable Choice and in the closure of in the norm.
Zero-boundary Sobolev space as a norm closure: for every , some satisfies .
The second fundamental theorem: if is differentiable on with and is integrable, then : a smooth function's increment is the integral of its derivative.
On , Countable Choice gives (A box in with parameters is Lebesgue measurable of measure , whichever of its faces are included, The Axiom of Countable Choice ()). Hence Holder gives and (Holder's inequality for integrals, including the endpoint cases).
The nonnegative Lebesgue integral is monotone (Monotonicity and nonnegative homogeneity of the nonnegative integral).
Continuous functions on closed intervals are bounded and Riemann integrable (A continuous function on is Riemann integrable, by Heine-Cantor and Riemann's criterion). Under Countable Choice their Riemann and Lebesgue integrals agree (A bounded Riemann integrable function on a closed bounded interval is Lebesgue measurable and has the same integral).
Proof
Extend smoothly by zero to . Its derivative is continuous on every with , so [F6] makes it Riemann integrable and identifies its Riemann integral with its Lebesgue integral. Thus [F2] gives ; at both sides are zero. Hence by [F3]. Monotonicity [F5] and give , so .
Given , choose by [F1]. The triangle inequality and step 1.1 give . Since this holds for every positive , . By [F4], squaring and adding the derivative norm proves the estimate.
Midpoint quadrature defect for one-dimensional P1 stiffness
Statement
Assume Countable Choice. Let be a finite partition with cells , cell lengths , and maximum . Let , and let be continuous piecewise-linear functions. Write for their constant cell slopes and take their a.e. derivatives as representatives. Define the exact and midpoint stiffness forms by
where is the cell midpoint and the cell derivatives are constant. Then
Moreover, , and likewise for .
The midpoint rule is exact for this stiffness integrand when is affine; for a general coefficient the displayed defect is retained. The bound is exact-arithmetic quadrature error, separate from roundoff.
Facts & Assumptions
Given: Countable Choice, the finite partition, , and continuous piecewise-linear .
Composite midpoint rule on a uniform grid: on one cell , the midpoint value times is the one-panel midpoint quadrature rule.
Composite midpoint error bound for a twice continuously differentiable function: for , the one-panel error is at most .
For : is integrable on if and only if it is integrable on and on , and then ; with the oriented form for arbitrary : the integral over is the sum of cell integrals.
Triangle inequality for finite sums: the absolute value of the sum of cell errors is bounded by their absolute values' sum.
Cauchy-Schwarz with its equality case, the triangle inequality for , the parallelogram law and polarisation: the sum of products of two finite real lists is bounded by the product of their Euclidean norms.
Extreme value theorem: a continuous real function on a nonempty compact subset of attains a greatest and a least value: the continuous function attains a finite maximum on . Because every relative interval has positive Lebesgue measure by [F8], this maximum is its essential supremum (The essential supremum of a measurable function with respect to a measure, The space of essentially bounded measurable functions).
The norm is the square root of the integral of the square (The function space for , The space as the quotient by null functions). A finite-valued measurable function has simple integral (Nonnegative simple measurable functions, The integral of a nonnegative simple function), and its nonnegative Lebesgue integral agrees with that value (The nonnegative integral agrees with the simple integral on simple functions).
Under Countable Choice, every interval in has Lebesgue measure equal to its length; in particular each open cell has measure and each mesh node is null (A box in with parameters is Lebesgue measurable of measure , whichever of its faces are included, The Axiom of Countable Choice ()).
Under Countable Choice, a bounded Riemann-integrable function on has the same Riemann and Lebesgue integrals (A bounded Riemann integrable function on a closed bounded interval is Lebesgue measurable and has the same integral, The Axiom of Countable Choice ()).
A continuous function on a closed interval is Riemann integrable, and changing its values at finitely many points preserves its integral (A continuous function on is Riemann integrable, by Heine-Cantor and Riemann's criterion, Changing an integrable function at finitely many points changes neither its integrability nor its integral).
Proof
For each cell, define and on , and set both representatives to at the finitely many mesh nodes. Their squares are nonnegative simple functions. By [F7] and [F8], , and the same identity holds for and for the cell-restricted norms.
On a cell , and are constants, so is ; the discrete sample is the one-panel midpoint rule [F1]. Also . Applying [F2] with bounds the cell error by .
By step 1.1, the cell error in step 1.2 is at most .
The global integrand is bounded. On each cell its representative differs at most at the endpoints from the continuous function , so [F10] makes each cell restriction Riemann integrable with the same cell integral as . Repeated application of [F3] then makes the global integrand Riemann integrable and expresses its integral as the sum of the cell integrals. By [F9], its Lebesgue integral on equals this Riemann integral; the endpoints are null by [F8], so this is also . Thus is the sum of the cell errors. The finite-sum triangle inequality [F4] and step 2.1 bound its absolute value by times . Cauchy–Schwarz [F5] and the norm decompositions in step 1.1 give the displayed global estimate.
A midpoint-quadrature P1 solve has an explicit Strang error budget
Statement
Assume Countable Choice. Put with its norm, and let be a finite-dimensional conforming piecewise-linear space on an interval partition with maximum cell width . Let and assume its nodal interpolant belongs to . Let satisfy , and write . Define and let use one midpoint quadrature sample per cell. Let and be bounded real linear exact and discrete loads, with for every , and put , with if . Then the exact and discrete solutions satisfy
The explicit is the data/source oscillation term; no rate or vanishing of it is asserted without an additional load approximation hypothesis. Here coercivity follows directly because every sampled coefficient satisfies ; this special argument does not infer stability from quadrature exactness.
Facts & Assumptions
Given: Countable Choice; ; a conforming finite-dimensional P1 space ; with ; with ; and bounded loads .
The Sobolev space is a Hilbert space and Zero-boundary Sobolev space as a norm closure: under Countable Choice, is a Hilbert space for its inner product.
Midpoint quadrature defect for one-dimensional P1 stiffness: , with and the analogous identity for every .
First Strang estimate for conforming perturbed Galerkin problems: error is bounded by best approximation plus the form and load defects divided by discrete coercivity.
Holder's inequality for the exact form and finite Cauchy–Schwarz for the cell sum (Holder's inequality for integrals, including the endpoint cases, Cauchy-Schwarz with its equality case, the triangle inequality for , the parallelogram law and polarisation).
The exact and discrete equations are and , and is as in the Statement.
Proof
By [F2], . Holder [F6] gives , while . Thus is bounded and coercive in the inherited norm.
The norm identity in [F4] and finite Cauchy–Schwarz [F6] give, for , , so is bounded. Also on each cell, so . By [F2], , hence and .
By [F3] and [F2], . Also the triangle inequality gives .
Apply [F5] with comparison function . Its best-approximation term is bounded by step 1.3; [F4] bounds its form defect by because . The load defect is exactly by [A1].
Substitute from step 1.1 and from step 1.2 into the first-Strang bound in step 2.1. This gives the displayed estimate and retains the full load defect.
Shape-regular affine finite elements supply the Strang approximation term
Statement
Assume Countable Choice and let . Let be a matching shape-regular affine simplicial mesh as in Matching affine simplicial meshes and shape regularity. Set , so for an empty mesh. Let be a conforming zero-boundary P1 Lagrange subspace of a Hilbert space , with , and let be the global nodal interpolant of whose boundary nodal values vanish. Assume for . The reference nodal functionals are bounded on , and the exact/discrete variational problems satisfy the hypotheses of First Strang estimate for conforming perturbed Galerkin problems, with exact solution and discrete coercivity . Then a constant depending only on the reference P1 element and shape-regularity bound satisfies
If uniformly, the displayed approximation contribution is ; the geometry, quadrature, and load defects remain separate terms and require their own estimates.
Facts & Assumptions
Given: Countable Choice; or ; a matching shape-regular affine simplicial mesh with ; a conforming P1 Lagrange family in ; with zero boundary nodal values; a global interpolant ; and the bounded/coercive exact and discrete forms and loads of the first Strang theorem.
Matching affine simplicial meshes and shape regularity: cells are nondegenerate affine simplices, their interiors are disjoint, and intersections are whole matching faces; shape regularity bounds diameter divided by inradius.
Reference finite elements and unisolvent degrees of freedom: an unisolvent reference element defines its interpolation operator from its degrees of freedom.
Broken and conforming polynomial spaces on a matching mesh: conformity means matching polynomial traces on each interior facet, and the zero-boundary subspace has zero polynomial trace on every boundary facet.
Local interpolation estimates on shape-regular affine meshes: for the P1 Lagrange element, , , , and , uniformly on the shape-regular affine mesh.
First Strang estimate for conforming perturbed Galerkin problems: the conforming error is bounded by its best-approximation term and the actual discrete form/load defects.
Under Countable Choice, a bounded piece of an affine hyperplane is contained in the graph of an affine function over a closed nondegenerate rectangle. Such a graph has Jordan content zero (The graph of a continuous function on a closed nondegenerate rectangle in has content zero in ) and is Lebesgue measurable of measure zero (Lebesgue outer measure is at most Jordan outer content, and a bounded Jordan measurable set is Lebesgue measurable with Lebesgue measure equal to its Jordan content, Assuming countable choice, is a sigma-algebra containing every elementary set and is a complete measure extending elementary volume); its subsets are measurable null sets by completeness. Finite unions of facets are null by finite subadditivity (Finite and countable subadditivity of measures).
For every nonnegative measurable , is a measure and its integral over a null set is zero (The indefinite integral of a nonnegative measurable function is a measure, A nonnegative integral over a null set vanishes).
The global nodal interpolant has matching traces and zero boundary nodal values, and it belongs to as stipulated in the Statement.
The reference P1 nodal functionals are bounded on , as assumed in the Statement; no point-evaluation theorem or stronger choice principle is used to infer this hypothesis here.
Proof
By [A2], the reference nodal degrees of freedom are bounded on ; together with unisolvence [F2], this gives the local Lagrange interpolants required by [F4]. Unisolvence also identifies each restriction with the local interpolant . Apply [F4] with , , , and on every cell .
On a shared facet, both neighboring P1 traces are affine and have the same values at every facet vertex, so the traces agree. Every boundary facet has zero values at all its vertices, so its affine trace is zero. Thus the assembled function has the conformity and boundary traces in [F3]; its membership in is the explicit hypothesis [A1].
Let be the union of the mesh facets. Each facet lies in an affine hyperplane; choosing a coordinate with nonzero normal coefficient writes that hyperplane as the graph of an affine function over the other coordinates. A closed nondegenerate rectangle containing the facet's projection gives a bounded graph containing the facet, so [F6] makes each facet, and hence , a Lebesgue null set. By [F7], for every nonnegative measurable the integral over is the sum of its integrals over the disjoint cell interiors , since and . Applying this to the squared first derivatives of and the squared second derivatives of gives the global seminorm decompositions used next.
Square the cell estimate in [F4] and sum over the cells using step 1.3. Their interiors are disjoint and , so , hence .
Apply [F5] with and use from the stated norm bound and step 2.1. This gives the displayed error estimate without absorbing the form, geometry, quadrature, or load defects.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Jean-Luc Guermond, MATH 661 Fall 2025, Part VI, Chapter 27, Error analysis with variational crimes
- Joachim Schöberl, Numerical Methods for Partial Differential Equations, Chapter 25, Non-conforming Finite Element Methods
- Jean-Luc Guermond, MATH 661 Fall 2023, Part III, Chapter 11, Local interpolation on affine meshes
- Joachim Schöberl, Numerical Methods for Partial Differential Equations, Chapter 24, Finite element error analysis
- Richard S. Laugesen, Linear Analysis and Partial Differential Equations, Chapter 3, Sobolev spaces
- John K. Hunter, Notes on Partial Differential Equations, Chapter 4, Elliptic PDEs
- Art B. Owen, Monte Carlo Theory, Methods and Examples, Chapter 7, Theorem 7.1
- Tobin A. Driscoll and Richard J. Braun, Fundamentals of Numerical Computation, §5.6 Numerical Integration
- Jean-Luc Guermond, MATH 661 Fall 2025, Chapter 11, Local interpolation on affine meshes
- Joachim Schöberl, Numerical Methods for Partial Differential Equations, Chapter 4