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.
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.
Depends on
Used by
- Periodic FE-HMM with simplicial macro and periodic P1 micro meshes Algorithm
- Shape-regular affine finite elements supply the Strang approximation term Corollary
- A local moment interpolant for conforming P1 meshes Definition
- Compatible 2D newest-vertex-bisection meshes Definition
- Conforming nodal P1 Signorini contact discretization Definition
- Conservative flux-differencing SBP method for nonlinear systems Definition
- Jump and average conventions for symmetric interior-penalty DG Definition
- Residual indicators and data oscillation for P1 AFEM Definition
- Scalar finite-element substructuring model Definition
- Symmetric and nonsymmetric Nitsche boundary forms Definition
- Symmetric interior-penalty DG form and energy seminorm Definition
- The conforming P1-bubble/P1 mini element Definition
- The elliptic Ritz projection for a conforming finite-element space Definition
- The P1 AFEM approximation class Definition
- Upwind discontinuous Galerkin discretization of constant transport Definition
- A broken piecewise-constant trial space can give an eigenvalue below the Dirichlet ground state Example
- A conforming P1 Dirichlet discretization gives a first Ritz upper bound Example
- An affine shear field passes the frictionless contact patch test Example
- Direct derivation of the semidiscrete Ritz residual Example
- The L2 projection and Ritz projection give different initial data Example
- Boundary-preserving face-average P1 interpolation Lemma
- Contact nodal coordinates are independently attainable Lemma
- Element and edge residual representation for P1 Galerkin errors Lemma
- Quasi-uniform finite-element mass inverses have summable graph decay Lemma
- The convex-obstacle nodal set is conforming Lemma
- Continuous matching piecewise polynomials belong to W1p Theorem
- Falk error bound for nodal Signorini contact Theorem
- Local approximation and reproduction of the P1 moment interpolant Theorem
- Stable two-level P1 decomposition for structured Poisson meshes Theorem
- Well-posedness and energy stability of the semidiscrete FEM system Theorem
- Zero-boundary conforming polynomials lie in W0 1p and satisfy Poincare Theorem
- Zero-boundary fractional interpolation in the Nitsche comparison norm Theorem
Dependency tree · one level
1 result within one dependency step of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Jean-Luc Guermond, MATH 661 Fall 2019, Chapter 32, “H1-conforming approximation (I)” (standard reference, not scraped)
- Luca Heltai, Numerical Methods for Partial Differential Equations, Lecture 2 (standard reference, not scraped)