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.
Two separated planar charge clusters
Example
Use the dyadic root square . Put and ; the other two root children are empty. Within name its lower-left and lower-right children and . Within name its lower-left, lower-right, and upper-left children , , and ; its upper-right child is empty. Let the leaf threshold be and split each cell with more than two labels. Put unit charges at in , where . Put zero-charge labels at in , in , in , and in . Thus and have three labels each and split; their named children are leaves. In the recursive ordered cell pair , splitting the source exposes , and then splitting exposes the separated pair . The far difference disk has center and radius , so use its analytic logarithm real at . Take order .
Facts & Assumptions
Given: The six labels and their charges/positions above, the recursive cell-pair list rule, and the order-one planar FMM.
Finite planar quadtree and separated interaction lists: a non-admissible pair is split by the specified cell rule, a separated pair is recorded as far, and direct near pairs are recorded at leaves.
Fixed-order planar Laplace fast multipole procedure: P2M moments are , M2L uses the displayed local coefficients, and near values/derivatives are added exactly.
Global planar FMM potential and derivative error: one far pair with ratio has potential and derivative bounds and at order .
Verification
The root has six labels, and its nonempty children each have three, so threshold makes internal while all named grandchildren are leaves. The centers of are , their radii are , and their center distance is , so is not separated. Its equal side lengths make the rule split the source ; child has center and radius . The pair is not separated because its center distance is . Splitting the larger cell exposes centered at ; now . Thus the list recursion records as a far pair, and the zero-charge label at is the target at the target-cell center.
The two unit source offsets give and . With , [F2] gives the local coefficients and . At the target center this interaction returns potential and derivative . Other source labels have zero charge, so they add no contribution to this target.
The two nonzero source-target differences are and , so the exact potential is and the exact derivative is . Comparing with step 1.2, the absolute errors are and ; the logarithmic inequality follows from for . Zero-charge labels add no contribution.
For the only far interaction with nonzero source charge, , , and . The [F3] bounds are and ; all other far source cells have . Any direct near pairs from the zero-charge labels contribute exactly zero, so the errors in step 2.1 satisfy the theorem's global sums.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
5 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
- Leslie Greengard and Vladimir Rokhlin, A Fast Algorithm for Particle Simulations, Journal of Computational Physics 73 (1987), 325–348 (standard reference, not scraped)
- James Demmel, Fast Hierarchical Methods for the N-body Problem, Part 2, CS267 Lecture 25 (1996) (standard reference, not scraped)