Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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 positive far-panel quadrature residual and normalized cluster combination

Statement

Let T,S be disjoint nondegenerate compact triangles in a conforming surface mesh, let d be supplied with 0<d≤dist⁡(T,S), and set ATS=14π∫T∫S1∣x−y∣ dSy dSx. Apply mT and mS successive midpoint refinements to T and S, respectively. The resulting subtriangles have maximum diameters hT=2−mTdiam⁡(T) and hS=2−mSdiam⁡(S). Give each subtriangle its area as a positive weight and its centroid as its node, obtaining rules (xi,wi) and (yj,vj). Then BTS=∑i∑jwivj4π∣xi−yj∣ satisfies ∣ATS−BTS∣≤εTSquad:=∣T∣∣S∣(hT+hS)4πd2. Repeated midpoint subdivision makes this residual tend to zero. For exact algebraic panel coordinates, a supplied strict algebraic lower bound for d and outward interval evaluation therefore gives an effective certificate at every positive tolerance; for other coordinates the corresponding certified separation and arithmetic bounds are required.

For the physical kernel, if the source nodes have charges qj=vj/(4π) in B(c,a) and the target nodes lie in B(dc,b) with R=∣dc−c∣>a+b, then the literal single-cluster evaluator of Single-cluster three-dimensional Laplace multipole evaluator has Q=∑j∣qj∣ and target-weight sum WT=∑iwi. Its contribution to the entry error is at most WTQR−b(a/(R−b))p+11−a/(R−b). Add separately certified quadrature, node-evaluation and outward-arithmetic radii. This is a single-cluster estimate, not a multilevel or global complexity result.

Facts & Assumptions

Given: Countable Choice for the underlying trace-space conventions, a conforming mesh, two disjoint panels T,S, a positive lower separation bound d, the deterministic midpoint centroid rules, and, when the cluster branch is used, its certified balls and truncation order p.

[A1]

Assume Countable Choice (The Axiom of Countable Choice (ACω)) for the mesh's underlying trace-space conventions. The centroid construction and finite single-cluster estimates below require no additional choice.

[F1]

The affine surface-patch formula Surface area and scalar surface integrals on a regular patch gives dS=∣∂1t×∂2t∣du for a panel. Shape-regular surface meshes and conforming P0 densities: each mesh panel is a compact nondegenerate convex triangle, and disjoint panels have positive distance. The midpoint subdivision area sum is checked directly in step 2.1.

[F2]

The three-dimensional Laplace Newton kernel: the physical kernel is G3(x,y)=(4π∣x−y∣)−1, with ∣∇xG3∣=∣∇yG3∣=(4π∣x−y∣2)−1.

[F3]

Mean value theorem on a closed real interval: for a differentiable scalar function on a segment, its increment is bounded by the segment length times the supremum of its derivative.

[F4]

Single-cluster three-dimensional Laplace multipole evaluator and Three-dimensional Laplace cluster expansion error and work: for source charge sum Q in B(c,a) and target ball B(dc,b) with R=∣dc−c∣>a+b, the single-cluster truncation error is at most QR−b(a/(R−b))p+11−a/(R−b), with only the stated single-cluster arithmetic count.

Proof

1.1A1F1F2F3givenchoose

Fix a target node xi, source node yj, and points x∈Ti, y∈Sj in their subtriangles. The paths x(t)=xi+t(x−xi) and y(t)=yj+t(y−yj) stay in T and S by convexity. Every pair on either path with the other variable fixed has distance at least d. Apply [F3] to t↦G3(x(t),y) and then to t↦G3(xi,y(t)); using [F2] and ∣x−xi∣≤hT, ∣y−yj∣≤hS gives ∣G3(x,y)−G3(xi,yj)∣≤hT+hS4πd2.

2.1F1step 1.1givenalgebra

One midpoint refinement divides a triangle into four triangles with half-length sides; the determinant of each affine map is 1/4, so each new area is one quarter of the old area. Induction gives ∑iwi=∣T∣ and ∑jvj=∣S∣. Integrate the pointwise bound of step 1.1 over each Ti×Sj and sum; the area sums give ∣ATS−BTS∣≤∣T∣∣S∣(hT+hS)/(4πd2).

3.1step 2.1givenalgebra

After m midpoint refinements every subtriangle diameter is at most 2−m times its initial diameter. Since d>0 and the right side of step 2.1 is proportional to hT+hS, it tends to zero; for every prescribed positive quadrature tolerance a finite m suffices. With exact algebraic coordinates, finite arithmetic and a certified strict lower bound for d can be enclosed outward to any requested positive radius. If the geometry or arithmetic certificate is absent, no certified numerical result follows from this lemma.

4.1F4step 2.1givenalgebra∎

For each target node the hypotheses in [F4] give the displayed uniform single-cluster error. Multiplication by its positive weight and summation bounds the target sum error by WT times that tail. The source charges must be qj=vj/(4π) because the evaluator sums qj/∣x−yj∣ while the physical kernel is 1/(4π∣x−y∣). Adding the centroid residual from step 2.1 and the separately certified node-evaluation and outward-arithmetic radii by the triangle inequality proves the stated total entry bound. No cluster conclusion is asserted when R≤a+b.

Depends on

Used by

Dependency tree · two levels

21 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