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 — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- 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
- 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
- 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
- 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-element meshes and interpolation
- First-order least-squares FEM and practical DPG
- 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
- Harmonic Functions and Mean Values in Rn
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- 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 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
- 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
- Simple Field Extensions and the Construction of the Complex Numbers
- Smooth Approximation and Sobolev Extension
- Smooth Manifolds and Smooth Maps
- Smooth Partitions of Unity and Exhaustions
- Sobolev Poincare and Morrey Inequalities
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tangent Cotangent and the Differential
- The Analytic Hahn Banach Theorem
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The 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 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
These examples check the boundary and stability caveats. If the homogeneous Dirichlet condition is dropped, constants give distinct zero-residual states for zero data. If the practical test space has smaller dimension than its trial space, the restricted Riesz map has a kernel and unique solvability cannot be guaranteed.
The finite-dimensional DPG calculation compares ideal and practical trial-to-test vectors for the nonsymmetric matrix . It yields coefficients and under the same load, so the practical method need not reproduce the ideal test vector.
On the unit square with a two-triangle conforming mesh, , , and give an exact least-squares residual certificate: the scalar vanishes on the boundary, the first residual is zero by construction, and .
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
Dropping the H1-zero boundary condition makes least squares nonunique
Statement
If zero boundary values are removed from the continuous first-order Poisson least-squares problem with zero load, every constant scalar with has zero residual; hence the unconstrained minimizer is not unique.
Facts & Assumptions
Given: The least-squares residual convention and .
The residual is and the intended scalar space is . (First-order least-squares formulation of the Dirichlet Poisson problem)
Proof
Fix any and set , , . Then and , so both residual components in [F1] vanish.
Distinct constants give distinct H1 functions, and every one has objective zero, the minimum of a sum of squares. They are all admissible after the stated replacement of H1_0 by H1, so the unconstrained minimizer is not unique.
An exact polynomial Poisson solution has a zero residual certificate
Statement
Assume Countable Choice. On with its two-triangle diagonal mesh, let , , and . Then , , , and , so the continuous least-squares residual is zero.
Facts & Assumptions
Given: The square domain and the polynomial fields in the Statement.
The first-order Poisson residual and boundary convention. (First-order least-squares formulation of the Dirichlet Poisson problem)
Countable Choice is declared by the zero-boundary polynomial density supplier. (The Axiom of Countable Choice ())
A conforming piecewise polynomial with zero boundary traces on a finite matching mesh belongs to . (Zero-boundary conforming polynomials lie in W0 1p and satisfy Poincare)
is the closure of compactly supported smooth functions. (Zero-boundary Sobolev space as a norm closure)
H(div) consists of L2 vector fields with L2 distributional divergence. (The real H(div) space)
Proof
The factor vanishes on all four edges. Differentiating gives , so is polynomial and [F2] gives . For every , integration by parts gives ; both sides are continuous in the H1 norm, so [F3] extends the identity to every . Thus is the weak Dirichlet solution. Also and are polynomials in , so [F4] gives .
By definition and , so both components in [F1] vanish pointwise. The objective is nonnegative and therefore this exact zero residual is a global least-squares minimum.
A smaller constant test space gives a nontrivial practical DPG kernel
Statement
On one triangle, take a four-dimensional trial subspace of and the three-dimensional constant test space . The practical trial-to-test map has a nontrivial kernel, so the normal equations cannot have a unique trial solution for any load for which a solution exists.
Facts & Assumptions
Given: A nondegenerate triangle, the ultraweak form, and the finite Riesz construction.
The cell trial/test form and polynomial setting are specified in the DPG formulation. (Ultraweak Poisson DPG spaces and plan-consistent bilinear form)
The practical trial-to-test map is the finite Riesz representative. (Exact local finite Riesz solves for practical DPG tests)
Proof
Choose in the vector/scalar volume trial variables; these four fields are linearly independent as pairs. The constant test space has dimension .
In a fixed basis of the constant test space, the Gram matrix is positive definite, and [F2] returns in that basis. The right-hand side is linear in , so the restricted practical trial-to-test map is linear from the four-dimensional trial subspace into the three-dimensional test space. The images of four independent basis vectors are therefore linearly dependent; the corresponding nonzero coefficient vector is in the kernel. The normal matrix is , so this vector has zero quadratic energy; if a solution exists, adding any multiple produces another trial solution.
An explicit finite model separates ideal and practical test vectors
Statement
Let with Euclidean inner product, , , , practical test space , and load . Then , , and ideal and practical trial coefficients are and .
Facts & Assumptions
Given: The stated finite-dimensional trial/test data.
In this finite model, define by for every ; existence and uniqueness follow from finite-dimensional Riesz representation. (Finite-dimensional Riesz representation: every functional is uniquely )
Define by for every ; finite-dimensional Riesz representation again gives existence and uniqueness. (Finite-dimensional Riesz representation: every functional is uniquely )
Finite-dimensional Riesz systems have unique representatives. (Finite-dimensional Riesz representation: every functional is uniquely )
Proof
, so for every , and [F1] gives . For every , , so [F2] gives .
For ideal coefficient , the equation is , hence and . For practical tests it is , hence . Uniqueness follows from the positive Gram scalars and in [F3].
Remarks
The Euclidean Riesz maps defined here give a finite-dimensional analogue of Ideal Poisson DPG trial-to-test Riesz map and Exact local finite Riesz solves for practical DPG tests.
Sources
- Peter Bochev and Max Gunzburger, Least-squares finite element methods
- J. Bond et al., A First-Order System Least-Squares Finite Element Method for the Poisson-Boltzmann Equation
- 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
- Carstensen, Demkowicz, and Gopalakrishnan, A Posteriori Error Control for DPG Methods