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.
First-order least-squares FEM and practical DPG
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Absolute Continuity and the Sharp Fundamental Theorem of Calculus
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- 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 Lp Spaces and Test-Function Conventions
- Complex Norms and Realification
- Complexification, Realification and Real Structures
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- 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
- Convexity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Cyclic Groups and Direct Products
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Differentiation of Monotone Functions and the Vitali Covering Theorem
- Distributions Test Functions and Differentiation
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces Adjoint Operators and Annihilators
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Euclidean Surface Measure, Divergence, and Green Identities
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite-element meshes and interpolation
- Foundations of the Real Numbers for Analysis
- Fredholm Elliptic Problems and the Elliptic Spectrum
- Fubini and Change of Variables
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Harmonic Functions and Mean Values in Rn
- Hausdorff via the Diagonal
- 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
- Matrix Norms, Condition Numbers and Numerical Stability
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed finite elements and Stokes stability
- Mixed H(div) fluxes, Darcy flow and local conservation
- 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
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Radon Measures and the Riesz Markov Kakutani Theorem
- 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
- Sobolev Traces and Zero Boundary Values
- Splitting Fields
- Subspaces, Products, and Quotients
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- 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 Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- 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 Spectral Theorem, Positive Operators and Singular Value Decomposition
- 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
This page fixes the PE30 plan-spec sign convention for the first-order Poisson system: , , and residual . The prose design writes the negative of this flux and the corresponding opposite second residual; negating its flux identifies the two squared objectives. All norms below are real and all integrals exact.
For the conforming least-squares family, is a bounded connected Lipschitz polygon, the flux lies in , and the scalar lies in . The residual map is a norm equivalent to the product graph norm by the homogeneous Dirichlet Poincaré inequality. Thus the finite RT0/P1 minimizer exists uniquely and is the residual-orthogonal best approximation. Its boundary condition is part of the scalar trial space. Quadrature, geometry and algebraic-solve perturbations are separate questions.
In dimension two the rotation carries the H(div) normal trace to the H(curl) tangential trace. The edge convention is for the cell-outward normal; adjacent cells therefore reverse both. The diagram records this local distributional identity.
H(\operatorname{div};K) \arrow[r,"R"] \arrow[d,"\operatorname{div}"'] & H(\operatorname{curl};K) \arrow[d,"\operatorname{curl}"] \\
L^2(K) \arrow[r,"\mathrm{id}"'] & L^2(K)
The horizontal map is the fixed planar rotation, the vertical maps are distributional divergence and scalar curl, and the bottom map is the identity on real . Lemma Planar rotation carries H(div) normal traces to tangential traces proves the diagram commutes and establishes the trace orientation; no proof relies on the drawing.
For practical DPG, the ultraweak trial variables are in and compatible global scalar/normal trace quotient ranges. Tests are broken with graph norm. The local form is with each normal outward from its cell and right-hand side for . The local normal-trace surjectivity result supplies the trace-duality separation used in the kernel proof. The trace quotient, boundedness and trial-kernel results make these pairings well-defined and identify the ideal energy norm.
For every , the bounded-load lifting uses one global Lax–Milgram solve and actual global scalar and normal traces to construct with . Its norm depends only on the fixed-domain Poincaré constant, not on mesh size. This proves the connected-domain primal and adjoint graph bounds in dimensions two and three without a Hodge decomposition, simple connectivity, or connected boundary. The diagram records the right-inverse identity established in A topology-free bounded lifting of every ultraweak Poisson load; its commutativity is proved in that item, not inferred from the drawing.
V' \arrow[r,"R"] \arrow[dr,"\mathrm{id}_{V'}"'] & U \arrow[d,"B"] \\
& V'
The top and right arrows are the bounded load lifting and trial operator, and the diagonal is the identity on the real test dual.
For the two-dimensional P1 volume trial, continuous P2 scalar trace, P1 normal trace and broken P3 vector/scalar tests, the page supplies a local Fortin map. The proof uses seven scalar moments and twelve restricted RT2 moments, including the full unisolvence argument; it yields a mesh-uniform graph bound and the four DPG moment identities. Each local practical Riesz solve forms exact Gram data and uses an exact factorization; a dependent generating family returns singular-test-matrix, while a fixed basis gives the unique bounded linear Riesz map. Under continuous inf-sup assumptions, the practical DPG system is the mixed residual Riesz problem and has the proved conditional quasi-optimal bound. The residual estimator is reliable and efficient up to the Fortin data oscillation; for this Fortin map it is bounded by cell-average oscillation and vanishes on cellwise constant data.
The practical corollary uses only the dimension-two triangular P1/R3 family selected by PE30, on all bounded connected Lipschitz polygons including holes. The continuous graph theorem covers dimensions two and three. The PE09 page prerequisite remains declared as assigned; its current tangential-trace result is three-dimensional, so the local planar rotation proof uses the actual PE08 H(div) normal-trace supplier instead. Variational-crime estimates remain a declared page prerequisite; this exact conforming residual analysis does not use a Strang inequality.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Planar rotation carries H(div) normal traces to tangential traces
Statement
Assume Countable Choice. For a nondegenerate oriented triangle , set , let be cell-outward and . If is real, then , distributionally, and for all . Thus weak tangential trace equals weak normal trace under .
Here with its graph norm. The weak tangential trace is the functional on defined by the integral in the Statement; the computation below proves it is the rotation of the PE08 weak normal trace.
Facts & Assumptions
Given: Countable Choice and real .
Countable Choice is declared for trace interfaces. (The Axiom of Countable Choice ())
H(div) consists of real L2 vectors with L2 distributional divergence. (The real H(div) space)
The weak normal trace acts by . (Weak normal trace by Green duality)
Proof
Writing gives as distributions; [F1] places it in .
Orthogonality gives , so step 1.1 makes the trace integral exactly [F2]. Also .
First-order least-squares formulation of the Dirichlet Poisson problem
Definition
Assume Countable Choice. Let be bounded connected Lipschitz and . Solve , ; set , so . For a finite conforming shape-regular triangular mesh, define and . Here and is continuous piecewise affine. The real Sobolev-space and zero-boundary conventions are Integer-order Sobolev spaces and their norms and Zero-boundary Sobolev space as a norm closure; H(div), mesh, and RT conventions are The real H(div) space and Affine simplicial meshes and RT/BDM spaces. This is the plan-spec PE30 sign convention; negating the design flux converts its residuals to these and preserves the squared objective. Integrals are exact; geometry, quadrature and roundoff errors are excluded.
Ultraweak Poisson DPG spaces and plan-consistent bilinear form
Definition
Assume Countable Choice. Let or , bounded connected Lipschitz polyhedral and a finite conforming shape-regular simplicial partition; all fields are real. For a load , put and , with squared broken graph norm . Let be the elementwise trace range of and the elementwise weak normal trace range of , each with global lift infimum norm; range membership is compatibility and normal traces are conservative across interior facets. Set , . For and , define Pairings sum over cell boundaries and use the cell-outward normal. The sign convention is , .
Axiom and interface note
Countable Choice is declared for Sobolev traces. The planar rotation identity is proved locally in Planar rotation carries H(div) normal traces to tangential traces; no 3D H(curl) trace result is imported.
Least-squares residual norm is equivalent to H(div) x H1_0 error
Statement
Assume Countable Choice. Let be bounded connected Lipschitz and satisfy on . For , put . This is injective and its norm is equivalent to the product graph norm. If , , , then , , , and .
Facts & Assumptions
Given: Countable Choice, the real spaces and the stated Poincare inequality.
Countable Choice is used to choose the H1_0 density sequence in the weak Green passage. (The Axiom of Countable Choice ())
Residual components follow the least-squares definition. (First-order least-squares formulation of the Dirichlet Poisson problem)
H(div) has L2 distributional divergence and graph norm. (The real H(div) space)
Homogeneous Dirichlet Poincare holds. (A bounded-domain Poincare inequality for H1-zero fields)
H1_0 is the H1 closure of compactly supported smooth functions. (Zero-boundary Sobolev space as a norm closure)
Proof
Approximate by compactly supported smooth functions. The distributional divergence identity and continuity give . Substitute to get .
Cauchy–Schwarz and [F3] imply . If , divide by ; if , the bound is immediate. Poincare and give the stated component estimates, controlling the product graph norm.
The first residual square is at most and the second is the divergence component. If , step 2.1 and Poincare give , then . This proves reverse boundedness and injectivity.
Exact local finite Riesz solves for practical DPG tests
Definition
Inputs: A finite-dimensional real graph-test space presented as , an ordered finite generating family (not assumed independent), a trial datum , the graph inner product , and the linear functional on .
Output: Either a vector in or the status singular-test-matrix.
Admissible conditions: ; all entries are real and exact; is defined and linear on . The Gram entries and functional values are evaluated exactly. No quadrature or rounded solve is part of this procedure.
Instructions:
- Form and exactly.
- Initialize and compute an unpivoted symmetric factorization in the listed order. At pivot , set
If , return
singular-test-matrix. Otherwise set and - Solve , , and exactly, and return . For , return the zero vector of .
Weak H(div) normal trace surjects onto the scalar trace dual
Statement
Assume Countable Choice and the local trace quotient convention of Weak normal trace by Green duality. Let be open; all spaces are real. With and its quotient norm, the weak normal trace map is onto. In fact every has a lift satisfying and .
Facts & Assumptions
Given: Countable Choice, an open set , and a bounded real linear functional on .
Countable Choice is used by the Sobolev and Hilbert Riesz interfaces. (The Axiom of Countable Choice ())
consists of real functions with all first distributional derivatives in , and is the closure of . (Integer-order Sobolev spaces and their norms, Zero-boundary Sobolev space as a norm closure)
Real is complete for its integral inner product. ( with the integral pairing is a Hilbert space)
Riesz represents each bounded real functional on a Hilbert space by a vector of the same norm. (Riesz representation for Hilbert spaces)
For the weak normal trace is the displayed Green functional on . (Weak normal trace by Green duality)
requires an vector field and an distributional divergence. (The real H(div) space)
Proof
The space is Hilbert for . Indeed, a Cauchy sequence of functions and their weak derivatives converges componentwise in by [F2]; testing against and passing both integrals to the limits shows the derivative limits are the weak derivatives of the function limit. The quotient map has norm at most one, so is bounded on with . By [F3] choose its Riesz representative , so .
For every , because ; hence . By the distributional definition of divergence, this means . Since and , [F5] gives , with .
For any , [F4] and step 2.1 give . Thus , and step 2.1 gives the claimed norm bound. Since was arbitrary, is onto.
Ultraweak Poisson skeleton spaces are Hilbert trace quotients
Statement
Assume Countable Choice and Ultraweak Poisson DPG spaces and plan-consistent bilinear form. The elementwise trace map and normal-trace map have real Hilbert quotient ranges with global lift infimum norms. These equal the infima over broken extensions whose gluing belongs to the respective global space. Compatibility means membership in these ranges, so normal traces are conservative on each interior facet in the weak distributional sense.
Facts & Assumptions
Given: The finite mesh, trace maps, Countable Choice.
Countable Choice is declared for trace interfaces. (The Axiom of Countable Choice ())
H(div) is Hilbert and its zero-trace subspace is closed. (H(div) is Hilbert and H0(div) is closed)
Cell weak normal traces are continuous. (Weak normal trace by Green duality)
Cell scalar traces are bounded in H1. (H1 facet trace inequality on shape-regular simplices)
Global H1 traces agree on interior facets. (H1 traces agree across interior mesh facets)
The formulation fixes the trace ranges and lift norms. (Ultraweak Poisson DPG spaces and plan-consistent bilinear form)
Real L2 with its integral inner product is a Hilbert space. ( with the integral pairing is a Hilbert space)
H1 functions and their first derivatives are L2 classes defined by distributional derivatives; H1_0 is the stated closure. (Integer-order Sobolev spaces and their norms, Zero-boundary Sobolev space as a norm closure)
A global H(div) field has an L2 distributional divergence, so for every , . (The real H(div) space)
Proof
H1 is complete: completeness of real [F6] gives limits in of a Cauchy sequence and each weak derivative satisfy distributional derivative identities by testing against compactly supported smooth functions and passing both integrals to their limits. H1_0 is closed by its closure definition. The scalar trace-quotient map is continuous because on each cell; the finite product preserves continuity. The normal map is continuous by [F2], again with a finite product. Thus both kernels are closed.
Let and let an interior facet be fixed. For , choose a smooth function supported in a small tubular neighborhood of meeting only and and having trace on . The global distributional-divergence identity [F8] gives . Applying the cell Green identity [F2] to the two restrictions, with all other cell traces zero, yields The two cell trace classes in this equation restrict to the same on and vanish on the other facets. Since this holds for every such , the two outward weak normal traces cancel as distributions on the relative interior of each interior facet. This is the conservative facet relation for a global H(div) lift; it uses the distributional divergence identity and weak Green formula, not pointwise normal values.
For a closed subspace of a Hilbert space, a distance-minimizing sequence is Cauchy by the parallelogram identity; its limit is nearest, and variation along makes the residual orthogonal. Thus and is isometric to . Applying this to both kernels in step 1.1 proves the quotient ranges are Hilbert with their infimum norms.
Global lifts restrict to broken lifts; conversely the admissible broken extensions in the Statement are exactly those gluing to a global lift, so the two infima have the same set. Cell scalar traces are bounded by [F3] and those of a global H1 lift match across interior facets by [F4]; normal traces of a global H(div) lift satisfy the cancellation proved in step 1.2. Thus range membership is precisely the stated compatibility, with the global lift infimum norms.
Exact DPG stability does not certify quadrature or algebraic solve errors
Statement
The Fortin, boundedness, and Riesz arguments use exact integrals and exact finite solves; they imply no quadrature or floating-point perturbation estimate. For full-column-rank real with , .
Facts & Assumptions
Given: The exact finite Riesz algorithm and a full-column-rank real matrix with .
The practical-test algorithm specifies exact integrals and solves. (Exact local finite Riesz solves for practical DPG tests)
For a full-column-rank real matrix with , the normal-equation condition number is squared. (For full-column-rank A, the normal equations square the spectral condition number)
Proof
Perturbations and rounded arithmetic are absent from [F1], so it supplies no error estimate for them.
Under the stated size and rank hypotheses, [F2] gives the displayed identity; this is a conditioning statement, not a solver-specific error bound.
The ultraweak Poisson DPG bilinear form is bounded
Statement
Assume Countable Choice. On the real trial and broken graph-test spaces of Ultraweak Poisson DPG spaces and plan-consistent bilinear form, is bounded by , uniformly in mesh size.
Facts & Assumptions
Given: Product graph and skeleton quotient norms.
Countable Choice is declared for trace duality. (The Axiom of Countable Choice ())
The five form terms and signs are fixed by the DPG definition. (Ultraweak Poisson DPG spaces and plan-consistent bilinear form)
Skeleton norms are global lift infima. (Ultraweak Poisson skeleton spaces are Hilbert trace quotients)
Weak normal trace is bounded in H(div). (Weak normal trace by Green duality)
Proof
Cauchy–Schwarz bounds the three volume pairings in [F1] by the trial/test product norms.
Lift to global H1_0 and use [F3] on . Lift to global H(div) and use cell Green identities on broken . Cauchy–Schwarz across cells and infimizing by [F2] bound each skeleton term by the same product.
Each of five terms is bounded by the product norm by steps 1.1 and 2.1, so the triangle inequality gives constant , independent of the mesh.
The ultraweak Poisson trial operator has trivial kernel
Statement
Assume Countable Choice. In the spaces of Ultraweak Poisson DPG spaces and plan-consistent bilinear form, if for every broken test on a bounded connected Lipschitz domain, then .
Facts & Assumptions
Given: The DPG spaces, Countable Choice, and the zero pairing hypothesis.
Countable Choice is declared for Sobolev traces. (The Axiom of Countable Choice ())
The form separates broken tests and fixes global trace ranges. (Ultraweak Poisson DPG spaces and plan-consistent bilinear form)
Compatible traces are traces of global H1_0 and H(div) fields. (Ultraweak Poisson skeleton spaces are Hilbert trace quotients)
Cell normal traces satisfy Green’s identity. (Weak normal trace by Green duality)
The weak normal trace surjects onto the dual of the scalar trace quotient, so these functionals separate scalar trace classes. (Weak H(div) normal trace surjects onto the scalar trace dual)
Sobolev first derivatives and divergence are defined distributionally, and H1_0 is the H1 closure of compactly supported smooth functions. (The real H(div) space, Integer-order Sobolev spaces and their norms, Zero-boundary Sobolev space as a norm closure)
Homogeneous Dirichlet Poincare holds. (A bounded-domain Poincare inequality for H1-zero fields)
Proof
Compactly supported vector tests on each cell give distributionally; compactly supported scalar tests give . Thus , , and both identities hold cellwise.
With , the first local equation and [F3] give for every . Surjectivity [F4] makes the scalar trace classes equal. The second local equation gives for every , so those normal-trace functionals are equal as well.
Take a global H1_0 lift of . On each cell, has zero scalar trace, hence belongs to ; zero-extending compactly supported approximants and summing over the finite mesh shows , so . Take a global H(div) lift of . The cell field has zero weak normal trace on every cell. Summing its local Green identities against restrictions of shows its piecewise divergence is its global distributional divergence; thus it glues to H(div), and . Now and ; the weak Green identity tested with gives . By [F6], , then and both trace components vanish.
The RT0/P1 least-squares family is conforming
Statement
Assume Countable Choice. The finite-mesh family from First-order least-squares formulation of the Dirichlet Poisson problem is a finite-dimensional subspace of .
Facts & Assumptions
Given: A finite conforming triangular mesh.
Countable Choice is inherited by Sobolev interfaces. (The Axiom of Countable Choice ())
The RT0/P1 trial factors and boundary condition are fixed by the definition. (First-order least-squares formulation of the Dirichlet Poisson problem)
Matching RT0 facet fluxes imply global H(div) conformity. (RT0 facet-flux unisolvence and global H(div) conformity)
Global H1 traces agree across interior facets. (H1 traces agree across interior mesh facets)
Proof
Local RT0 fields and their divergences are polynomials; shared normal flux degrees of freedom agree by [F2]. Their global distributional divergence is therefore the piecewise divergence, so the flux factor lies in H(div).
The scalar factor is globally continuous piecewise affine and has H1_0 boundary condition; [F3] gives the interior trace convention. The finite mesh has finitely many polynomial coefficients, so the product space is finite dimensional.
A uniformly bounded Fortin map for the practical P1/R3 DPG family
Statement
Assume Countable Choice. For trials , continuous trace and normal trace on a shape-regular triangular mesh, there is an element-local Fortin map into . It has a mesh-independent broken graph bound, preserves the scalar cell mean, satisfies , and for all discrete trial tuples and broken tests.
Facts & Assumptions
Given: The stated polynomial trial/test spaces and Countable Choice.
Countable Choice is declared for Sobolev traces. (The Axiom of Countable Choice ())
The DPG form and trial moments are fixed by its definition. (Ultraweak Poisson DPG spaces and plan-consistent bilinear form)
Skeleton norms are global quotient lift norms. (Ultraweak Poisson skeleton spaces are Hilbert trace quotients)
The RT polynomial families are . (Affine simplicial meshes and RT/BDM spaces)
The weak H(div) normal trace is continuous. (Weak normal trace by Green duality)
H1 facet trace is bounded. (H1 facet trace inequality on shape-regular simplices)
Shape-regular affine simplex scaling is uniform. (Shape regularity controls affine simplex geometry)
A mean-zero H1 function on the reference simplex satisfies the Poincare–Wirtinger inequality. (Poincare–Wirtinger inequality on a reference simplex)
The contravariant Piola map sends bijectively between affine simplices; for weak H(div) fields it preserves the distributional divergence transformation, and affine scalar pullback transforms H1 weak gradients. (Contravariant Piola map, Piola maps RT and BDM polynomial families onto the physical cell, Affine Piola maps commute with differential operators and preserve moments)
Cell weak normal traces are the Green functionals on and satisfy the graph-norm bound. (Weak normal trace by Green duality)
Proof
On the reference triangle has dimension . Define by matching one cell mean and two edge moments on each edge. In the homogeneous system an edge restriction is ; testing against forces its weighted square integral to vanish. Each edge restriction is zero, leaving , whose mean forces . Hence the seven scalar moments are unisolvent.
On the reference triangle has dimension . Its normal trace map is onto broken P2: for an edge opposite vertex , extend any polynomially in the other two barycentric coordinates and set , where is the altitude to . This vector is tangent to the other two edges and has normal trace on ; it lies in because its cubic part is times a homogeneous degree-two polynomial and its remaining terms lie in . Thus the broken normal trace image has dimension . Let be its inverse image of continuous P2 boundary traces, a -dimensional subspace. Define by matching six volume moments against and six continuous boundary P2 normal moments. In the homogeneous system the normal trace is continuous P2 and orthogonal to itself, hence zero. Green’s identity and then give ; its homogeneous cubic part has divergence , so . Write : explicitly, for polynomial use . The identity gives and , and . Zero normal trace makes constant on each edge; vertex continuity makes these constants equal. After subtracting the common constant, . The volume moment against is by Green’s identity and , so . Thus the 12 moments are unisolvent.
On the reference triangle set ; for a physical cell let be its orientation-preserving affine map and define . Affine change of variables preserves the cell mean and, since each edge Jacobian is constant, the edge moments. The bounded inverse reference moment matrix, [F5], mean-zero Poincare–Wirtinger [F7], and shape scaling [F6] yield and .
Let , , and . Applying [F8] to the affine inverse shows with the transformed divergence. Define the physical projection by . For every , by [F8], and the weak Green functional, affine weak-derivative/divergence transformations, and change of variables give The volume moments also transport: for , affine change of variables gives and the same identity with replaced by ; hence every physical volume moment is matched. This derives the weak normal-trace transport for arbitrary inputs; it does not infer it from the smooth-field flux identity. Each continuous boundary function on a triangle is the trace of a polynomial in (the six vertex and edge-midpoint values determine that polynomial), so the identity transports exactly the six boundary moments used in step 1.2. By [F8], the Piola-conjugated reference projection lands in . Its reference moment vector is bounded by : volume moments are controlled by , and boundary moments by [F9] and the fixed polynomial trace norms. The unisolvent reference moment matrix therefore gives . In dimension two, [F6] implies and , while and . Since on the fixed bounded domain, Piola scaling gives . Finally, for every , Green’s formula, the matched volume moments against , and the matched continuous boundary moments imply . Thus and its norm is at most . This proves the uniform broken H(div) graph bound.
Vector moments match , and the divergence projection from step 2.2 matches . The continuous boundary moments match , while the scalar edge moments match . For the remaining volume term, put and integrate by parts: pairs to zero with by cell-mean preservation, and pairs to zero with on each edge by the scalar edge moments. Hence every term of [F1] vanishes locally, and summing gives . The cell bounds add in broken graph norms.
Ideal Poisson DPG trial-to-test Riesz map
Definition
Input: A real trial vector .
Output: The ideal test vector .
Admissible conditions: and are the real Hilbert spaces in Ultraweak Poisson DPG spaces and plan-consistent bilinear form, and is the bounded real bilinear form on them, with boundedness supplied by The ultraweak Poisson DPG bilinear form is bounded. The definition uses exact Hilbert-space operations and makes no claim of practical computability.
Instructions: Form the bounded linear functional on . Apply the Hilbert-space Riesz representation procedure to obtain the unique satisfying
and return . For a finite-dimensional trial subspace , the ideal test space is .
The conforming RT0/P1 least-squares Poisson minimizer is unique and best approximating
Statement
Assume the Axiom of Choice and Countable Choice required by the weak Poisson supplier. Let on a bounded connected Lipschitz polygon, and let be the unique weak Dirichlet solution. The exact functional has a unique minimizer in the conforming RT0/P1 family, and that minimizer is the orthogonal best approximation in the residual inner product. Its scalar component remains in .
Facts & Assumptions
Given: The exact weak Poisson solution, the finite conforming RT0/P1 family, AC and CC.
The weak Poisson existence supplier assumes AC and CC and gives a unique solution for bounded-domain data. (The Axiom of Choice, The Axiom of Countable Choice (), Existence and uniqueness for the weak Dirichlet Poisson problem)
The trial family is a finite-dimensional subspace of . (The RT0/P1 least-squares family is conforming)
The residual map is injective and its norm is equivalent to the product graph norm. (Least-squares residual norm is equivalent to H(div) x H1_0 error)
The residual is with the stated homogeneous boundary condition. (First-order least-squares formulation of the Dirichlet Poisson problem)
Proof
The weak solution supplier in [A1] applies because a bounded polygon is open and bounded in one direction, and is bounded on by Cauchy–Schwarz and Poincare. It gives ; the distributional equation gives and .
For any in the trial family, the residual of its difference from equals by [F3]. Thus . By [F2], is an inner product on the ambient error space.
By Gram–Schmidt choose an orthonormal basis of , and define . Then is orthogonal to every , so uniquely minimizes distance to by Pythagoras. The finite-dimensional image is closed; injectivity in [F2] pulls back to a unique minimizer and the same identity gives best approximation. The scalar component stays in the stated H1_0 trial factor.
A topology-free bounded lifting of every ultraweak Poisson load
Statement
Assume Countable Choice and the real spaces and signs of Ultraweak Poisson DPG spaces and plan-consistent bilinear form. For every bounded connected Lipschitz polyhedron , , and every finite conforming shape-regular simplicial mesh, give the squared product norm from its two factors and two global trace lift-infimum norms, and give its full broken graph norm. Define by . There is a bounded linear map such that and . Choose any with for , put , and set The constant is independent of the mesh. No simple-connectivity or connected-boundary hypothesis is imposed.
Facts & Assumptions
Given: Countable Choice, the stated domain and mesh, the real ultraweak spaces and bilinear form, a Poincaré constant , and an arbitrary .
Countable Choice is the stated axiom for the real Hilbert, Riesz, trace and Lax–Milgram interfaces. (The Axiom of Countable Choice ())
The formulation fixes the real product spaces, the global trace ranges with lift-infimum norms, and all five signs in . (Ultraweak Poisson DPG spaces and plan-consistent bilinear form, Ultraweak Poisson skeleton spaces are Hilbert trace quotients)
The finite broken products of and are real Hilbert spaces, and is a real Hilbert space with its restricted inner product. (H(div) is Hilbert and H0(div) is closed, The Sobolev space is a Hilbert space)
On a real Hilbert space, Riesz represents every bounded linear functional by a unique vector and preserves its norm. (Riesz representation for Hilbert spaces)
A bounded coercive real bilinear form on a real Hilbert space has a unique solution for every bounded linear right-hand side under Countable Choice. (The Lax--Milgram theorem)
For bounded open , homogeneous Dirichlet Poincaré gives on ; a coordinate-slab width supplies such a constant. (A bounded-domain Poincare inequality for H1-zero fields)
The weak normal trace of a global field is defined by the cell Green functional, and an vector with distributional divergence belongs to . (Weak normal trace by Green duality, The real H(div) space)
The DPG form is bounded on the full trial and broken-test spaces by , so is a well-defined bounded element of for every . (The ultraweak Poisson DPG bilinear form is bounded)
Proof
By [F7], given by is well defined and bounded. By [F2] and [F3], there is a unique such that Set , , , and , viewed as global classes by the finite mesh partition. If , then .
On use the form . It is bounded in the norm, and [F5] gives . The functional is bounded, since its absolute value is at most . Thus [F4] gives a unique satisfying Testing with and using Cauchy–Schwarz yields , including the case ; hence .
Set , , and . For every , step 2.1 gives , so distributionally and . Set and , using the elementwise scalar and weak normal traces. Since and is one global field, these traces lie in the exact global ranges of [F1], with homogeneous scalar boundary trace and conservative normal trace. Define .
Cell Green identities give and . Substitution into the five signed terms of the form gives Therefore .
From steps 1.1–3.1, , , , and , since and . Adding the four squared product components gives . Riesz and the unique weak solve depend linearly on (a linear combination solves the combined variational equation, and uniqueness identifies it), and the remaining field and trace maps are linear; hence is linear. Only enters the bound, so it is mesh-independent.
Fortin stability and quasi-optimality for practical DPG
Statement
Assume Countable Choice and the real form and spaces of Ultraweak Poisson DPG spaces and plan-consistent bilinear form on a finite conforming triangular mesh. For every admissible local input to Exact local finite Riesz solves for practical DPG tests, the exact factorization terminates after scalar arithmetic operations once its Gram entries and right-hand side are formed; it returns singular-test-matrix exactly for a dependent input family, and on an independent family it returns the unique finite Riesz representative. Let consist of volume fields , , continuous scalar traces , and conservative normal traces . This is finite-dimensional. Let , presented cellwise by fixed ordered bases, and let be the assembled finite Riesz map. On each fixed basis the unique local Riesz representatives assemble to a bounded linear map satisfying . Now assume the continuous primal and adjoint graph inf-sup constants have minimum . Let be the bounded Fortin map of A uniformly bounded Fortin map for the practical P1/R3 DPG family, with and . Then for every bounded load , the practical DPG system tested with has a unique solution , and
where is the exact continuous solution.
Facts & Assumptions
Given: Countable Choice, the real DPG form and spaces on a finite triangular mesh, admissible local finite-Riesz inputs, the stated P1/R3 trial and test spaces, the two continuous inf-sup hypotheses, and the specified Fortin map.
Countable Choice is used by the mixed BNB solve. (The Axiom of Countable Choice ())
The DPG spaces and bilinear form are those of the ultraweak definition. (Ultraweak Poisson DPG spaces and plan-consistent bilinear form)
The continuous form is bounded. (The ultraweak Poisson DPG bilinear form is bounded)
The practical Fortin map is bounded and preserves the form on . (A uniformly bounded Fortin map for the practical P1/R3 DPG family)
The BNB theorem gives a unique mixed solution when the constraint inf-sup holds and the first form is coercive on its kernel. (Babuska-Brezzi solvability by kernel coercivity and inf-sup)
Riesz represents the bounded form and datum on the real Hilbert trial and test spaces; the adjoint operator is the Hilbert adjoint. (Riesz representation for Hilbert spaces)
The practical test map is the finite Riesz representative in the broken polynomial test space. (Exact local finite Riesz solves for practical DPG tests)
The trial and test Hilbert factors are complete: real L2 and H1 are Hilbert, H(div) is Hilbert, and the trace quotient factors are Hilbert. Finite products preserve completeness. ( with the integral pairing is a Hilbert space, The Sobolev space is a Hilbert space, H(div) is Hilbert and H0(div) is closed, Ultraweak Poisson skeleton spaces are Hilbert trace quotients)
Proof
On an arbitrary local input family, its Gram matrix is positive semidefinite. As long as the preceding vectors are independent, the next unpivoted pivot is the squared norm of that vector's residual after orthogonal projection onto their span; this follows by solving the preceding Gram equations. Hence every pivot is positive exactly while the vectors remain independent, and the first dependent vector gives a zero pivot, so the algorithm returns singular-test-matrix exactly for a dependent family. If the family is independent, the finite loop and triangular solves terminate, the resulting coefficients solve , and the returned vector is therefore the unique finite Riesz representative. The factorization and solves use exact scalar operations after entry formation. For each cell this representative satisfies ; summing over cells gives for every . For the fixed bases of , local uniqueness and linearity of show that the assembled is linear. Its Riesz identity and [F2] give .
By [F7], are real Hilbert spaces; boundedness [F2] and Riesz [F5] define by . The primal inf-sup gives , so is injective and its range is closed: if converges, the lower bound makes Cauchy, and its limit maps to the range limit. The adjoint inf-sup gives , so . By the defining adjoint identity, iff for every , iff for every , iff . Hence , the closed range is dense, and therefore all of . Riesz represents , so it has a unique preimage .
For , the continuous primal bound gives . Fortin orthogonality in [F3] gives and , so the restricted inf-sup on is at least .
On , put and . The first form is coercive on all of , and [F4]’s constraint inf-sup is by step 1.3. Applying [F4] with datum and zero constraint gives a unique pair with and . The first equation makes the Riesz representative of the restricted residual; the second is orthogonality to , exactly the practical DPG equations by [F6].
Give the inner product transported from by its Riesz map. The second mixed equation makes orthogonal to every in this inner product. For any , , so Pythagoras gives . Apply the discrete inf-sup to , then the triangle inequality and infimize over to obtain the displayed estimate.
Adjoint graph inf-sup for ultraweak Poisson on connected Lipschitz polyhedra
Statement
Assume Countable Choice. For every bounded connected Lipschitz polyhedron , , and every finite conforming shape-regular simplicial mesh, give its /global-quotient product norm and the full broken graph norm of Ultraweak Poisson DPG spaces and plan-consistent bilinear form. With from A topology-free bounded lifting of every ultraweak Poisson load, the primal and adjoint bounds are Both constants are independent of the mesh. The bounded operator and its Riesz trial-to-test map are boundedly invertible, with inverse norms at most . No simple-connectivity or connected-boundary hypothesis is required; connected polyhedra with holes are included.
Facts & Assumptions
Given: Countable Choice, the stated connected Lipschitz polyhedron and finite mesh, and the exact real trial/test norms and bilinear form.
Countable Choice is the hypothesis for the Hilbert and Riesz interfaces used below. (The Axiom of Countable Choice ())
The product trial and broken test spaces are real Hilbert spaces: their factors, global trace quotient ranges, factors and factors have the stated real Hilbert structures. ( with the integral pairing is a Hilbert space, Ultraweak Poisson skeleton spaces are Hilbert trace quotients, H(div) is Hilbert and H0(div) is closed, The Sobolev space is a Hilbert space)
The real bilinear form defines a bounded operator with . (The ultraweak Poisson DPG bilinear form is bounded)
The trial operator has trivial kernel: implies . (The ultraweak Poisson trial operator has trivial kernel)
There is a linear with and . (A topology-free bounded lifting of every ultraweak Poisson load)
The real Hilbert Riesz map is an isometric linear bijection. (Riesz representation for Hilbert spaces)
The formulation fixes the five signs of , the real trial/test spaces and the full broken graph norm. (Ultraweak Poisson DPG spaces and plan-consistent bilinear form)
Proof
The bounded form [F2] defines , and [F4] makes onto. By [F3], is injective. For each , , so injectivity gives . Therefore , , and the dual norm identity gives the primal bound.
For , set and . Then , so , while [F4] and [F5] give . Since , , and this proves the adjoint bound; for the bound is immediate.
Define . By [F2], . Since , and [F4] and [F5] give . The lifting constant depends only on a fixed-domain Poincaré constant, so both graph inf-sup bounds are uniform over the stated mesh family; the construction uses no simple-connectivity or connected-boundary condition.
Ideal ultraweak Poisson DPG is the energy best approximation
Statement
Assume Countable Choice and the real trial/test spaces and bilinear form of Ultraweak Poisson DPG spaces and plan-consistent bilinear form, with as in The ultraweak Poisson DPG bilinear form is bounded. The ideal trial-to-test map of Ideal Poisson DPG trial-to-test Riesz map is well defined, bounded linear, and satisfies . Let be any exact ultraweak solution and let be finite dimensional. The ideal DPG equations with test space have a unique solution , which is the orthogonal projection of in the induced energy inner product . Consequently .
Facts & Assumptions
Given: Countable Choice, the real Hilbert trial/test spaces and bounded bilinear form, an exact solution , and a finite-dimensional .
Countable Choice is declared for Hilbert Riesz maps. (The Axiom of Countable Choice ())
The trial operator has trivial kernel. (The ultraweak Poisson trial operator has trivial kernel)
The ideal procedure defines as the Riesz representative of . (Ideal Poisson DPG trial-to-test Riesz map)
Riesz represents bounded real functionals uniquely and identifies each dual norm with the norm of its representative. (Riesz representation for Hilbert spaces)
The DPG bilinear form is bounded by . (The ultraweak Poisson DPG bilinear form is bounded)
Proof
For every , [F4] makes a bounded functional on , and [F3] gives the unique in [F2], with . Bilinearity of and uniqueness of the Riesz representative imply for real scalars , so is bounded linear. By [F1], implies ; hence is a positive-definite inner product. For every , the ideal equation is , by [F2] and exactness.
Choose an orthonormal basis of the finite-dimensional image and define . The equations in step 1.1 identify ; Pythagoras proves it uniquely minimizes distance to that image. Injectivity of gives the unique and the best-approximation identity.
The functional has Riesz representative by [F2]. Therefore [F3] gives .
Practical DPG residual is reliable and efficient up to data oscillation
Statement
Assume Countable Choice. Assume the continuous trial-to-test operator is boundedly invertible with lower inf-sup constant , and let be the bounded Fortin map with . For any exact solution and any , define the practical residual estimator and Fortin data oscillation . Then For the stated P1/R3 Poisson Fortin map, , where ; it vanishes for cellwise constant .
Facts & Assumptions
Given: The continuous inf-sup bound, the bounded Fortin map, Countable Choice, and an arbitrary discrete approximation.
Countable Choice is declared for Hilbert Riesz representation. (The Axiom of Countable Choice ())
The DPG trial/test spaces and load functional are fixed by the formulation. (Ultraweak Poisson DPG spaces and plan-consistent bilinear form)
The practical Fortin map preserves the trial form and has the local mean-preserving approximation bound. (A uniformly bounded Fortin map for the practical P1/R3 DPG family)
The practical quasi-optimality theorem records the continuous inf-sup and boundedness hypotheses used here. (Fortin stability and quasi-optimality for practical DPG)
Hilbert Riesz gives unique representatives of bounded linear functionals and identifies their dual norms with the norms of those representatives. (Riesz representation for Hilbert spaces)
Proof
Let and let represent by Riesz. Choose an orthonormal basis of the finite-dimensional polynomial space and set . Then is orthogonal to , , and . Continuous inf-sup gives .
Riesz gives . For any , Fortin orthogonality gives ; take the dual norm and infimum to obtain the oscillation approximation bound.
Since , . Substitute for ; Fortin orthogonality kills , leaving . Hence . Combine with step 1.1 to get the reliability inequality.
For the Poisson load, mean preservation gives , so . By [F2], each difference is bounded by . Cauchy–Schwarz over cells yields the stated data oscillation; it is zero if every .
P1/R3 practical DPG quasi-optimality and residual estimator for Poisson
Statement
Assume Countable Choice. Let be any bounded connected Lipschitz polygon, including polygons with holes, and let be any finite conforming shape-regular triangular mesh. Use the exact two-dimensional P1/R3 practical family selected in PE30: volume fields and ; compatible global scalar traces of degree at most two on facets, zero on boundary facets; conservative global normal traces of degree at most one; and broken tests , with the graph inner product inherited from . The local Fortin projection is that of A uniformly bounded Fortin map for the practical P1/R3 DPG family, and is its operator norm bound. For each , the continuous ultraweak solution and practical solution exist uniquely, with For every , put , where is the dual of with its induced norm, and . Then and where and is the cellwise constant from the Fortin map's mean-preserving local estimate. The constants , , and are independent of mesh size for the fixed domain and shape-regular family. The practical corollary is two-dimensional; the continuous graph theorem also covers dimension three.
Facts & Assumptions
Given: Countable Choice, a bounded connected Lipschitz polygon, a finite conforming shape-regular triangular mesh, and .
Countable Choice is the hypothesis for the cited Hilbert and Riesz interfaces. (The Axiom of Countable Choice ())
The continuous graph theorem gives bounded invertibility and primal and adjoint inf-sup constants at least on every connected Lipschitz polygon, with no simple-connectivity assumption. (Adjoint graph inf-sup for ultraweak Poisson on connected Lipschitz polyhedra)
The local P1/R3 Fortin map applies on shape-regular triangular meshes, has , preserves scalar cell means, and satisfies the local approximation bound. (A uniformly bounded Fortin map for the practical P1/R3 DPG family)
The DPG bilinear form is bounded with . (The ultraweak Poisson DPG bilinear form is bounded)
The conditional practical-DPG theorem gives a unique discrete solution and quasi-optimality under the stated continuous inf-sup and Fortin hypotheses. (Fortin stability and quasi-optimality for practical DPG)
The conditional residual theorem gives reliability, efficiency and the Fortin data-oscillation estimate under the same hypotheses. (Practical DPG residual is reliable and efficient up to data oscillation)
The load is , the test norm includes , and the scalar skeleton trace is the trace of a global field. (Ultraweak Poisson DPG spaces and plan-consistent bilinear form)
Proof
Since , [F1] gives the unique continuous solution . The mesh and discrete spaces satisfy [F2] exactly: the dimension is two, the mesh is triangular, and the compatible scalar trace vanishes on boundary facets. Apply [F4] with ; using [F3] in its quasi-optimal constant gives the stated unique practical solution and factor . For , both solutions are zero by these uniqueness conclusions.
For any , apply [F5] with the same and Fortin map [F2]. Its reliability and efficiency inequalities give
For , cell-mean preservation gives , hence The local approximation bound in [F2] and Cauchy–Schwarz over cells give the displayed estimate. In particular the oscillation is zero when is cellwise constant. All constants depend on the fixed domain, polynomial degrees and mesh shape regularity, not on ; the graph proof makes no topological restriction, while this Fortin family is only the dimension-two branch.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Jay Gopalakrishnan and Weifeng Qiu, An analysis of the practical DPG method
- Leszek Demkowicz and Jay Gopalakrishnan, Analysis of the DPG method for the Poisson equation
- Leszek Demkowicz, Mathematical Theory of Finite Elements
- C. Carstensen, L. Demkowicz, and J. Gopalakrishnan, A Posteriori Error Control for DPG Methods
- Peter Bochev and Max Gunzburger, Least-squares finite element methods
- J. Bond, R. Chaudhry, L. Cyr, and L. Olson, A First-Order System Least-Squares Finite Element Method for the Poisson-Boltzmann Equation
- J. Bond et al., A First-Order System Least-Squares Finite Element Method for the Poisson-Boltzmann Equation
- Carstensen, Demkowicz, and Gopalakrishnan, A Posteriori Error Control for DPG Methods