Alphabeta Math
AlgorithmAlgorithm: AI-adaptedProof: Not applicablePipeline-generatedjudge 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.

Single-cluster three-dimensional Laplace multipole evaluator

Definition

Fix an integer p≥0, a finite set of source labels J with positions yj∈R3 and charges qj∈C, a center c, and a radius a≥0 with ∣yj−c∣≤a. For each 0≤ℓ≤p, supply an orthonormal basis {Yℓm:−ℓ≤m≤ℓ} of Hℓ from Degree-indexed spherical harmonic spaces in three dimensions; its existence and dimension are given by Three-dimensional Laplace spherical-harmonic addition theorem. Form moments Mℓm=∑j∈JqjHℓm(yj−c)‾. For every target x with r=∣x−c∣>a, evaluate the truncated single-cluster multipole field U~p(x)=4π∑ℓ=0p12ℓ+11rℓ+1∑m=−ℓℓMℓmYℓm ⁣(x−cr). The output is an approximation to U(x)=∑j∈Jqj/∣x−yj∣. This is the source-cluster-to-target evaluator only; it makes no 3D tree-translation or global all-target complexity claim.

For the arithmetic count, store each basis polynomial by its monomial coefficient array. Basis setup is done once for the chosen p. To evaluate the displayed formula directly, evaluate every basis polynomial by summing its monomials at each source and target point, then accumulate the moments and target sums. This convention makes the basis-evaluation work explicit rather than treating each special-function evaluation as free.

Depends on

Used by

Dependency tree · one level

2 results within one dependency step 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