Alphabeta Math
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.

✓ 16 results · all verified · 11 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 5 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

First-order least-squares FEM and practical DPG

1 · Prerequisites

2 · Summary

This page fixes the PE30 plan-spec sign convention for the first-order Poisson system: σ=−∇u, div⁡σ=f, and residual (σ+∇u,div⁡σ−f). 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 H(div⁡), and the scalar lies in H01. 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 R(a,b)=(−b,a) carries the H(div) normal trace to the H(curl) tangential trace. The edge convention is t=Rn 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 L2(K). 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 (σ,u,u^,σ^n) in L2×L2 and compatible global scalar/normal trace quotient ranges. Tests are broken H(div⁡)×H1 with graph norm. The local form is b(x;τ,v)=(σ,τ)−(u,div⁡hτ)+⟨u^,τ⋅n⟩−(σ,∇hv)+⟨σ^n,v⟩, with each normal outward from its cell and right-hand side (f,v) for f∈L2(Ω;R). 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 F∈V′, the bounded-load lifting uses one global H01 Lax–Milgram solve and actual global scalar and normal traces to construct RF∈U with BRF=F. 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 LDLT 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 L2 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

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Planar rotation carries H(div) normal traces to tangential traces

Statement

Assume Countable Choice. For a nondegenerate oriented triangle K⊂R2, set R(a,b)=(−b,a), let n be cell-outward and t=Rn. If σ∈H(div⁡;K) is real, then Rσ∈H(curl⁡;K), curl⁡(Rσ)=div⁡σ distributionally, and ∫K(Rσ⋅R∇ϕ+curl⁡(Rσ)ϕ)=⟨γnσ,[ϕ]⟩ for all ϕ∈H1(K). Thus weak tangential trace equals weak normal trace under t=Rn.

Here H(curl⁡;K):={w∈L2(K;R2):∂1w2−∂2w1∈L2(K)} with its graph norm. The weak tangential trace is the functional on H1(K)/H01(K) 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 σ∈H(div⁡;K).

[A1]

Countable Choice is declared for trace interfaces. (The Axiom of Countable Choice (ACω))

[F1]

H(div) consists of real L2 vectors with L2 distributional divergence. (The real H(div) space)

[F2]

The weak normal trace acts by ∫K(σ⋅∇ϕ+div⁡σ ϕ). (Weak normal trace by Green duality)

Proof

1.1givenF1algebra

Writing Rσ=(−σ2,σ1) gives curl⁡(Rσ)=∂1σ1+∂2σ2=div⁡σ as distributions; [F1] places it in L2.

2.1A1F2step 1.1algebra∎

Orthogonality gives Rσ⋅R∇ϕ=σ⋅∇ϕ, so step 1.1 makes the trace integral exactly [F2]. Also Rσ⋅t=Rσ⋅Rn=σ⋅n.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

First-order least-squares formulation of the Dirichlet Poisson problem

Definition

Assume Countable Choice. Let Ω⊂R2 be bounded connected Lipschitz and f∈L2(Ω;R). Solve −Δu=f, u∈H01(Ω); set σ=−∇u, so div⁡σ=f. For a finite conforming shape-regular triangular mesh, define Xh=RT0(Th)×(P1(Th)∩H01(Ω)) and Jh(σh,uh)=∥σh+∇uh∥22+∥div⁡σh−f∥22. Here RT0(K)=P0(K)2+xP0(K) and P1 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.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Ultraweak Poisson DPG spaces and plan-consistent bilinear form

Definition

Assume Countable Choice. Let d=2 or 3, Ω⊂Rd bounded connected Lipschitz polyhedral and Th a finite conforming shape-regular simplicial partition; all fields are real. For a load f∈L2(Ω;R), put H(div,Th)=∏KH(div;K) and H1(Th)=∏KH1(K), with squared broken graph norm ∑K(∥τ∥22+∥divτ∥22+∥v∥22+∥∇v∥22). Let U^ be the elementwise trace range of H01(Ω) and Q^n the elementwise weak normal trace range of H(div;Ω), each with global lift infimum norm; range membership is compatibility and normal traces are conservative across interior facets. Set U=L2(Ω)d×L2(Ω)×U^×Q^n, V=H(div,Th)×H1(Th). For x=(σ,u,u^,σ^n) and y=(τ,v), define b(x,y)=(σ,τ)−(u,divhτ)+⟨u^,τ⋅n⟩−(σ,∇hv)+⟨σ^n,v⟩,Ff(y)=(f,v). Pairings sum over cell boundaries and use the cell-outward normal. The sign convention is σ=−∇u, divσ=f.

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.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Least-squares residual norm is equivalent to H(div) x H1_0 error

Statement

Assume Countable Choice. Let Ω⊂R2 be bounded connected Lipschitz and CP satisfy ∥w∥2≤CP∥∇w∥2 on H01. For z=(δσ,δu)∈H(div)×H01, put Rz=(δσ+∇δu,divδσ). This is injective and its norm is equivalent to the product graph norm. If a=∥R1z∥2, b=∥R2z∥2, g=∥∇δu∥2, then g≤a+CPb, ∥δu∥2≤CP(a+CPb), ∥δσ∥2≤2a+CPb, and ∥Rz∥2≤2∥z∥H(div)×H12.

Facts & Assumptions

Given: Countable Choice, the real spaces and the stated Poincare inequality.

[A1]

Countable Choice is used to choose the H1_0 density sequence in the weak Green passage. (The Axiom of Countable Choice (ACω))

[F1]

Residual components follow the least-squares definition. (First-order least-squares formulation of the Dirichlet Poisson problem)

[F2]

H(div) has L2 distributional divergence and graph norm. (The real H(div) space)

[F3]

Homogeneous Dirichlet Poincare holds. (A bounded-domain Poincare inequality for H1-zero fields)

[F4]

H1_0 is the H1 closure of compactly supported smooth functions. (Zero-boundary Sobolev space as a norm closure)

Proof

1.1A1F2F4algebra

Approximate δu by compactly supported smooth functions. The distributional divergence identity and L2 continuity give (δσ,∇δu)=−(divδσ,δu). Substitute δσ=R1z−∇δu to get g2=(R1z,∇δu)+(R2z,δu).

2.1F3step 1.1algebra

Cauchy–Schwarz and [F3] imply g2≤ag+CPbg. If g>0, divide by g; if g=0, the bound is immediate. Poincare and δσ=R1z−∇δu give the stated component estimates, controlling the product graph norm.

3.1F1F2step 2.1algebra∎

The first residual square is at most 2∥δσ∥22+2∥∇δu∥22 and the second is the divergence component. If Rz=0, step 2.1 and Poincare give δu=0, then δσ=0. This proves reverse boundedness and injectivity.

AlgorithmAlgorithm: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Exact local finite Riesz solves for practical DPG tests

Definition

Inputs: A finite-dimensional real graph-test space presented as Vr(K)=span⁡{v1,…,vN}, an ordered finite generating family (not assumed independent), a trial datum w, the graph inner product (⋅,⋅)V, and the linear functional ℓw(v)=bK(w,v) on Vr(K).

Output: Either a vector in Vr(K) or the status singular-test-matrix.

Admissible conditions: N≥0; all entries are real and exact; ℓw is defined and linear on Vr(K). The Gram entries and functional values are evaluated exactly. No quadrature or rounded solve is part of this procedure.

Instructions:

  1. Form Gij=(vj,vi)V and gi=ℓw(vi) exactly.
  2. Initialize L=IN and compute an unpivoted symmetric LDLT factorization in the listed order. At pivot k, set dk=Gkk−∑j<kLkj2dj. If dk≤0, return singular-test-matrix. Otherwise set Dkk=dk and Lik=Gik−∑j<kLijLkjdjdk(i>k).
  3. Solve Lz=g, Dy=z, and LTc=y exactly, and return ∑j=1Ncjvj. For N=0, return the zero vector of Vr(K).
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

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 D⊂Rd be open; all spaces are real. With TD=H1(D)/H01(D) and its quotient norm, the weak normal trace map γn:H(div⁡;D)⟶TD′,⟨γnτ,[w]⟩=∫D(τ⋅∇w+(div⁡τ)w), is onto. In fact every L∈TD′ has a lift τ∈H(div⁡;D) satisfying γnτ=L and ∥τ∥H(div⁡)≤∥L∥TD′.

Facts & Assumptions

Given: Countable Choice, an open set D, and a bounded real linear functional L on TD.

[A1]

Countable Choice is used by the Sobolev and Hilbert Riesz interfaces. (The Axiom of Countable Choice (ACω))

[F1]

H1(D) consists of real L2 functions with all first distributional derivatives in L2, and H01(D) is the H1 closure of Cc∞(D). (Integer-order Sobolev spaces and their norms, Zero-boundary Sobolev space as a norm closure)

[F2]

Real L2 is complete for its integral inner product. (L2 with the integral pairing is a Hilbert space)

[F3]

Riesz represents each bounded real functional on a Hilbert space by a vector of the same norm. (Riesz representation for Hilbert spaces)

[F4]

For τ∈H(div⁡;D) the weak normal trace is the displayed Green functional on TD. (Weak normal trace by Green duality)

[F5]

H(div⁡;D) requires an L2 vector field and an L2 distributional divergence. (The real H(div) space)

Proof

1.1A1F1F2F3given

The space H1(D) is Hilbert for (z,w)H1=(z,w)L2+(∇z,∇w)L2. Indeed, a Cauchy sequence of functions and their weak derivatives converges componentwise in L2 by [F2]; testing against Cc∞(D) and passing both integrals to the limits shows the derivative limits are the weak derivatives of the function limit. The quotient map q:H1(D)→TD has norm at most one, so Λ(w):=L(qw) is bounded on H1(D) with ∥Λ∥≤∥L∥. By [F3] choose its Riesz representative z∈H1(D), so Λ(w)=(∇z,∇w)+(z,w).

2.1A1F1F2F3F5step 1.1algebra

For every ϕ∈Cc∞(D), qϕ=0 because ϕ∈H01(D); hence 0=Λ(ϕ)=(∇z,∇ϕ)+(z,ϕ). By the distributional definition of divergence, this means div⁡(∇z)=z. Since z∈L2(D) and ∇z∈L2(D)d, [F5] gives τ:=∇z∈H(div⁡;D), with ∥τ∥H(div⁡)2=∥∇z∥22+∥z∥22=∥z∥H12=∥Λ∥2≤∥L∥2.

3.1F3F4step 1.1step 2.1algebra∎

For any [w]∈TD, [F4] and step 2.1 give ⟨γnτ,[w]⟩=(∇z,∇w)+(z,w)=Λ(w)=L([w]). Thus γnτ=L, and step 2.1 gives the claimed norm bound. Since L was arbitrary, γn is onto.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

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 Γ0:H01(Ω)→∏KH1(K)/H01(K) and normal-trace map Γn:H(div;Ω)→∏K(H1(K)/H01(K))′ 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.

[A1]

Countable Choice is declared for trace interfaces. (The Axiom of Countable Choice (ACω))

[F1]

H(div) is Hilbert and its zero-trace subspace is closed. (H(div) is Hilbert and H0(div) is closed)

[F2]

Cell weak normal traces are continuous. (Weak normal trace by Green duality)

[F3]

Cell scalar traces are bounded in H1. (H1 facet trace inequality on shape-regular simplices)

[F4]

Global H1 traces agree on interior facets. (H1 traces agree across interior mesh facets)

[F5]

The formulation fixes the trace ranges and lift norms. (Ultraweak Poisson DPG spaces and plan-consistent bilinear form)

[F6]

Real L2 with its integral inner product is a Hilbert space. (L2 with the integral pairing is a Hilbert space)

[F7]

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)

[F8]

A global H(div) field has an L2 distributional divergence, so for every ϕ∈Cc∞(Ω), ∫Ω(τ⋅∇ϕ+(div⁡τ)ϕ)=0. (The real H(div) space)

Proof

1.1A1F1F2F5F6F7algebra

H1 is complete: completeness of real L2 [F6] gives limits in L2 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 ∥[u∣K]∥H1(K)/H01(K)≤∥u∣K∥H1(K) 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.

1.2F2F8givenconstructalgebra

Let τ∈H(div⁡;Ω) and let an interior facet F=K+∩K− be fixed. For ψ∈Cc∞(relint⁡F), choose a smooth function ϕ∈Cc∞(Ω) supported in a small tubular neighborhood of supp⁡ψ meeting only K+ and K− and having trace ψ on F. The global distributional-divergence identity [F8] gives ∫Ω(τ⋅∇ϕ+(div⁡τ)ϕ)=0. Applying the cell Green identity [F2] to the two restrictions, with all other cell traces zero, yields ⟨γn+,K+(τ∣K+),[ϕ∣K+]⟩+⟨γn−,K−(τ∣K−),[ϕ∣K−]⟩=0. The two cell trace classes in this equation restrict to the same ψ on F 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.

2.1A1F1step 1.1algebra

For a closed subspace M of a Hilbert space, a distance-minimizing sequence is Cauchy by the parallelogram identity; its limit is nearest, and variation along M makes the residual orthogonal. Thus H=M⊕M⊥ and H/M is isometric to M⊥. Applying this to both kernels in step 1.1 proves the quotient ranges are Hilbert with their infimum norms.

3.1F2F3F4F5step 2.1step 1.2algebra∎

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.

RemarkRemark: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

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 A∈Rm×n with m≥n≥1, κ2(ATA)=κ2(A)2.

Facts & Assumptions

Given: The exact finite Riesz algorithm and a full-column-rank real m×n matrix with m≥n≥1.

[F1]

The practical-test algorithm specifies exact integrals and solves. (Exact local finite Riesz solves for practical DPG tests)

[F2]

For a full-column-rank real m×n matrix with m≥n≥1, the normal-equation condition number is squared. (For full-column-rank A, the normal equations square the spectral condition number)

Proof

1.1F1algebra

Perturbations and rounded arithmetic are absent from [F1], so it supplies no error estimate for them.

2.1F2givenalgebra∎

Under the stated size and rank hypotheses, [F2] gives the displayed identity; this is a conditioning statement, not a solver-specific error bound.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

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, b is bounded by ∣b(x,y)∣≤5∥x∥U∥y∥V, uniformly in mesh size.

Facts & Assumptions

Given: Product graph and skeleton quotient norms.

[A1]

Countable Choice is declared for trace duality. (The Axiom of Countable Choice (ACω))

[F1]

The five form terms and signs are fixed by the DPG definition. (Ultraweak Poisson DPG spaces and plan-consistent bilinear form)

[F2]

Skeleton norms are global lift infima. (Ultraweak Poisson skeleton spaces are Hilbert trace quotients)

[F3]

Weak normal trace is bounded in H(div). (Weak normal trace by Green duality)

Proof

1.1F1algebra

Cauchy–Schwarz bounds the three volume pairings in [F1] by the trial/test product norms.

2.1A1F2F3step 1.1algebra

Lift u^ to global H1_0 and use [F3] on τ⋅n. Lift σ^n to global H(div) and use cell Green identities on broken vK. Cauchy–Schwarz across cells and infimizing by [F2] bound each skeleton term by the same product.

3.1F1step 1.1step 2.1algebra∎

Each of five terms is bounded by the product norm by steps 1.1 and 2.1, so the triangle inequality gives constant 5, independent of the mesh.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

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 b(x,y)=0 for every broken test on a bounded connected Lipschitz domain, then x=(σ,u,u^,σ^n)=0.

Facts & Assumptions

Given: The DPG spaces, Countable Choice, and the zero pairing hypothesis.

[A1]

Countable Choice is declared for Sobolev traces. (The Axiom of Countable Choice (ACω))

[F1]

The form separates broken tests and fixes global trace ranges. (Ultraweak Poisson DPG spaces and plan-consistent bilinear form)

[F2]

Compatible traces are traces of global H1_0 and H(div) fields. (Ultraweak Poisson skeleton spaces are Hilbert trace quotients)

[F3]

Cell normal traces satisfy Green’s identity. (Weak normal trace by Green duality)

[F4]

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)

[F5]

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)

[F6]

Homogeneous Dirichlet Poincare holds. (A bounded-domain Poincare inequality for H1-zero fields)

Proof

1.1F1F5givenalgebra

Compactly supported vector tests on each cell give σ+∇u=0 distributionally; compactly supported scalar tests give divσ=0. Thus u∣K∈H1(K), σ∣K∈H(div;K), and both identities hold cellwise.

2.1F1F3F4step 1.1algebra

With σ=−∇u, the first local equation and [F3] give ⟨u^−u∣∂K,γnτ⟩=0 for every τ∈H(div;K). Surjectivity [F4] makes the scalar trace classes equal. The second local equation gives ⟨σ^n−γnσ,v⟩=0 for every v∈H1(K), so those normal-trace functionals are equal as well.

3.1A1F2F3F5F6step 1.1step 2.1algebra∎

Take a global H1_0 lift u0 of u^. On each cell, u−u0 has zero scalar trace, hence belongs to H01(K); zero-extending compactly supported approximants and summing over the finite mesh shows u−u0∈H01(Ω), so u∈H01(Ω). Take a global H(div) lift σ0 of σ^n. The cell field σ−σ0 has zero weak normal trace on every cell. Summing its local Green identities against restrictions of Cc∞(Ω) shows its piecewise L2 divergence is its global distributional divergence; thus it glues to H(div), and σ∈H(div;Ω). Now σ=−∇u and divσ=0; the weak Green identity tested with u∈H01 gives ∥∇u∥22=0. By [F6], u=0, then σ and both trace components vanish.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

The RT0/P1 least-squares family is conforming

Statement

Assume Countable Choice. The finite-mesh family RT0(Th)×(P1(Th)∩H01(Ω)) from First-order least-squares formulation of the Dirichlet Poisson problem is a finite-dimensional subspace of H(div;Ω)×H01(Ω).

Facts & Assumptions

Given: A finite conforming triangular mesh.

[A1]

Countable Choice is inherited by Sobolev interfaces. (The Axiom of Countable Choice (ACω))

[F1]

The RT0/P1 trial factors and boundary condition are fixed by the definition. (First-order least-squares formulation of the Dirichlet Poisson problem)

[F2]

Matching RT0 facet fluxes imply global H(div) conformity. (RT0 facet-flux unisolvence and global H(div) conformity)

[F3]

Global H1 traces agree across interior facets. (H1 traces agree across interior mesh facets)

Proof

1.1A1F1F2algebra

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 L2 divergence, so the flux factor lies in H(div).

2.1F1F3step 1.1algebra∎

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.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

A uniformly bounded Fortin map for the practical P1/R3 DPG family

Statement

Assume Countable Choice. For trials P1(K)2×P1(K), continuous trace P~2(∂K) and normal trace P1(∂K) on a shape-regular triangular mesh, there is an element-local Fortin map into P3(K)2×P3(K). It has a mesh-independent broken graph bound, preserves the scalar cell mean, satisfies ∥v−Π3gradv∥L2(K)≤ChK∥∇v∥L2(K), and b(wh,y−Πy)=0 for all discrete trial tuples and broken tests.

Facts & Assumptions

Given: The stated polynomial trial/test spaces and Countable Choice.

[A1]

Countable Choice is declared for Sobolev traces. (The Axiom of Countable Choice (ACω))

[F1]

The DPG form and trial moments are fixed by its definition. (Ultraweak Poisson DPG spaces and plan-consistent bilinear form)

[F2]

Skeleton norms are global quotient lift norms. (Ultraweak Poisson skeleton spaces are Hilbert trace quotients)

[F3]

The RT polynomial families are RT⁡k=Pkd+xP~k. (Affine simplicial meshes and RT/BDM spaces)

[F4]

The weak H(div) normal trace is continuous. (Weak normal trace by Green duality)

[F6]

Shape-regular affine simplex scaling is uniform. (Shape regularity controls affine simplex geometry)

[F7]

A mean-zero H1 function on the reference simplex satisfies the Poincare–Wirtinger inequality. (Poincare–Wirtinger inequality on a reference simplex)

[F8]

The contravariant Piola map sends RT⁡2 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)

[F9]

Cell weak normal traces are the Green functionals on H1/H01 and satisfy the graph-norm bound. (Weak normal trace by Green duality)

Proof

1.1F5algebra

On the reference triangle B3grad={p∈P3:p(ai)=0} has dimension 7. Define Π30w∈B3grad by matching one cell mean and two edge P1 moments on each edge. In the homogeneous system an edge restriction is t(1−t)(a+bt); testing against a+bt forces its weighted square integral to vanish. Each edge restriction is zero, leaving cλ0λ1λ2, whose mean forces c=0. Hence the seven scalar moments are unisolvent.

1.2F3F4algebra

On the reference triangle RT2=P22+xP~2 has dimension 15. Its normal trace map is onto broken P2: for an edge F opposite vertex ai, extend any q∈P2(F) polynomially in the other two barycentric coordinates and set τ=(x−ai)q(x)/Hi, where Hi is the altitude to F. This vector is tangent to the other two edges and has normal trace q on F; it lies in RT2 because its cubic part is x times a homogeneous degree-two polynomial and its remaining terms lie in P22. Thus the broken normal trace image has dimension 9. Let B3div be its inverse image of continuous P2 boundary traces, a 12-dimensional subspace. Define Π3divτ∈B3div by matching six volume moments against P12 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 ∇P2⊂P12 then give divτ=0; its homogeneous cubic part xq2 has divergence 4q2, so τ∈P22. Write τ=R∇ϕ: explicitly, for polynomial τ=(τ1,τ2) use ϕ(x,y)=∫0xτ2(s,0) ds−∫0yτ1(x,t) dt. The identity ∂xτ1+∂yτ2=0 gives ∂xϕ=τ2 and ∂yϕ=−τ1, and deg⁡ϕ≤3. Zero normal trace makes ϕ constant on each edge; vertex continuity makes these constants equal. After subtracting the common constant, ϕ=cλ0λ1λ2. The volume moment against Rx is ∫K∇ϕ⋅x=−2c∫Kλ0λ1λ2 by Green’s identity and ϕ∣∂K=0, so c=0. Thus the 12 moments are unisolvent.

2.1A1F5F6F7step 1.1algebra

On the reference triangle set Π^3gradv^=v^ˉ+Π30(v^−v^ˉ); for a physical cell let FK(x^)=AKx^+bK be its orientation-preserving affine map and define Π3,Kgradv=(Π^3grad(v∘FK))∘FK−1. Affine change of variables preserves the cell mean and, since each edge Jacobian is constant, the edge P1 moments. The bounded inverse reference moment matrix, [F5], mean-zero Poincare–Wirtinger [F7], and shape scaling [F6] yield ∥Π3,Kgradv∥H1(K)≤C∥v∥H1(K) and ∥v−Π3,Kgradv∥2≤ChK∥∇v∥2.

2.2A1F3F4F6F8F9step 1.2algebra

Let FK(x^)=AKx^+bK, JK=det⁡AK>0, and τ^=JKAK−1(τ∘FK). Applying [F8] to the affine inverse shows τ^∈H(div⁡;K^) with the transformed divergence. Define the physical projection by Π3,Kdivτ:=PK(Π^3divτ^). For every w∈H1(K), w∘FK∈H1(K^) by [F8], and the weak Green functional, affine weak-derivative/divergence transformations, and change of variables give ⟨γn,Kτ,[w]⟩=∫K^(τ^⋅∇^(w∘FK)+(div⁡^τ^)(w∘FK))=⟨γn^,K^τ^,[w∘FK]⟩. The volume moments also transport: for p∈P1(K)2, affine change of variables gives (Π3divτ,p)K=(Π^3divτ^,AKT(p∘FK))K^,AKT(p∘FK)∈P1(K^)2, and the same identity with Π^3divτ^ replaced by τ^; hence every physical P1(K)2 volume moment is matched. This derives the weak normal-trace transport for arbitrary H(div⁡) inputs; it does not infer it from the smooth-field flux identity. Each continuous boundary P2 function on a triangle is the trace of a polynomial in P2(K) (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 RT⁡2(K)⊂P3(K)2. Its reference moment vector is bounded by C∥τ^∥H(div⁡;K^): volume moments are controlled by L2, and boundary moments by [F9] and the fixed polynomial trace norms. The unisolvent reference moment matrix therefore gives ∥Π^3divτ^∥L2(K^)≤C∥τ^∥H(div⁡;K^). In dimension two, [F6] implies JK1/2∥AK−1∥≤C and ∥AK∥JK−1/2≤C, while ∥τ^∥L2≤C∥τ∥L2(K) and ∥div⁡^τ^∥L2≤ChK∥div⁡τ∥L2(K). Since hK≤diam⁡Ω on the fixed bounded domain, Piola scaling gives ∥Π3divτ∥L2(K)≤CΩ∥τ∥H(div⁡;K). Finally, for every q∈P2(K), Green’s formula, the matched volume moments against ∇q∈P1(K)2, and the matched continuous boundary moments imply (div⁡Π3divτ,q)K=(div⁡τ,q)K. Thus div⁡Π3divτ=P2(div⁡τ) and its L2 norm is at most ∥div⁡τ∥L2(K). This proves the uniform broken H(div) graph bound.

3.1A1F1F2step 2.1step 2.2algebra∎

Vector moments match σh∈P12, and the divergence projection from step 2.2 matches uh∈P1. The continuous boundary P2 moments match u^h, while the scalar edge P1 moments match σ^n,h. For the remaining volume term, put q=v−Π3gradv and integrate −(σh,∇q)K by parts: div⁡σh∈P0(K) pairs to zero with q by cell-mean preservation, and σh⋅n∈P1(F) pairs to zero with q on each edge by the scalar edge moments. Hence every term of [F1] vanishes locally, and summing gives b(wh,y−Πy)=0. The cell bounds add in broken graph norms.

AlgorithmAlgorithm: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Ideal Poisson DPG trial-to-test Riesz map

Definition

Input: A real trial vector w∈U.

Output: The ideal test vector Tw∈V.

Admissible conditions: U and V are the real Hilbert spaces in Ultraweak Poisson DPG spaces and plan-consistent bilinear form, and b 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 ℓw(v)=b(w,v) on V. Apply the Hilbert-space Riesz representation procedure to obtain the unique Tw∈V satisfying

(Tw,v)V=ℓw(v)=b(w,v)(v∈V),

and return Tw. For a finite-dimensional trial subspace Uh, the ideal test space is T(Uh).

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

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 f∈L2(Ω) on a bounded connected Lipschitz polygon, and let (σ,u)=(−∇u,u) be the unique weak Dirichlet solution. The exact functional Jh 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 H01(Ω).

Facts & Assumptions

Given: The exact weak Poisson solution, the finite conforming RT0/P1 family, AC and CC.

[A1]

The weak Poisson existence supplier assumes AC and CC and gives a unique H01 solution for bounded-domain data. (The Axiom of Choice, The Axiom of Countable Choice (ACω), Existence and uniqueness for the weak Dirichlet Poisson problem)

[F1]

The trial family is a finite-dimensional subspace of H(div)×H01. (The RT0/P1 least-squares family is conforming)

[F2]

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)

[F3]

The residual is (σ+∇u,divσ−f) with the stated homogeneous boundary condition. (First-order least-squares formulation of the Dirichlet Poisson problem)

Proof

1.1A1givenalgebra

The weak solution supplier in [A1] applies because a bounded polygon is open and bounded in one direction, and v↦(f,v) is bounded on H01 by Cauchy–Schwarz and Poincare. It gives u∈H01; the distributional equation gives σ=−∇u∈H(div) and divσ=f.

2.1F1F2F3step 1.1algebra

For any (σh,uh) in the trial family, the residual of its difference from (σ,u) equals (σh+∇uh,divσh−f) by [F3]. Thus Jh=∥R((σh,uh)−(σ,u))∥2. By [F2], (z,w)R=(Rz,Rw)L2×L2 is an inner product on the ambient error space.

3.1F1F2step 2.1algebra∎

By Gram–Schmidt choose an orthonormal basis e1,…,eN of R(Xh), and define Pq=∑j=1N(q,ej)ej. Then q−Pq is orthogonal to every ej, so Pq uniquely minimizes distance to R(Xh) by Pythagoras. The finite-dimensional image is closed; injectivity in [F2] pulls P(R(σ,u)) back to a unique minimizer and the same identity gives best approximation. The scalar component stays in the stated H1_0 trial factor.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

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 Ω⊂Rd, d∈{2,3}, and every finite conforming shape-regular simplicial mesh, give U the squared product norm from its two L2 factors and two global trace lift-infimum norms, and give V its full broken graph norm. Define B:U→V′ by (Bx)(y)=b(x,y). There is a bounded linear map R:V′→U such that BR=IV′ and ∥R∥≤C∗. Choose any CP>0 with ∥w∥2≤CP∥∇w∥2 for w∈H01(Ω), put a=(CP2+2)1/2, and set C∗2=(1+a)2+(1+CPa)2+(1+CP2)a2+(2+a)2+1. 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 CP, and an arbitrary F∈V′.

[A1]

Countable Choice is the stated axiom for the real Hilbert, Riesz, trace and Lax–Milgram interfaces. (The Axiom of Countable Choice (ACω))

[F1]

The formulation fixes the real product spaces, the global trace ranges with lift-infimum norms, and all five signs in b. (Ultraweak Poisson DPG spaces and plan-consistent bilinear form, Ultraweak Poisson skeleton spaces are Hilbert trace quotients)

[F2]

The finite broken products of H(div⁡) and H1 are real Hilbert spaces, and H01(Ω) is a real Hilbert space with its restricted H1 inner product. (H(div) is Hilbert and H0(div) is closed, The Sobolev space H1 is a Hilbert space)

[F3]

On a real Hilbert space, Riesz represents every bounded linear functional by a unique vector and preserves its norm. (Riesz representation for Hilbert spaces)

[F4]

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)

[F5]

For bounded open Ω, homogeneous Dirichlet Poincaré gives ∥w∥2≤CP∥∇w∥2 on H01(Ω); a coordinate-slab width supplies such a constant. (A bounded-domain Poincare inequality for H1-zero fields)

[F6]

The weak normal trace of a global H(div⁡) field is defined by the cell Green functional, and an L2 vector with L2 distributional divergence belongs to H(div⁡). (Weak normal trace by Green duality, The real H(div) space)

[F7]

The DPG form is bounded on the full trial and broken-test spaces by ∣b(x,y)∣≤5∥x∥U∥y∥V, so Bx=b(x,⋅) is a well-defined bounded element of V′ for every x∈U. (The ultraweak Poisson DPG bilinear form is bounded)

Proof

1.1A1F2F3F7givenalgebra

By [F7], B:U→V′ given by (Bx)(y)=b(x,y) is well defined and bounded. By [F2] and [F3], there is a unique (ρ,z)∈V such that F(τ,v)=(ρ,τ)+(div⁡hρ,div⁡hτ)+(z,v)+(∇hz,∇hv). Set g=ρ, r=div⁡hρ, f=z, and s=∇hz, viewed as global L2 classes by the finite mesh partition. If D=∥F∥V′, then ∥g∥22+∥r∥22+∥f∥22+∥s∥22=D2.

2.1A1F2F4F5step 1.1algebra

On H01(Ω) use the form a(w,ϕ)=(∇w,∇ϕ). It is bounded in the H1 norm, and [F5] gives a(w,w)≥(1+CP2)−1∥w∥H12. The functional ϕ↦(f,ϕ)+(g+s,∇ϕ) is bounded, since its absolute value is at most (CP∥f∥2+∥g∥2+∥s∥2)∥∇ϕ∥2. Thus [F4] gives a unique w∈H01(Ω) satisfying (∇w,∇ϕ)=(f,ϕ)+(g+s,∇ϕ)(ϕ∈H01(Ω)). Testing with w and using Cauchy–Schwarz yields ∥∇w∥2≤CP∥f∥2+∥g∥2+∥s∥2≤aD, including the case ∇w=0; hence ∥w∥2≤CPaD.

3.1F1F6step 1.1step 2.1constructalgebra

Set σ=g−∇w, u=w−r, and q=g+s−∇w. For every ϕ∈Cc∞(Ω), step 2.1 gives (q,∇ϕ)=−(f,ϕ), so div⁡q=f distributionally and q∈H(div⁡;Ω). Set u^=Γ0w and σ^n=Γnq, using the elementwise scalar and weak normal traces. Since w∈H01(Ω) and q is one global H(div⁡) field, these traces lie in the exact global ranges of [F1], with homogeneous scalar boundary trace and conservative normal trace. Define RF=(σ,u,u^,σ^n)∈U.

4.1F1F6step 1.1step 3.1algebra

Cell Green identities give ⟨u^,τ⋅n⟩=(∇w,τ)+(w,div⁡hτ) and ⟨σ^n,v⟩=(q,∇hv)+(f,v). Substitution into the five signed terms of the form gives b(RF,(τ,v))=(g−∇w,τ)−(w−r,div⁡hτ)+(∇w,τ)+(w,div⁡hτ)−(g−∇w,∇hv)+(q,∇hv)+(f,v)=(g,τ)+(r,div⁡hτ)+(s,∇hv)+(f,v)=F(τ,v). Therefore BR=IV′.

5.1F1F3F4step 1.1step 2.1step 3.1step 4.1algebra∎

From steps 1.1–3.1, ∥σ∥2≤(1+a)D, ∥u∥2≤(1+CPa)D, ∥u^∥U^≤∥w∥H1≤1+CP2 aD, and ∥σ^n∥Q^n≤∥q∥H(div⁡)≤(2+a)2+1 D, since ∥g+s∥2≤2D and div⁡q=f. Adding the four squared product components gives ∥RF∥U≤C∗D. Riesz and the unique weak solve depend linearly on F (a linear combination solves the combined variational equation, and uniqueness identifies it), and the remaining field and trace maps are linear; hence R is linear. Only CP enters the bound, so it is mesh-independent.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

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 O(NK3) 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 Uh⊂U consist of volume fields σh∣K∈P1(K)2, uh∣K∈P1(K), continuous scalar traces u^h∣∂K∈P~2(∂K), and conservative normal traces σ^n,h∣∂K∈P1(∂K). This is finite-dimensional. Let Vr=∏K(P3(K)2×P3(K)), presented cellwise by fixed ordered bases, and let Tr:Uh→Vr be the assembled finite Riesz map. On each fixed basis the unique local Riesz representatives assemble to a bounded linear map satisfying ∥Trwh∥V≤∥b∥∥wh∥U. Now assume the continuous primal and adjoint graph inf-sup constants have minimum β>0. Let Π:V→Vr be the bounded Fortin map of A uniformly bounded Fortin map for the practical P1/R3 DPG family, with b(Uh,(I−Π)V)=0 and ∥Π∥≤CΠ. Then for every bounded load F∈V′, the practical DPG system tested with Tr(Uh) has a unique solution xh, and ∥x−xh∥U≤(1+∥b∥CΠ/β)inf⁡zh∈Uh∥x−zh∥U, where x 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.

[A1]

Countable Choice is used by the mixed BNB solve. (The Axiom of Countable Choice (ACω))

[F1]

The DPG spaces and bilinear form are those of the ultraweak definition. (Ultraweak Poisson DPG spaces and plan-consistent bilinear form)

[F2]

The continuous form is bounded. (The ultraweak Poisson DPG bilinear form is bounded)

[F3]

The practical Fortin map is bounded and preserves the form on Uh. (A uniformly bounded Fortin map for the practical P1/R3 DPG family)

[F4]

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)

[F5]

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)

[F6]

The practical test map Tr is the finite Riesz representative in the broken polynomial test space. (Exact local finite Riesz solves for practical DPG tests)

[F7]

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. (L2 with the integral pairing is a Hilbert space, The Sobolev space H1 is a Hilbert space, H(div) is Hilbert and H0(div) is closed, Ultraweak Poisson skeleton spaces are Hilbert trace quotients)

Proof

1.1F2F5F6givenalgebra

On an arbitrary local input family, its Gram matrix is positive semidefinite. As long as the preceding vectors are independent, the next unpivoted LDLT 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 Gc=g, and the returned vector is therefore the unique finite Riesz representative. The factorization and solves use O(NK3) exact scalar operations after entry formation. For each cell this representative satisfies (Tr,Kwh,vK)V(K)=bK(wh,vK); summing over cells gives (Trwh,vr)V=b(wh,vr) for every vr∈Vr. For the fixed bases of Vr, local uniqueness and linearity of b show that the assembled Tr is linear. Its Riesz identity and [F2] give ∥Trwh∥V≤∥b∥∥wh∥U.

1.2F1F2F5F7givenalgebra

By [F7], U,V are real Hilbert spaces; boundedness [F2] and Riesz [F5] define A:U→V by (Aw,v)V=b(w,v). The primal inf-sup gives ∥Aw∥V≥β∥w∥U, so A is injective and its range is closed: if Awn converges, the lower bound makes wn Cauchy, and its limit maps to the range limit. The adjoint inf-sup gives ∥A∗v∥U≥β∥v∥V, so ker⁡A∗={0}. By the defining adjoint identity, v⊥ran⁡(A) iff (Aw,v)V=0 for every w, iff (w,A∗v)U=0 for every w, iff A∗v=0. Hence ran⁡(A)⊥=ker⁡A∗, the closed range is dense, and therefore all of V. Riesz represents F∈V′, so it has a unique preimage x∈U.

1.3F3givenalgebra

For wh∈Uh, the continuous primal bound gives β∥wh∥U≤sup⁡v∈Vb(wh,v)/∥v∥V. Fortin orthogonality in [F3] gives b(wh,v)=b(wh,Πv) and ∥Πv∥V≤CΠ∥v∥V, so the restricted inf-sup on Vr is at least γ=β/CΠ.

2.1A1F2F4F6step 1.3

On Vr×Uh, put a(r,v)=(r,v)V and c(v,wh)=b(wh,v). The first form is coercive on all of Vr, and [F4]’s constraint inf-sup is γ by step 1.3. Applying [F4] with datum F∣Vr and zero constraint gives a unique pair (rh,xh) with (rh,v)+b(xh,v)=F(v) and b(wh,rh)=0. The first equation makes rh the Riesz representative of the restricted residual; the second is orthogonality to Tr(Uh), exactly the practical DPG equations by [F6].

3.1F2F5step 1.2step 1.3step 2.1algebra∎

Give Vr′ the inner product transported from Vr by its Riesz map. The second mixed equation makes F−Brxh orthogonal to every Brwh in this inner product. For any zh, F−Brzh=(F−Brxh)+Br(xh−zh), so Pythagoras gives ∥Br(xh−zh)∥Vr′≤∥F−Brzh∥Vr′=∥Br(x−zh)∥Vr′≤∥b∥∥x−zh∥U. Apply the discrete inf-sup γ to xh−zh, then the triangle inequality and infimize over zh to obtain the displayed estimate.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Adjoint graph inf-sup for ultraweak Poisson on connected Lipschitz polyhedra

Statement

Assume Countable Choice. For every bounded connected Lipschitz polyhedron Ω⊂Rd, d∈{2,3}, and every finite conforming shape-regular simplicial mesh, give U its L2/global-quotient product norm and V the full broken graph norm of Ultraweak Poisson DPG spaces and plan-consistent bilinear form. With C∗ from A topology-free bounded lifting of every ultraweak Poisson load, the primal and adjoint bounds are sup⁡y≠0∣b(x,y)∣∥y∥V≥C∗−1∥x∥U,sup⁡x≠0∣b(x,y)∣∥x∥U≥C∗−1∥y∥V. Both constants are independent of the mesh. The bounded operator B:U→V′ and its Riesz trial-to-test map T:U→V are boundedly invertible, with inverse norms at most C∗. 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.

[A1]

Countable Choice is the hypothesis for the Hilbert and Riesz interfaces used below. (The Axiom of Countable Choice (ACω))

[F1]

The product trial and broken test spaces are real Hilbert spaces: their L2 factors, global trace quotient ranges, H(div⁡) factors and H1 factors have the stated real Hilbert structures. (L2 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 H1 is a Hilbert space)

[F2]

The real bilinear form defines a bounded operator B:U→V′ with ∣b(x,y)∣≤5∥x∥U∥y∥V. (The ultraweak Poisson DPG bilinear form is bounded)

[F3]

The trial operator has trivial kernel: Bx=0 implies x=0. (The ultraweak Poisson trial operator has trivial kernel)

[F4]

There is a linear R:V′→U with BR=IV′ and ∥R∥≤C∗. (A topology-free bounded lifting of every ultraweak Poisson load)

[F5]

The real Hilbert Riesz map JV:V→V′ is an isometric linear bijection. (Riesz representation for Hilbert spaces)

[F6]

The formulation fixes the five signs of b, the real trial/test spaces and the full broken graph norm. (Ultraweak Poisson DPG spaces and plan-consistent bilinear form)

Proof

1.1A1F2F3F4F6givenalgebra

The bounded form [F2] defines B, and [F4] makes B onto. By [F3], B is injective. For each x∈U, B(RBx−x)=BRBx−Bx=0, so injectivity gives RBx=x. Therefore B−1=R, ∥x∥U≤C∗∥Bx∥V′, and the dual norm identity ∥Bx∥V′=sup⁡y≠0∣b(x,y)∣/∥y∥V gives the primal bound.

2.1F1F4F5step 1.1algebra

For y≠0, set F=JVy and x=RF. Then Bx=F, so b(x,y)=F(y)=∥y∥V2, while [F4] and [F5] give ∥x∥U≤C∗∥F∥V′=C∗∥y∥V. Since F≠0, x≠0, and this x proves the adjoint bound; for y=0 the bound is immediate.

3.1F1F2F4F5F6step 1.1step 2.1algebra∎

Define T=JV−1B. By [F2], ∥T∥≤5. Since B−1=R, T−1=RJV and [F4] and [F5] give ∥T−1∥≤C∗. 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.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

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 ∣b(w,v)∣≤5∥w∥U∥v∥V as in The ultraweak Poisson DPG bilinear form is bounded. The ideal trial-to-test map T of Ideal Poisson DPG trial-to-test Riesz map is well defined, bounded linear, and satisfies ∥T∥≤5. Let x∈U be any exact ultraweak solution and let Uh⊂U be finite dimensional. The ideal DPG equations with test space T(Uh) have a unique solution xh, which is the orthogonal projection of x in the induced energy inner product (w,z)E=(Tw,Tz)V. Consequently ∥x−xh∥E=inf⁡zh∈Uh∥x−zh∥E=∥B(x−xh)∥V′.

Facts & Assumptions

Given: Countable Choice, the real Hilbert trial/test spaces and bounded bilinear form, an exact solution x, and a finite-dimensional Uh.

[A1]

Countable Choice is declared for Hilbert Riesz maps. (The Axiom of Countable Choice (ACω))

[F1]

The trial operator has trivial kernel. (The ultraweak Poisson trial operator has trivial kernel)

[F2]

The ideal procedure defines Tw as the Riesz representative of b(w,⋅). (Ideal Poisson DPG trial-to-test Riesz map)

[F3]

Riesz represents bounded real functionals uniquely and identifies each dual norm with the norm of its representative. (Riesz representation for Hilbert spaces)

[F4]

The DPG bilinear form is bounded by ∣b(w,v)∣≤5∥w∥U∥v∥V. (The ultraweak Poisson DPG bilinear form is bounded)

Proof

1.1A1F1F2F3F4givenalgebra

For every w∈U, [F4] makes v↦b(w,v) a bounded functional on V, and [F3] gives the unique Tw in [F2], with ∥Tw∥V≤5∥w∥U. Bilinearity of b and uniqueness of the Riesz representative imply T(αw1+βw2)=αTw1+βTw2 for real scalars α,β, so T is bounded linear. By [F1], Tw=0 implies w=0; hence (w,z)E=(Tw,Tz)V is a positive-definite inner product. For every wh∈Uh, the ideal equation is (Txh,Twh)V=F(Twh)=(Tx,Twh)V, by [F2] and exactness.

2.1F1step 1.1algebra

Choose an orthonormal basis e1,…,eN of the finite-dimensional image T(Uh) and define P(Tx)=∑j(Tx,ej)Vej. The equations in step 1.1 identify Txh=P(Tx); Pythagoras proves it uniquely minimizes distance to that image. Injectivity of T gives the unique xh and the best-approximation identity.

3.1F2F3step 2.1algebra∎

The functional B(x−xh)=b(x−xh,⋅) has Riesz representative T(x−xh) by [F2]. Therefore [F3] gives ∥B(x−xh)∥V′=∥T(x−xh)∥V=∥x−xh∥E.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

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 β>0, and let Π:V→Vr be the bounded Fortin map with b(Uh,(I−Π)V)=0. For any exact solution x=B−1F and any x~h∈Uh, define the practical residual estimator η=∥F−Bx~h∥Vr′ and Fortin data oscillation osc⁡(F)=∥F∘(I−Π)∥V′. Then β2∥x−x~h∥U2≤η2+(∥Π∥η+osc⁡(F))2,η≤∥b∥∥x−x~h∥U, osc⁡(F)≤∥b∥∥I−Π∥inf⁡zh∈Uh∥x−zh∥U. For the stated P1/R3 Poisson Fortin map, osc⁡(Ff)≤C(∑KhK2∥f−fK∥L2(K)2)1/2, where fK=∣K∣−1∫Kf; it vanishes for cellwise constant f.

Facts & Assumptions

Given: The continuous inf-sup bound, the bounded Fortin map, Countable Choice, and an arbitrary discrete approximation.

[A1]

Countable Choice is declared for Hilbert Riesz representation. (The Axiom of Countable Choice (ACω))

[F1]

The DPG trial/test spaces and load functional are fixed by the formulation. (Ultraweak Poisson DPG spaces and plan-consistent bilinear form)

[F2]

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)

[F3]

The practical quasi-optimality theorem records the continuous inf-sup and boundedness hypotheses used here. (Fortin stability and quasi-optimality for practical DPG)

[F4]

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

1.1A1F2F3F4given

Let e=x−x~h and let ϵ∈V represent F−Bx~h by Riesz. Choose an orthonormal basis e1,…,eN of the finite-dimensional polynomial space Vr and set ϵh=∑j=1N(ϵ,ej)Vej. Then δ=ϵ−ϵh is orthogonal to Vr, η=∥ϵh∥V=∥F−Bx~h∥Vr′, and ∥ϵ∥2=η2+∥δ∥2. Continuous inf-sup gives β∥e∥≤∥ϵ∥.

1.2F1F2F4givenalgebra

Riesz gives η≤∥Be∥V′≤∥b∥∥e∥. For any zh∈Uh, Fortin orthogonality gives F((I−Π)y)=b(x−zh,(I−Π)y); take the dual norm and infimum to obtain the oscillation approximation bound.

2.1F2F4step 1.1algebra

Since Πδ∈Vr, ∥δ∥2=(δ,δ−Πδ). Substitute ϵ−ϵh for δ; Fortin orthogonality kills b(x~h,(I−Π)δ), leaving F((I−Π)δ)+(ϵh,Πδ). Hence ∥δ∥≤osc⁡(F)+∥Π∥η. Combine with step 1.1 to get the reliability inequality.

3.1F1F2step 1.2algebra∎

For the Poisson load, mean preservation gives ∫K(v−Π3gradv)=0, so Ff((I−Π)(τ,v))=∑K(f−fK,v−Π3gradv)K. By [F2], each difference is bounded by ChK∥∇v∥K. Cauchy–Schwarz over cells yields the stated data oscillation; it is zero if every f∣K=fK.

CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

P1/R3 practical DPG quasi-optimality and residual estimator for Poisson

Statement

Assume Countable Choice. Let Ω⊂R2 be any bounded connected Lipschitz polygon, including polygons with holes, and let Th be any finite conforming shape-regular triangular mesh. Use the exact two-dimensional P1/R3 practical family selected in PE30: volume fields σh∣K∈P1(K)2 and uh∣K∈P1(K); 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 Vr=∏K(P3(K)2×P3(K)), with the graph inner product inherited from V. The local Fortin projection Π:V→Vr is that of A uniformly bounded Fortin map for the practical P1/R3 DPG family, and CΠ is its operator norm bound. For each f∈L2(Ω), the continuous ultraweak solution x and practical solution xh exist uniquely, with ∥x−xh∥U≤(1+5CΠC∗)inf⁡zh∈Uh∥x−zh∥U. For every x~h∈Uh, put η=∥Ff−Bx~h∥Vr′, where Vr′ is the dual of Vr with its induced norm, and osc⁡(Ff)=∥Ff∘(I−Π)∥V′. Then C∗−2∥x−x~h∥U2≤η2+(CΠη+osc⁡(Ff))2,η≤5∥x−x~h∥U, and osc⁡(Ff)≤Cosc(∑KhK2∥f−fK∥L2(K)2)1/2,fK=∣K∣−1∫Kf, where hK=diam⁡(K) and Cosc is the cellwise constant from the Fortin map's mean-preserving local L2 estimate. The constants C∗, CΠ, and Cosc 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 f∈L2(Ω).

[A1]

Countable Choice is the hypothesis for the cited Hilbert and Riesz interfaces. (The Axiom of Countable Choice (ACω))

[F1]

The continuous graph theorem gives bounded invertibility and primal and adjoint inf-sup constants at least C∗−1 on every connected Lipschitz polygon, with no simple-connectivity assumption. (Adjoint graph inf-sup for ultraweak Poisson on connected Lipschitz polyhedra)

[F2]

The local P1/R3 Fortin map applies on shape-regular triangular meshes, has ∥Π∥≤CΠ, preserves scalar cell means, and satisfies the local L2 approximation bound. (A uniformly bounded Fortin map for the practical P1/R3 DPG family)

[F3]

The DPG bilinear form is bounded with ∥b∥≤5. (The ultraweak Poisson DPG bilinear form is bounded)

[F4]

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)

[F5]

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)

[F6]

The load is Ff(τ,v)=(f,v), the test norm includes ∥v∥2, and the scalar skeleton trace is the trace of a global H01 field. (Ultraweak Poisson DPG spaces and plan-consistent bilinear form)

Proof

1.1A1F1F2F3F4F6givenalgebra

Since ∥Ff∥V′≤∥f∥2, [F1] gives the unique continuous solution x=B−1Ff. 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 β=C∗−1; using [F3] in its quasi-optimal constant gives the stated unique practical solution and factor 1+5CΠC∗. For f=0, both solutions are zero by these uniqueness conclusions.

2.1F1F2F3F5step 1.1algebra

For any x~h∈Uh, apply [F5] with the same β=C∗−1 and Fortin map [F2]. Its reliability and efficiency inequalities give C∗−2∥x−x~h∥U2≤η2+(CΠη+osc⁡(Ff))2,η≤∥b∥∥x−x~h∥U≤5∥x−x~h∥U.

3.1F2F6step 2.1algebra∎

For y=(τ,v), cell-mean preservation gives ∫K(v−Π3gradv)=0, hence Ff((I−Π)y)=∑K(f−fK,v−Π3gradv)K. The local approximation bound in [F2] and Cauchy–Schwarz over cells give the displayed Cosc estimate. In particular the oscillation is zero when f is cellwise constant. All constants depend on the fixed domain, polynomial degrees and mesh shape regularity, not on h; 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