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.
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.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
31 results within two dependency steps 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
- Peter Bochev and Max Gunzburger, Least-squares finite element methods (standard reference, not scraped)
- J. Bond et al., A First-Order System Least-Squares Finite Element Method for the Poisson-Boltzmann Equation (standard reference, not scraped)