Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

A certified matrix defect transfers to a Galerkin error bound

Statement

Assume the Axiom of Choice and Countable Choice. Let H be a real Hilbert space and Xh⊂H a finite-dimensional subspace. Let a:H×H→R be bounded with continuity constant C and coercive with constant c>0, and let F∈H′. Write Fh=F∣Xh and ∥Fh∥Xh′=sup⁡wh∈Xh∥wh∥H≤1∣Fh(wh)∣. Let u∈H solve a(u,w)=F(w) for all w∈H, and let uh∈Xh be its exact Galerkin solution. Suppose a bilinear form a~h:Xh×Xh→R and load F~h∈Xh′ satisfy ∣a~h(vh,wh)−a(vh,wh)∣≤δ∥vh∥H∥wh∥H,∣F~h(wh)−Fh(wh)∣≤η∥wh∥H for all vh,wh∈Xh, with 0≤δ<c. The perturbed equation a~h(u~h,wh)=F~h(wh) has a unique solution and ∥u−u~h∥H≤(1+C/c)inf⁡vh∈Xh∥u−vh∥H+1c(η+δ(∥Fh∥Xh′+η)c−δ). Independently of the condition δ<c in the variational estimate, for a successful assembly in Certified near-quadrature and far-multipole matrix assembly, every near or far certificate gives ∣ATS−A~TS∣≤εTS≤τTS. If the supplied γh>0 satisfies ∥c∥2≤γh−1∥∑TcT1T∥H−1/2, then the returned value δh=γh−2(∑T,SεTS2)1/2 bounds the bilinear form defect in the fixed H−1/2 norm. This guarantee includes the exact near-pair identities and all derivative, nested-fiber, evaluation and arithmetic errors, and uses the far tail only under R>a+b; an uncertified output supplies no such bound.

For the standard branches of Certified near-quadrature and far-multipole matrix assembly, assume the required geometry, derivative and denominator certificates are verified and outward arithmetic can reach each prescribed positive radius. Every positive entry tolerance is then attained after finitely many levels. A supplied custom identity is accepted only with an already verified finite certificate meeting its tolerance; no refinement-termination assertion is made for arbitrary custom identities.

For P0 single-layer BEM, take H=H−1/2(Γ) with its Sobolev norm and a(v,w)=⟨w,Vv⟩Γ. The single-layer theorem supplies c,C, and a successful matrix-assembly certificate supplies δ.

Facts & Assumptions

Given: The Axiom of Choice, Countable Choice, the real Hilbert exact variational problem, its finite-dimensional conforming subspace, and the stated form/load defect bounds; for the separate assembly assertion, the successful algorithm certificates and their positive lower norm bound.

[A1]

The Axiom of Choice and Countable Choice are inherited by the BEM specialization through the single-layer coercivity theorem and the certified assembly's weak-pairing identity; Countable Choice is also assumed by Lax–Milgram and the second Strang theorem (The Axiom of Choice, The Axiom of Countable Choice (ACω)).

[F1]

The second Strang theorem gives existence, uniqueness, and quasi-optimality for the exact coercive problem and its conforming finite-dimensional restriction; the exact restricted form/load have zero consistency defect (Second Strang estimate with a bounded extension to the comparison space).

[F2]

A bounded coercive real bilinear form on a real Hilbert space has a unique variational solution under Countable Choice (The Lax--Milgram theorem, The Axiom of Countable Choice (ACω)).

[F3]

In the P0 BEM specialization, the exact form is bounded and coercive with constants C,c>0 (The three-dimensional single layer is bounded and coercive), and Xh is a finite-dimensional conforming subspace (Shape-regular surface meshes and conforming P0 densities).

[F4]

The assembly procedure records each near/far certificate, its error sum εTS, the exact lower norm bound γh and the displayed computed δh; missing or unverified input returns uncertified. The guarantee is proved below, not assumed from the algorithm. (Certified near-quadrature and far-multipole matrix assembly)

[F5]

Touching panel pairs have exact finite reference-triangle identities, and disjoint pairs have the smooth fallback; the kernel integral is the weak P0 pairing. (Certified touching-panel and disjoint-panel quadrature for the Laplace P0 matrix, Calderon boundary operators and trace conventions)

[F6]

The positive centroid far rule has its stated physical-kernel quadrature residual, with charges vj/(4π) and strict separation R>a+b. (A positive far-panel quadrature residual and normalized cluster combination)

[F7]

The positive Duffy rule for a verified exponent α<2 and C2n transformed amplitude has the stated derivative error. (The Duffy weighted product rule has an explicit bound using pure coordinate derivatives)

[F8]

The single-cluster evaluator under R>a+b has the geometric tail used by the procedure, with its separate arithmetic error; its work assertion is for one cluster only. (Three-dimensional Laplace cluster expansion error and work)

[F9]

Finite-dimensional Cauchy–Schwarz gives ∣dTEc∣≤∥E∥F∥c∥2∥d∥2. The BEM real Hilbert space and its dual norm are the fixed square-sum chart convention. (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs, Lipschitz polyhedral boundary, orientation, and trace spaces)

Proof

1.1A1F5F7givenalgebra

For a standard near certificate, [F5] supplies the exact identity; a custom certificate supplies it as an audited hypothesis. In either case each exponent and transformed amplitude meet [F7], so the positive Duffy rule error is bounded by Em. Add the separately certified nested fiber, node-evaluation and outward arithmetic radii with the triangle inequality; the certificate condition gives ∣ATS−A~TS∣≤∑m∣cm∣(Em+ρm)=εTSnear≤τTS.

1.2F6F8givenalgebra

For a far certificate, [F6] bounds the difference between the exact entry and the positive centroid sum by εTSquad+εTSeval. Under the strict ball condition, [F8] bounds the point-cluster error uniformly over the target ball. Multiplying by the positive target weights and adding the outward arithmetic radius gives the remaining terms in εTSfar. The total is at most τTS by the certificate condition; if R≤a+b, no FMM tail is used.

1.3A1F1givenconstruct

Apply [F1] with exact form a, exact load F, and conforming subspace Xh. It gives the unique exact solution u, the unique exact Galerkin solution uh, and ∥u−uh∥H≤(1+C/c)inf⁡vh∈Xh∥u−vh∥H, since the consistency defect is zero.

1.4A1F2givenalgebra

The perturbation bound and coercivity of a imply a~h(vh,vh)≥(c−δ)∥vh∥H2 for all vh. Also ∣a~h(vh,wh)∣≤(C+δ)∥vh∥H∥wh∥H, and ∥F~h∥≤∥Fh∥+η. Lax–Milgram [F2] therefore gives a unique perturbed solution u~h.

1.5F4F5F6F7F8givenalgebra

For a standard touching pair, [F5] gives finitely many smooth amplitudes with fixed derivative bounds. At level k, midpoint triangle subdivision and the n=1 pure-derivative remainder give total triangle error at most CTS4−k; where an opposite face has dimension three, its 2k fiber midpoints add at most CTS4−k. The disjoint smooth fallback has the same bound after subdividing both reference triangles. For the far branch, [F6] gives centroid error at most CTS2−k. The fixed whole-panel balls give q=a/(R−b)<1, and positivity fixes Q=∣S∣/(4π) and WT=∣T∣ independently of level; hence [F8] gives a tail at most CTSqk+1 (zero if a=0). By [F4] the combined evaluation and arithmetic radius is at most 2−k−1τTS, reached in finite precision refinement by hypothesis. Each total therefore tends to zero, so the first accepted level is finite for every τTS>0. The ordered panel-pair set is finite, and a custom identity uses a supplied finite certificate rather than this loop. This proves the stated termination assertion.

2.1F4F5F9step 1.1step 1.2givenalgebra

Write ETS=ATS−A~TS. For coefficient vectors c,d, finite Cauchy–Schwarz gives ∣dTEc∣≤(∑T,S∣ETS∣2)1/2∥c∥2∥d∥2. The certified entry bounds imply ∣ETS∣≤εTS. The supplied lower norm bound in [F4] gives ∥c∥2≤γh−1∥∑ScS1S∥H−1/2 and the corresponding bound for d. Substitute both inequalities and take the supremum over unit H−1/2 densities to obtain the bilinear operator-defect bound δh. If a pair has no successful certificate, steps 1.1–1.2 provide no bound for that entry, so the procedure correctly returns uncertified.

2.2step 1.4givenalgebra

Test the perturbed equation with u~h. Then (c−δ)∥u~h∥H2≤(∥Fh∥Xh′+η)∥u~h∥H, so ∥u~h∥H≤(∥Fh∥Xh′+η)/(c−δ); this also holds if u~h=0.

3.1F1step 1.4step 2.2givenalgebra

Put eh=uh−u~h. Subtracting the perturbed equation from the exact discrete equation gives a(eh,wh)=Fh(wh)−F~h(wh)+(a~h−a)(u~h,wh). Take wh=eh. If eh≠0, coercivity and the two defects give ∥eh∥H≤c−1(η+δ∥u~h∥H); if eh=0 the same inequality holds. Substitute step 2.2 to obtain ∥eh∥H≤c−1(η+δ(∥Fh∥Xh′+η)/(c−δ)).

4.1F1F3F4F9step 2.1step 1.3step 3.1givenalgebra∎

By the triangle inequality, ∥u−u~h∥H≤∥u−uh∥H+∥eh∥H. Apply step 1.3 and step 3.1 to get the displayed bound. In the BEM specialization, [F3] verifies the exact-form hypotheses and the entrywise and form estimates in steps 1.1–2.1 verify that the successful assembly defect is the δ required here.

Depends on

Used by

Cited to discharge well-definedness by Certified near-quadrature and far-multipole matrix assembly.

Dependency tree · two levels

66 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