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.
Finite-element meshes and interpolation
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
- 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
- Complexification, Realification and Real Structures
- 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
- 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, 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
- 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
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- 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
- Order, Zorn's Lemma, and the Axiom of Choice
- 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 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
A finite face-to-face affine simplicial mesh is the setting for the interpolation and differential identities on this page. The construction fixes an orientation-preserving reference map and the diameter-to-inradius shape-regularity convention; curved cells are outside this scope. Oriented simplex chains, matching-facet cancellation, affine-simplex Gauss–Green, Sobolev extension, face traces, and Poincare–Wirtinger are established locally where the bounded C1-domain suppliers do not apply.
For conforming piecewise polynomials, equal interior traces give the weak cellwise gradient, while zero boundary facet values yield membership in the W0 closure and its Poincare estimate. Reference finite elements are stated conditionally on unisolvent, bounded degrees of freedom. Bramble–Hilbert and affine scaling give local interpolation, inverse, and discrete-trace estimates. Point-evaluation boundedness is proved for when , and for . The two-dimensional counterexample proves unboundedness at that critical case; no other threshold cases are characterized.
The covariant and contravariant Piola maps are defined with det A>0. Their weak gradient, divergence and curl identities and normal/tangential moment transformations are proved on affine simplices. Transfer of a commuting interpolation diagram is conditional on the corresponding reference diagram, so arbitrary unisolvent elements are not asserted to commute.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Matching affine simplicial meshes and shape regularity
Definition
Fix an integer . The underlying coordinate index set of is . In this definition the conventional labels are relabeled by : write , and let be the function on with and for . The vertex and barycentric labels are distinct from these underlying coordinate indices. The reference open simplex is with closure .
A matching affine simplicial mesh of a bounded polyhedral open set is a finite set of closed, nondegenerate -simplices such that their union is , their interiors are pairwise disjoint, is the interior of their union, and the intersection of two distinct cells is either empty or a whole face of each. Thus no lower-dimensional crack is omitted from while its surrounding cells are retained. Every interior facet is incident to exactly two cells and every boundary facet to one. The faces of a cell are the convex hulls of its vertex subsets. A facet means a face of dimension .
For each cell , an affine bijection with invertible is a reference map. Choose the vertex order so ; this is the orientation convention used for Piola formulas. Write and let be the radius of the largest Euclidean ball contained in . A family is shape regular if there is a finite such that for every and . This universal condition is vacuous for an empty family. This definition uses radius; references using the diameter of the inscribed ball differ by a factor of two.
An affine image of the reference square is a parallelogram. A general quadrilateral requires a nonaffine map and is outside this affine definition; curved-cell approximation is not included here.
Oriented simplicial cell chains and boundary
Definition
Let be a matching simplicial mesh as in Matching affine simplicial meshes and shape regularity. Set . For , let be the free abelian group generated by ordered -faces , with the orientation relation for every permutation . Define to be the zero map. For , define the simplicial boundary homomorphism on a generator by This is the oriented incidence convention; no geometric integration is part of the definition. The identity is proved directly from this alternating formula in the following lemma.
The simplicial boundary of a boundary is zero
Statement
For every , the boundary maps of Oriented simplicial cell chains and boundary satisfy
Facts & Assumptions
Given: An oriented simplicial mesh and its alternating boundary maps.
An oriented generator has boundary , extended linearly. (Oriented simplicial cell chains and boundary)
Proof
If , then by the definition, so the double boundary vanishes. Now let and fix an oriented generator . In , a codimension-two face is obtained by deleting a unique pair of vertices with indices . Deleting first contributes coefficient because the original index shifts down by one; deleting first contributes .
The sum of those two coefficients is . Every codimension-two face arises from exactly these two deletion orders, so every basis coefficient in the double boundary is zero. The double boundary therefore vanishes on each generator and, by linearity, on all of .
Broken and conforming polynomial spaces on a matching mesh
Definition
Let be a matching affine simplicial mesh of as defined in Matching affine simplicial meshes and shape regularity. Fix , , and an integer . On each cell let denote the restrictions to of -valued polynomials of total degree at most . The broken polynomial space is the finite product viewed as functions defined almost everywhere cell by cell. For an interior facet , the jump is the difference of the two polynomial traces, with either fixed ordering of ; its vanishing is independent of that ordering. The conforming polynomial space is The zero-boundary subspace consists of those whose polynomial trace is zero on every boundary facet. These are algebraic definitions. The Sobolev inclusions and the zero-boundary closure conclusion are proved separately in the corresponding local theorems on matching piecewise polynomials and zero-boundary values. If , then by the mesh definition; the empty product is the zero vector space consisting of the unique empty function, and the trace conditions are vacuous.
Reference finite elements and unisolvent degrees of freedom
Definition
Let , let be a nonempty bounded open reference cell, let be an integer, and let . A reference finite element is a triple where is an -dimensional subspace of for and is a list of linear functionals on for which is bijective. The functionals are the degrees of freedom and the triple is unisolvent. Its shape functions are the unique dual basis satisfying .
If is a normed vector space of functions on containing , fix for each a bounded linear extension of to , and denote this chosen extension by the same symbol. The reference interpolation operator associated with these chosen extensions is The definition of a reference finite element does not assert that any particular list of functionals is unisolvent or bounded on a given Sobolev space; those are separate proof obligations. For , , , the empty list gives the unique bijection between these zero spaces, and the shape-function list is empty. The corresponding interpolation formula is the empty sum, hence the zero map into .
Unisolvent degrees of freedom define a unique reference interpolant
Statement
Let be a reference finite element with , dual shape functions , and bounded extensions of its degrees of freedom to a normed function space containing . Then the operator is the unique linear map satisfying for every , and for every .
Facts & Assumptions
Given: The reference finite-element convention of Reference finite elements and unisolvent degrees of freedom and an input on which every degree of freedom is defined.
The degree-of-freedom map is bijective, and the shape functions satisfy . (Reference finite elements and unisolvent degrees of freedom)
Proof
If , then and the empty sum defines the unique linear map ; all degree-of-freedom identities are vacuous and reproduction holds for the sole element . For , define . The sum is finite and each coefficient is linear in , so is a well-defined linear map into . Applying the th degree of freedom gives by [F1].
If , then both and have the same degree-of-freedom vector, by step 1.1; injectivity of therefore gives . If another has the same degree-of-freedom values, then , and injectivity again gives . This proves uniqueness.
Polynomial derivative and face norms are controlled on a reference simplex
Statement
Assume Countable Choice. Let , be the reference simplex, let be a finite dimensional -space of polynomial functions on it, let be any facet, and let integer . For there is a finite constant such that For every pair of integers , there is also a finite constant such that For finitely many facets, one constant works for all of them. In particular, every linear degree-of-freedom functional on is bounded with respect to the norm.
Facts & Assumptions
Given: Countable Choice; the reference simplex has nonempty interior and finite positive volume; has a finite ordered basis; Sobolev norms use the finite-derivative convention of Integer-order Sobolev spaces and their norms, and degrees of freedom use Reference finite elements and unisolvent degrees of freedom.
If a finite-dimensional real vector space has positive dimension, choose an ordered basis and pull both norms back to . The theorem on makes those pullbacks equivalent, and transporting the inequalities gives equivalence on ; the zero-dimensional case is immediate. (For all norms on are equivalent, Equivalent norms, and the dictionary with equivalent metrics)
On every finite-dimensional complex normed space, any two complex norms are equivalent. (All norms on a finite-dimensional complex normed space are equivalent, Equivalent complex norms)
A degree of freedom is a linear functional on the finite-dimensional polynomial space. (Reference finite elements and unisolvent degrees of freedom)
The Sobolev-space norm convention assumes Countable Choice. (The Axiom of Countable Choice ())
The canonical open simplex and its facets are defined by Matching affine simplicial meshes and shape regularity; in particular the cell has nonempty interior and positive finite volume, and each facet is a bounded nondegenerate simplex of positive finite surface measure.
Proof
The cell expression is a norm on . If it is zero, then for finite the continuous polynomial vanishes almost everywhere, and for it vanishes essentially everywhere. In either case, if it were nonzero at an interior point, continuity would make it bounded away from zero on an interior ball of positive measure, a contradiction. It therefore vanishes on the open simplex and hence is the zero polynomial, since its finite Taylor expansion at any interior point is exact.
If , all displayed estimates and functional bounds hold immediately, so assume . The expression is a norm: it is nonnegative, homogeneous and subadditive, and forces the cell norm to vanish, so the preceding argument gives . For real coefficients apply [F1], and for complex coefficients apply [F2], to and ; norm equivalence gives . Taking the maximum over the finitely many facets proves their uniform estimate. By [F3], any degree-of-freedom functional is linear on ; it is bounded for by finite-dimensional norm equivalence and hence by .
If , the second estimate is immediate. If , the second estimate is the derivative part of step 2.1 with its order there set to . If , let be the polynomials of degree at most . The seminorm vanishes exactly on : every monomial of degree at least has a nonzero derivative of order , and every derivative of order kills lower-degree monomials. It is therefore a norm on the finite- dimensional quotient . If this quotient is zero, then the target seminorm vanishes on all of because , so the estimate is immediate. Otherwise add the target seminorm to the quotient norm; it is well-defined because it also vanishes on . The sum is another norm. Applying [F1] or [F2] to these two norms bounds the target seminorm by the order- seminorm. This proves the second estimate.
Affine pullback of weak derivatives and Sobolev seminorms
Statement
Assume Countable Choice. Let be an affine bijection from a bounded open set to , where is invertible, and let . For every integer and scalar , the pullback belongs to . For its first weak derivatives satisfy and higher derivatives are obtained by applying this constant-matrix rule repeatedly. In particular, for each , where for . The reverse estimate holds with and in place of and .
Facts & Assumptions
Given: Countable Choice; the affine bijection ; an exponent ; and .
A weak derivative is characterized by for all compactly supported smooth tests. (Weak derivative of a locally integrable function, Integer-order Sobolev spaces and their norms)
For a C1 diffeomorphism, nonnegative Lebesgue-measurable integrands obey the change-of-variables formula with ; Countable Choice is an explicit hypothesis. (A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions)
is constant, so the classical chain rule for a test function is . (The chain rule for differentials of smooth maps)
For finite , by [F2]; for the essential-supremum norm is preserved by a C1 bijection and its inverse, which map null sets to null sets. (A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions)
The cited change-of-variables theorem assumes Countable Choice. (The Axiom of Countable Choice ())
Proof
If , then and each Sobolev space on these measure-zero domains has only the zero class; every displayed derivative identity and estimate is therefore zero equals zero. Otherwise, if , the only derivative is order zero and [F4] gives , with the stated convention at . Thus the membership and pullback estimate hold in this case. For , fix and . Set . By [F1], and its weak first derivatives have locally integrable representatives, so and are integrable: the test factors are bounded and compactly supported. For an integrable real product on , apply [F2] separately to its nonnegative parts and ; both integrals are finite, and the constant makes the corresponding pullback integrals finite. Subtracting their two formulas gives . For a complex product, apply this argument to its real and imaginary parts and combine their integrals componentwise; the weak test pairing remains bilinear, without conjugation. Changing variables by [F2] and using [F3] gives Thus the displayed first-derivative formula holds weakly; its right side is in by [F4].
For , since is constant, differentiating the first formula weakly again applies the same rule to each ; induction on gives every derivative of order as a sum of at most terms, each with a product of entries of multiplying a pullback of an order- derivative of . Taking component norms and using [F4] yields the stated seminorm bound, with a finite combinatorial constant depending on . Applying the proved estimate to gives the reverse bound. Together with step 1.1 this includes and proves both directions.
Shape regularity controls affine simplex geometry
Statement
Assume Countable Choice. Let map the fixed reference simplex bijectively to a cell of a shape-regular family, and let be its diameter and its inradius. There are constants , depending only on , the reference simplex, and the shape regularity bound, such that For each facet , its affine surface Jacobian is comparable to , and its altitude from the opposite vertex is comparable to . Thus Sobolev scaling constants can be expressed using alone, with constants uniform over the family.
Facts & Assumptions
Given: A nondegenerate affine simplex map, a fixed reference simplex, and the shape regularity bound .
The reference simplex is fixed, with diameter and inradius ; is the diameter and the inradius of . (Matching affine simplicial meshes and shape regularity)
The oriented area element of an affine facet is , so its surface Jacobian is when . Affine Sobolev seminorms transform with the corresponding powers of and . (Gauss–Green formula on an affine simplex, Affine pullback of weak derivatives and Sobolev seminorms)
The two affine change-of-variables suppliers used in [F2] assume Countable Choice. (The Axiom of Countable Choice ())
Proof
Use a singular-value decomposition . If is a unit right singular vector for , the reference inscribed ball contains two points separated by ; their images are separated by . Thus . For a unit right singular vector and corresponding left vector , the width of in direction equals times the width of the reference simplex in direction , which is at most . Every ball of radius contained in has width in every direction, so letting gives . Since , .
Every singular value lies between and by step 1.1. Their product is because the reference map is orientation preserving. Hence .
For a reference facet normal , [F2] gives its physical surface Jacobian . The singular values of from step 1.1 are between and , so is between and . Together with the determinant bounds this gives . The simplex pyramid identity gives , so step 2.1 and these facet bounds show . This proves all claimed geometric scalings.
Interior facet orientations cancel in a matching mesh
Statement
Orient every top-dimensional cell of a matching simplicial mesh by the ambient orientation of , and orient each facet by the induced boundary convention of Oriented simplicial cell chains and boundary. In the sum of the oriented boundaries of all top-dimensional cells, every interior facet occurs twice with opposite signs; every boundary facet occurs once.
Facts & Assumptions
Given: A finite face-to-face triangulation of a polyhedral domain, with each interior facet incident to two cells and each boundary facet to one.
A matching mesh is face-to-face: a shared facet is a whole facet of both cells. (Matching affine simplicial meshes and shape regularity)
The oriented boundary of an ordered simplex is the alternating sum of its codimension-one faces. (Oriented simplicial cell chains and boundary)
Proof
Let be an interior facet. Its two incident simplex interiors lie on opposite sides of the affine hyperplane containing ; otherwise their interiors would overlap near a relative-interior point of , contradicting the mesh definition. Therefore the two outward unit normals along are opposites.
The boundary orientation is defined by the condition that the outward normal followed by an oriented basis of the facet gives the ambient cell orientation. Replacing the outward normal by its negative reverses the induced facet orientation. Hence the two contributions of in the cell boundary sum have opposite signs and cancel. A boundary facet has one incident cell, so it appears once with its induced boundary orientation.
Gauss–Green formula on an affine simplex
Statement
Assume Countable Choice. Let be a nondegenerate affine -simplex and let . If is the outward unit normal on each facet , then For an orientation-preserving affine map , the oriented area element transforms as
Facts & Assumptions
Given: Countable Choice, a nondegenerate affine simplex , its fixed reference simplex, and a continuously differentiable vector field on .
The reference open simplex is ; every physical cell is its affine image. (Matching affine simplicial meshes and shape regularity)
For affine maps, weak derivatives transform by the constant Jacobian chain rule, and volume measure transforms by . (Affine pullback of weak derivatives and Sobolev seminorms)
The one-dimensional fundamental theorem of calculus gives for a continuously differentiable vector-valued function. (If is differentiable with integrable then ; and a bounded derivative makes Lipschitz)
Fubini's theorem permits iterated integration of the continuous bounded functions on the bounded simplex used below. (Tonelli and Fubini for the completed product, with only almost-everywhere section measurability)
A C1 diffeomorphism obeys Lebesgue change of variables with the absolute determinant. For the bounded integrands here, apply the nonnegative formula separately to positive and negative parts. (A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions)
The cited change-of-variables theorem assumes Countable Choice. (The Axiom of Countable Choice ())
Proof
First take . Fix and write , where and . The th coordinate ranges from to . By [F3], Integrating in and using [F4] gives the volume integral of as the difference of these two graph integrals. The lower graph is the coordinate facet with outward normal and area factor , hence its flux contribution is . The upper facet is the graph : its tangent Gram matrix is , whose eigenvalues are (multiplicity ) and , so its area factor is . Its outward unit normal is , so the th component of normal times area factor is . Thus the upper graph integral is exactly its th flux contribution. Other coordinate facets have zero th normal component. Summing over accounts for every component of the boundary flux and proves the formula on .
Let be an oriented tangent basis for a reference facet, with orientation chosen so its oriented area vector is . By the determinant definition of oriented area vector, for every , Equality against every gives the cofactor area-vector formula. Because , points to the exterior side corresponding to , so the formula has the outward orientation.
Define . The chain rule gives since . Applying the reference identity of step 1.1 to , and using [F5] to change variables in its bounded volume integrand, gives the physical volume integral. On each facet, step 1.2 gives Summing the facet identities proves the stated Gauss–Green formula on .
Smooth functions are dense in finite-order Sobolev spaces on a reference simplex
Statement
Assume Countable Choice. Let , , , and let be the reference simplex. Then restrictions of functions smooth on a neighbourhood of are dense in in its Sobolev norm. No density assertion for is made.
Facts & Assumptions
Given: The affine reference simplex and Sobolev conventions of Matching affine simplicial meshes and shape regularity and Integer-order Sobolev spaces and their norms, with finite and Countable Choice.
For an invertible affine map , weak derivatives obey ; higher derivatives follow by iterating this constant-matrix rule, with the corresponding determinant norm factors. For a homothety with , this gives . (Affine pullback of weak derivatives and Sobolev seminorms)
For finite , is dense in ; in particular its order-zero case gives density in . (Compactly supported smooth functions are dense in W^{k,p}(R^n))
Smooth cutoffs equal to one near a compact subset of an open set exist; multiplication by a smooth function with bounded derivatives preserves ; and a compactly supported function on an open set extends by zero to . (Test function cutoffs and euclidean localization, Weak Leibniz rule with a smooth factor, Compactly supported Sobolev functions extend by zero in every integer order)
Countable Choice is the explicit assumption in the cited Sobolev, weak-derivative and density interfaces. (The Axiom of Countable Choice ())
Proof
Let be the barycenter of and, for , set . The set is open and contains : each point of the closure is carried to a strict convex combination of that point and the interior point , which lies in the open simplex. Thus is defined on for , and [F1] gives .
For every , in as . To see this, extend by zero to and approximate that extension in by using [F2]. For , change of variables bounds the pullback error by ; for fixed , uniform continuity on the compact closure gives uniformly there. First choosing with arbitrarily small error and then taking proves the claim. Applying it to each of the finitely many and using [F1] shows in .
Fix . Since is compactly contained in , choose equal to one near that closure by [F3]. Then has compact support in , so its zero extension belongs to by [F3]. By [F2], choose converging to in that norm. Since on a neighbourhood of the closed simplex, the restrictions converge to in .
Given , choose close enough to one that by step 2.1, and then choose in step 2.2 with . The triangle inequality gives . The choices are finite for each ; Countable Choice is only the declared background of [F4], and no density is used.
A reference simplex is an integer-order Sobolev extension domain
Statement
Assume the Axiom of Choice. Let . For every integer and , there is a bounded linear operator whose restriction to is the input class. Consequently is a -extension domain in the sense of Sobolev extension domains and extension operators. The operator may be chosen with support in one fixed bounded set.
Facts & Assumptions
Given: , the reference simplex, , , and the Axiom of Choice.
Affine pullback and pushforward preserve , with weak derivatives and norm bounds controlled by the fixed affine matrix. (Affine pullback of weak derivatives and Sobolev seminorms)
On a half-space, for every integer and there is an explicit bounded extension built from finitely many reflected values; its coefficients satisfy for , so normal derivatives through order match at the reflecting hyperplane. Its proof verifies the weak derivative identity by ACL sections, integration by parts and Fubini, and gives a bound depending only on . (Integer-order Sobolev extension from a half-space)
Smooth cutoffs with compact support in a prescribed chart exist; the weak Leibniz rule bounds localized Sobolev norms; and a function supported away from the artificial edge of an open chart can be extended by zero across that edge by the weak test identity. (Test function cutoffs and euclidean localization, Weak Leibniz rule with a smooth factor, Compactly supported Sobolev functions extend by zero in every integer order)
The closed reference simplex is compact, and a finite subcover can be selected from any open cover of it. (Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line)
The Axiom of Choice implies each finite sequence of affine charts, cutoffs and local extension maps needed below can be selected; the local half-space extension theorem itself assumes this axiom. (The Axiom of Choice)
A -extension domain admits a bounded linear operator to whose restriction is the input almost-everywhere class. (Sobolev extension domains and extension operators)
Proof
Let . Define the barycentric affine coordinates by and for ; they sum to one and are nonnegative exactly on the closed simplex. The active set has at most elements, and the gradients of the corresponding coordinates are linearly independent. Complete these affine coordinates to an invertible affine coordinate system , where . Because every inactive barycentric coordinate is strictly positive at , a sufficiently small neighbourhood meets the simplex exactly in the orthant chart ; for it is an interior chart.
The charts cover the compact closure, so [F4] gives a finite subcover. Shrink them to open sets still covering the closure, with . Use [F3] to choose smooth cutoffs supported compactly in and equal to one on . Their sum is positive on a neighbourhood of the closed simplex. Choose a smooth cutoff supported compactly in and equal to one near the closed simplex, and set on , zero outside . Then each is smooth and supported in its chart, and their sum is one near the simplex. Each localized input has norm bounded by a fixed multiple of by the product rule in [F3].
In an interior chart, the localized function is zero near the chart edge. Its zero extension to has the same weak derivatives: for any test function, multiply that test by a cutoff equal to one on the localized support, apply the weak identity on the chart, and note that all derivatives of the cutoff product agree on that support. This is the zero-extension part of [F3]. In a boundary chart with active faces, the localized function is a function on the orthant and vanishes near the artificial edge of the chart; extend by zero across only that artificial edge using the same test-function argument.
Extend from to one coordinate at a time. At each stage, apply the reflected half-space formula in [F2] to the coordinate being extended, with the other positive coordinates as tangential variables. For clarity, the coordinate formula on is , with for ; for use even reflection. For a test compactly supported in , apply the half-space proof's normal ACL trace and integration-by-parts identity on each compact tangential subdomain and then exhaust the test support by finitely many such subdomains. Tangential weak derivatives pass through the finite reflection sum by the weak test identity, and the displayed moment equations cancel every normal interface term. The change of variable bounds each reflected derivative in by the same finite coefficient sum as in [F2] (and by the corresponding essential supremum sum at ). Thus this explicit operator is bounded on and extends one orthant coordinate. Repeating at most times gives the required extension. Pulling back through the affine chart changes the bound by a finite factor from [F1].
Apply these local bounded linear extensions to the finitely many localized pieces and add them. Their sum is bounded and linear, and on its restriction is . There are finitely many charts, all have bounded coordinate images and the reflection operators add support only by fixed finite factors, so the sum is supported in a fixed bounded set. The definition of extension domain in [F6] gives the conclusion.
Sobolev face traces and Gauss–Green on a reference simplex
Statement
Assume Countable Choice. Let and . For each facet of , restriction of smooth functions extends uniquely to a bounded linear trace map For real-valued and , the facet traces satisfy Here is the componentwise trace and is the outward unit normal. The bounded C1-domain trace and Green theorems are not used for the simplex.
Facts & Assumptions
Given: Countable Choice, the reference simplex, , and the Sobolev spaces specified in Integer-order Sobolev spaces and their norms.
Smooth functions on a neighbourhood of the closed simplex are dense in for every finite . (Smooth functions are dense in finite-order Sobolev spaces on a reference simplex)
For vector fields on a nondegenerate affine simplex, the divergence integral equals the sum of outward facet fluxes. (Gauss–Green formula on an affine simplex)
The spaces are complete for finite , and Holder's inequality gives . (Riesz-Fischer completeness of for , Holder's inequality for integrals, including the endpoint cases)
The smooth-density supplier [F1] assumes Countable Choice. (The Axiom of Countable Choice ())
Proof
Fix a facet opposite the vertex , let be the altitude from to , and put . On , ; on every other facet, which contains , is tangent, so its normal component is zero. For a smooth scalar , apply [F2] to . Since , is continuously differentiable, and ; hence Holder bounds the last integral by . For and , if then , while if then . Thus the product is at most . Since , the resulting inequality gives .
Let be a smooth sequence converging to in , which exists by [F1]. Applying the estimate of step 1.1 to shows is Cauchy in the complete space ; define to be its limit. The same estimate shows the limit is independent of the chosen smooth approximating sequence and . Linearity follows by taking approximating sequences for sums and scalar multiples.
For smooth , apply [F2] to the vector field . Its divergence is , so the displayed Green identity holds with ordinary restrictions. Choose smooth approximations in and componentwise in by [F1]. By step 2.1 their facet traces converge in and ; Holder [F3] makes the boundary products converge in . The volume products converge in by Holder and convergence of both Sobolev norms. Passing to the limit in the smooth identity proves the formula for .
Continuous matching piecewise polynomials belong to W1p
Statement
Assume Countable Choice. Let be a finite matching affine simplicial mesh of a bounded polyhedral open set , let , and let be a real-valued scalar member of the conforming piecewise-polynomial space in Broken and conforming polynomial spaces on a matching mesh. Then . Its weak gradient agrees almost everywhere on each cell with the ordinary cellwise polynomial gradient.
Facts & Assumptions
Given: Countable Choice, a finite matching mesh, polynomial on each cell with equal polynomial traces across every interior facet, , and .
The conforming condition is equality of the two polynomial traces on each whole interior facet. (Broken and conforming polynomial spaces on a matching mesh)
A field on a simplex satisfies the cellwise Gauss–Green formula. (Gauss–Green formula on an affine simplex)
The two outward normals on an interior matching facet are opposite, so its oriented contributions cancel when cell boundaries are summed. (Interior facet orientations cancel in a matching mesh)
A weak first derivative is characterized by integration against compactly supported smooth tests, and consists of classes whose weak first derivatives lie in . (Weak derivative of a locally integrable function, Integer-order Sobolev spaces and their norms)
Countable Choice is the explicit background assumption in the Sobolev-space definition. (The Axiom of Countable Choice ())
Proof
If , then by the mesh definition; is the unique zero class in and the cellwise-gradient assertion has no cells. Assume now . The mesh is finite and each cellwise polynomial and its ordinary first derivatives are bounded on the closed cell. Thus and the piecewise function belong to for every . Fix a coordinate and a test function . On each cell apply [F2] to to obtain
Sum these finitely many identities over . On an interior facet, [F1] gives a common trace for and [F3] gives opposite outward normals, so the two flux integrals cancel. On a boundary facet, because its support is compact in . Therefore By [F4], is the weak th derivative. This holds for every coordinate ; all are in , so with the stated cellwise gradient.
Zero-boundary conforming polynomials lie in W0 1p and satisfy Poincare
Statement
Assume Countable Choice. Let be a bounded polyhedral open set with a finite matching affine simplicial mesh, let , and let be a real-valued conforming piecewise polynomial whose polynomial trace vanishes on every boundary facet. Then Here is the norm closure of ; no C1 trace characterization is used.
Facts & Assumptions
Given: Countable Choice, the finite matching mesh, the conforming and zero-boundary conditions, bounded , and finite .
On each simplex, a vector field satisfies the cellwise Gauss–Green formula. (Gauss–Green formula on an affine simplex)
The mesh is the interior of the union of its cells, so each boundary component of a local simplicial link reaches an exterior facet. Equal polynomial traces and opposite facet orientations cancel interior fluxes; the zero-boundary condition makes every exterior facet trace zero. (Matching affine simplicial meshes and shape regularity, Broken and conforming polynomial spaces on a matching mesh, Interior facet orientations cancel in a matching mesh)
The zero-boundary space is precisely the norm closure of in . (Zero-boundary Sobolev space as a norm closure)
If is bounded in one direction, every satisfies for a slab of width and . (The Poincare inequality for zero-boundary Sobolev closures on domains bounded in one direction)
Compactly supported Sobolev functions extend by zero, and compactly supported functions can be approximated by smooth compactly supported functions. Smooth cutoffs and the weak product rule are available. (Compactly supported Sobolev functions extend by zero in every integer order, Compactly supported smooth functions are dense in W^{k,p}(R^n), Test function cutoffs and euclidean localization, Weak Leibniz rule with a smooth factor)
A decreasing sequence of measurable subsets of a finite-measure set has measures tending to the measure of its intersection. (Continuity from above when one set has finite measure)
The Sobolev class and its norm use the weak-derivative and conventions of Integer-order Sobolev spaces and their norms.
Standard smooth mollifiers turn a Lipschitz cutoff into a smooth one; convolution with a unit-mass mollifier is smooth, and its Lipschitz bound does not exceed that of the original function. (The mollifier family generated by a unit-mass smooth bump, Convolution with a mollifier is smooth, and derivatives pass under the integral sign, Explicit compactly supported smooth cutoffs)
The Sobolev and zero-boundary suppliers used above assume Countable Choice. (The Axiom of Countable Choice ())
Proof
If , then and the conclusion is immediate. Assume henceforth . Extend by zero to on and define to be its cellwise derivative on mesh cells and zero outside . On each cell apply the simplex Green formula to for an arbitrary . Fact [F1] gives the cell identity. Interior facet terms cancel by [F2]; boundary facet terms vanish by the zero-boundary clause of [F2]. Summing the finitely many cell identities gives Both functions are in , so [F7] gives with gradient .
Put , which is -Lipschitz. Choose a smooth scalar step with for , for , and . For set and convolve it with a nonnegative smooth mollifier of integral one supported in the ball of radius , obtaining . Then is smooth, supported in , equals zero where , equals one where , and . Since is bounded, its support is compact in .
Let be the maximum of the cellwise suprema of . Across every interior facet the polynomial traces agree; on every boundary facet they agree with zero. For a point in the mesh skeleton, its minimal mesh face is the unique mesh face whose relative interior contains ; the local star of that face means the union of the cells containing it. If the minimal face is a facet, there are exactly two incident cells at an interior facet and exactly one at a boundary facet. In the interior case their values at agree by the matching polynomial traces; in the boundary case the single cell value agrees with exterior zero by the zero boundary trace. For the remaining faces, let be their codimension. The incident simplicial cones in their local star cut a small sphere in the normal space of the face, of dimension , into a finite face-to-face triangulation of the local directions in . Within each connected component, top-dimensional pieces are connected by facet adjacency: perturb a path in that open component to avoid the finite union of codimension-two faces. At an interior point the direction set is the whole sphere, which is connected because , so matching traces make all incident polynomial values agree. At a boundary point every component has a boundary direction; following facet adjacencies reaches a boundary facet, where the polynomial value is zero, so all cell limits in that component are zero. Thus in all cases the cellwise continuous representatives and the exterior zero fit continuously on the whole finite polyhedral partition. Restrict this continuous function to any line segment. The segment is divided by the finitely many cell facets into finitely many intervals; on each cell interval its derivative along the segment has magnitude at most , and on exterior intervals it is zero. Continuity at the interval endpoints then gives for all . Thus .
The difference and its weak gradient are supported in . On this layer, step 2.1 gives , and step 1.2 gives . Also . For , the sets decrease to the empty set and , so [F6] gives . These bounds show for finite .
Each has compact support in . By [F5] extend it by zero to and approximate there by . Choose a smooth cutoff equal to one near the compact support of . Then and, by the weak product rule, in . A diagonal choice with step 3.1 proves by [F3].
A bounded set lies in a slab of finite width . Apply [F4] to the membership from step 4.1, obtaining the displayed inequality with for the fixed exponent .
Poincare–Wirtinger inequality on a reference simplex
Statement
Assume Countable Choice. For every there is such that for all ,
Facts & Assumptions
Given: Countable Choice, the bounded convex reference simplex and .
Smooth functions on a neighbourhood of the closed simplex are dense in . (Smooth functions are dense in finite-order Sobolev spaces on a reference simplex)
Along a segment, the fundamental theorem gives the integral of the directional derivative, bounded by segment length times the integral of . (If is differentiable with integrable then ; and a bounded derivative makes Lipschitz)
Jensen bounds the th power of an average by the average of the th powers; Tonelli/Fubini permits the pair and parameter integrals; Holder controls integrals on the finite-measure simplex; affine change of variables has its determinant factor. (Jensen's integral inequality for a probability measure, Tonelli and Fubini for the completed product, with only almost-everywhere section measurability, Holder's inequality for integrals, including the endpoint cases, A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions)
The smooth-density supplier [F1] assumes Countable Choice. (The Axiom of Countable Choice ())
Proof
First take smooth. For , convexity keeps in the simplex. The segment identity and give by [F2] and Jensen on the unit interval. Jensen again gives
Integrate the last bound over . For , fix and use ; its Jacobian is , and its image is contained in the simplex, so its integral is at most . For , fix and use , whose inverse Jacobian is at most , giving the same bound. Tonelli [F3] therefore yields Taking th roots proves the estimate for smooth .
For arbitrary choose smooth in by [F1]. Holder on the finite-measure simplex gives , so ; also and . Passing to the limit in the smooth inequality of step 2.1 proves the statement.
Bramble–Hilbert approximation on a reference simplex
Statement
Assume Countable Choice. Let , integer , integer , and real-valued . There is a polynomial , chosen by matching all means for , such that:
- if , then ;
- if , then .
The second clause assumes ; constants depend only on .
Facts & Assumptions
Given: , integers and , and .
The mean-zero Poincare–Wirtinger inequality holds on the reference simplex for every finite . (Poincare–Wirtinger inequality on a reference simplex)
Sobolev classes provide all weak derivatives up to the specified integer order, and their norms are finite sums of derivative norms. (Integer-order Sobolev spaces and their norms)
The mean-zero Poincare supplier [F1] assumes Countable Choice. (The Axiom of Countable Choice ())
Holder's inequality on the finite-volume simplex sends derivatives into for finite . (Holder's inequality for integrals, including the endpoint cases)
Proof
The monomials with form a basis of . Thus if is the number of these multi-indices, then . Define the linear moment map by . If every component is zero, take the largest degree of a nonzero homogeneous part of . For each , is the constant times the coefficient of in that highest homogeneous part; its zero mean forces that coefficient to vanish. This contradicts the choice of . Repeating downward shows , so is injective and, since its domain and codomain have the same finite dimension, bijective.
The vector of means of , , is defined because each derivative is in on the finite-measure simplex and therefore in by [F4]. By bijectivity in step 1.1 there is a unique with those moments. For , each derivative , , has zero mean; and every derivative of of order at least is zero.
Apply [F1] to every mean-zero derivative of order in step 2.1; its norm is bounded by the norms of derivatives of order of , since . Apply [F1] successively to derivatives of orders , each of which also has zero mean; at each stage its norm is bounded by the next derivative order already controlled. Thus all derivatives of of order at most are bounded by . If , retaining only orders through proves the first clause.
If , the same argument controls all derivative orders at most by . For each , because . Adding the finitely many derivative bounds through order gives , proving the second clause.
Local interpolation estimates on shape-regular affine meshes
Statement
Assume Countable Choice. Let , , and let be a reference finite element whose polynomial space contains . Assume its degrees of freedom are bounded on for an integer , let , and let be its interpolant. Thus for . On a shape-regular affine mesh as in Matching affine simplicial meshes and shape regularity, for each cell with its orientation-preserving reference map define For every such cell, if and , then for , If and , then for , The constants are uniform over the mesh family and depend on the stated reference element, exponents and shape-regularity bound. For Lagrange elements in the existing mesh dimension range , assume additionally the Axiom of Choice for the automatic nodal-boundedness application. Then Sobolev threshold for Lagrange point evaluations on a reference simplex supplies the boundedness hypothesis when ; unisolvence of a particular node set remains a separate hypothesis.
Facts & Assumptions
Given: A shape-regular affine simplex family, finite , a unisolvent reference element, Countable Choice, and the stated degree-of-freedom boundedness on .
Unisolvent degrees of freedom define a linear interpolation operator that reproduces every polynomial in its finite-element space. (Reference finite elements and unisolvent degrees of freedom, Unisolvent degrees of freedom define a unique reference interpolant)
On the fixed reference polynomial space, every derivative norm is bounded by its coefficient or cell norm; hence bounded degrees of freedom give a bounded interpolant into every polynomial derivative norm. (Polynomial derivative and face norms are controlled on a reference simplex)
For real-valued , Bramble–Hilbert supplies a polynomial of degree at most with when , and for with , when . (Bramble–Hilbert approximation on a reference simplex)
Under affine pullback/pushforward, order- seminorms acquire or factors. (Affine pullback of weak derivatives and Sobolev seminorms)
Shape regularity gives , and . (Shape regularity controls affine simplex geometry)
Under the additional Axiom of Choice and the existing dimension restriction , Lagrange point evaluations are bounded when . (Sobolev threshold for Lagrange point evaluations on a reference simplex) The generic estimate takes bounded degrees of freedom as a hypothesis.
The Bramble–Hilbert supplier [F3] assumes Countable Choice through the reference Poincare–Wirtinger inequality. (The Axiom of Countable Choice ())
For complex-valued Sobolev functions, real and imaginary parts and their weak derivatives are taken componentwise; the pointwise inequalities combine the real-valued Sobolev estimates into the corresponding complex-valued estimates, with at most a fixed factor in the constant. (Integer-order Sobolev spaces and their norms)
Proof
On the reference cell, write as the finite sum of its degree-of-freedom values times the dual shape functions. The assumed boundedness of each functional and [F2] bound . For any reproduced , linearity gives so For the automatic Lagrange application, under the additional Axiom of Choice, , and , [F6] verifies nodal-functional boundedness. For the generic estimate, boundedness is the explicit hypothesis, so this additional choice assumption is not used.
If and is real-valued, choose the Bramble–Hilbert polynomial from [F3]. If is complex-valued, apply the first clause of [F3] to and separately, obtaining , and set . In either case is reproduced by . Since and , [F3] bounds both terms in step 1.1 for the real case; for the complex case, [F8] combines the two real estimates and changes only the constant. Thus .
If and is real-valued, choose the Bramble–Hilbert polynomial from [F3]. If is complex-valued, apply the second clause of [F3] with , to its real and imaginary parts, obtaining , and set . In either case is reproduced by . Then [F3] bounds the norm of by ; because , the same controls its norm. For complex , [F8] combines the component estimates with at most a fixed change in . Step 1.1 gives
For , use [F4] to transform the physical error to the reference cell and the reference derivatives of back to the physical cell. The product of the two determinant factors cancels; the remaining matrix factors are bounded by by [F5]. This gives the first physical estimate from step 2.1.
In the second case, apply the same transformation separately to each order in step 2.2. Its matrix factor is bounded by by [F5]; summing over gives the second physical estimate. The constants in [F2]–[F7] are uniform over the fixed reference element and the shape-regular family, proving uniformity.
Polynomial inverse and discrete trace inequalities
Statement
Assume Countable Choice. Fix polynomial degree , , and integers . Let the shape-regular affine simplex family be as in Matching affine simplicial meshes and shape regularity. For every cell in that family, there is a constant independent of cell size such that, for every and every facet , Use . Constants may depend on and the family shape regularity bound, but not on or .
Facts & Assumptions
Given: Countable Choice, the fixed reference simplex, a shape-regular affine mesh family, polynomial degree , the displayed exponents, and a cell polynomial .
On the fixed finite-dimensional polynomial space, when , and every facet norm is bounded by the cell norm, for all . (Polynomial derivative and face norms are controlled on a reference simplex)
Under an affine map, order- Sobolev seminorms acquire factors on pullback and on pushforward. Its oriented face area vector is . (Affine pullback of weak derivatives and Sobolev seminorms, Gauss–Green formula on an affine simplex)
Shape regularity gives , , , and each facet Jacobian is comparable to . (Shape regularity controls affine simplex geometry)
The reference polynomial norm result [F1] uses Sobolev norms whose definition assumes Countable Choice. (The Axiom of Countable Choice ())
Proof
Pull back to . By [F1], and for each reference facet; finitely many facets allow one constant.
Apply the affine derivative estimates [F2] in both directions and then [F3]. For the cell inequality the total factor is bounded by For the face inequality it is bounded by the physical face Jacobian to power times the inverse cell Jacobian to power , namely . These are the two claimed estimates.
Covariant and contravariant Piola maps and H(div)/H(curl) spaces
Definition
Assume Countable Choice. Let , take as in Matching affine simplicial meshes and shape regularity, and let under an affine cell map with . Weak derivatives use the signed test identity of Weak derivative of a locally integrable function. For define where weakly, meaning for every . For , define the weak scalar curl by for every . For , define the weak vector curl by for every . In dimensions set with for and for .
The covariant Piola pushforward of a reference vector field is and the contravariant Piola pushforward is The scalar pullback is . The exact mapping properties, weak differential identities, and oriented trace-moment transformations are established in the corresponding affine Piola theorem below.
Affine Piola maps commute with differential operators and preserve moments
Statement
Assume Countable Choice. Let or and let map a reference simplex to an affine cell with . The contravariant Piola map maps into and The covariant Piola map maps into ; in its scalar curl is , and in its vector curl is . For every , the scalar pullback belongs to and its gradient satisfies For smooth fields, contravariant normal fluxes satisfy ; covariant tangential pullbacks satisfy for every reference tangent . Thus edge line integrals and normal-flux moments are preserved, and face tangential moments transform with this pullback and the induced facet surface Jacobian. These formulas record the chosen orientation; reversing a facet orientation reverses its signed moment.
Facts & Assumptions
Given: Countable Choice, the affine map, , , and the weak graph spaces and Piola maps of Covariant and contravariant Piola maps and H(div)/H(curl) spaces.
Weak derivatives pull back through an affine map by the constant matrix chain rule, and affine change of variables multiplies volume by . (Affine pullback of weak derivatives and Sobolev seminorms)
The cofactor area-vector identity is , with outward orientation preserved when . (Gauss–Green formula on an affine simplex)
Lebesgue change of variables holds for nonnegative measurable integrands; apply it to positive and negative parts for integrable signed pairings. (A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions)
The affine pullback and change-of-variables suppliers assume Countable Choice. (The Axiom of Countable Choice ())
Applying the affine weak-derivative transformation to gives for . (Affine pullback of weak derivatives and Sobolev seminorms)
Proof
For and , put . Then [F1] and the determinant substitution give The final expression equals . This is the distributional divergence identity.
For smooth , differentiate componentwise. In three dimensions, write . For any and indices , the scalar triple product gives Since this holds for every , comparing components yields . The chain rule then gives . In two dimensions write and . Then , , , and . Substituting these four expressions and cancelling the two mixed terms gives .
The physical field and candidate divergence in step 1.1 lie in : affine change of variables makes their squared norms finite constant multiples of the reference squared norms, and multiplication by the fixed matrix preserves finiteness. The test identity in step 1.1 therefore gives membership in and the asserted divergence formula.
For , take and set . The component calculation in step 1.2 gives . Change variables and use the weak curl identity on the reference cell: For , take and set . The determinant identity transforms the weak scalar-curl pairing into , which by the weak reference curl identity equals and hence the pairing with the asserted physical scalar curl. In both dimensions the mapped field and candidate curl lie in by the fixed-matrix and determinant bounds. Thus the weak definition gives the claimed mapping.
The normal flux identity follows by dotting with the area vector [F2]: For a reference tangent , . Along an edge this equality is the line-form identity . On a facet, integration against a pulled-back tangent vector and scalar weight gives where is the affine facet surface Jacobian. The normal-flux moment with scalar weight equals . The signs are those of the selected outward facet orientation; reversing it reverses the signed normal moment.
For , apply [F5] to . For each , In vector notation this is which proves the scalar-gradient identity.
Affine Piola transport preserves commuting interpolation diagrams
Statement
Let and be reference and physical spaces related by invertible affine Piola maps . Let and be the corresponding differential operators, and assume the proved affine identities from Affine Piola maps commute with differential operators and preserve moments. Suppose reference interpolation operators are defined on spaces containing the relevant inputs and satisfy there. Define the physical interpolants by Piola conjugation . Then on every input for which these compositions are defined. This is conditional on the reference commuting identity; it does not assert that arbitrary unisolvent degrees of freedom commute.
Facts & Assumptions
Given: Unisolvent reference interpolants as in Reference finite elements and unisolvent degrees of freedom and Unisolvent degrees of freedom define a unique reference interpolant, invertible affine Piola maps, and the reference commuting identities in the statement.
The physical and reference differential operators satisfy on their domains. (Affine Piola maps commute with differential operators and preserve moments)
The interpolation operator defined by the dual shape functions is a linear map on its declared domain. (Unisolvent degrees of freedom define a unique reference interpolant)
Proof
By definition . Using [F1] and the assumed reference commutation,
Apply [F1] to , equivalently . Substitution into step 1.1 gives which is the claimed physical commuting identity. The only interpolation property used was the explicitly assumed reference identity, proving the conditional scope.
Sobolev threshold for Lagrange point evaluations on a reference simplex
Statement
Assume the Axiom of Choice. Let , let , choose , and let be an integer. If and , then each point evaluation has a unique continuous-representative value and If , the same conclusion holds for every . Consequently any finite set of Lagrange nodal evaluations is bounded on the stated Sobolev space and defines a well-defined degree-of-freedom functional there. No boundedness at is asserted.
Facts & Assumptions
Given: The Axiom of Choice, , integer , the reference simplex, and the exponent in the appropriate branch.
The Axiom of Choice states that every family of nonempty sets has a choice function. (The Axiom of Choice)
The reference simplex is a bounded extension domain for every integer Sobolev order and exponent. (A reference simplex is an integer-order Sobolev extension domain)
On a bounded extension domain, if , higher-order Sobolev embedding gives a continuous representative and a norm bound; its proof assumes the Axiom of Choice. (Higher-order Sobolev embedding)
For finite , the Sobolev norm is the norm of the finite vector of derivative norms; for it is their maximum. (Integer-order Sobolev spaces and their norms)
Holder's inequality on the finite-measure simplex sends each bounded derivative into every finite space with the expected measure factor. (Holder's inequality for integrals, including the endpoint cases)
The reference finite-element convention requires a unisolvent list of linear functionals on its finite-dimensional space and chosen bounded extensions to the interpolation domain. Thus, for nodal degrees of freedom of such an element, the Sobolev evaluation maps must extend the polynomial evaluations; unisolvence is a separate hypothesis. (Reference finite elements and unisolvent degrees of freedom)
Proof
Suppose and . Then , so apply [F2] with , , and extension domain [F1]. It gives a continuous representative on the closed simplex and a bound for its supremum by . Two continuous representatives of the same almost-everywhere class agree everywhere: if their difference were nonzero at a point of the closed simplex, continuity on the closure and the fact that the simplex is the closure of its interior would give a nonempty interior ball on which the difference stays nonzero, contradicting almost-everywhere equality. Thus every is uniquely defined and obeys the displayed bound.
If , choose any finite . Since the simplex has finite volume, [F4] gives for , so continuously. The same simplex extension result [F1] and embedding [F2], now with and , give a unique continuous representative and the required bound by . In either branch, evaluation is linear because a linear combination of continuous representatives is the unique continuous representative of the corresponding Sobolev class. On a polynomial it is the ordinary nodal value, so these bounded maps extend any prescribed nodal degrees of freedom as required by [F5], without asserting unisolvence of an arbitrary node list; for , the nodes have a common bound by taking the maximum of their constants, while for the assertion is vacuous and any finite constant, such as , suffices.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Jean-Luc Guermond, MATH 661 Fall 2025, Chapter 8, “Meshes”
- Luca Heltai, Numerical Methods for Partial Differential Equations, Lecture 2
- Jean-Luc Guermond, MATH 661 Fall 2025, Chapter 10, “Mesh orientation”
- Joachim Schöberl, Numerical Methods for Partial Differential Equations, Chapter 8
- Jean-Luc Guermond, MATH 661 Fall 2025, Chapter 10
- Jean-Luc Guermond, MATH 661 Fall 2019, Chapter 32, “H1-conforming approximation (I)”
- Joachim Schöberl, Numerical Methods for Partial Differential Equations, Chapter 4
- Jean-Luc Guermond, MATH 661 Fall 2025, Chapter 11, “Local interpolation on affine meshes”
- Jean-Luc Guermond, MATH 661 Fall 2025, Chapter 11
- Jean-Luc Guermond, MATH 661 Fall 2025, Chapter 12
- Jean-Luc Guermond, MATH 661 Fall 2025, Chapter 14
- Joachim Schöberl, Numerical Methods for Partial Differential Equations, Chapter 6
- Jean-Luc Guermond, MATH 661 Fall 2025, Chapter 15
- Jean-Luc Guermond, MATH 661 Fall 2019, Chapter 32
- Jean-Luc Guermond, MATH 661 Fall 2025, Chapter 14, “H(div) finite elements”
- Jean-Luc Guermond, MATH 661 Fall 2025, Chapters 15–16, “H(curl) finite elements” and “Local interpolation in H(div) and H(curl)”
- Jean-Luc Guermond, MATH 661 Fall 2025, Chapter 16
- Juha Kinnunen, Sobolev Spaces (Aalto University, 2026)