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 neutral dipole cell and its reciprocal modes
Example
Take the unit cubic torus , with charges at and at . The dipole is neutral and its Fourier structure factor vanishes on every even first-coordinate mode and is equal to on every odd first-coordinate mode.
Facts & Assumptions
Given: Countable Choice, , the unit cell, these two charges and positions, and the Fourier coefficient and reciprocal-energy conventions for neutral periodic data.
The Gaussian Ewald formula uses Countable Choice (The Axiom of Countable Choice ()).
and neutral data have zero coefficient at (Neutral point sources and Fourier data on a three-dimensional torus).
The reciprocal Ewald energy is with , and the full renormalized energy adds the real-space and self terms (The alpha-independent Ewald potential and renormalized energy).
Verification
The two positions are distinct in and . For , [F1] gives ; hence , when is even, and when is odd.
For any finite symmetric reciprocal mode set , the dipole contributes to the retained reciprocal energy. The remaining real-space and self contributions are exactly the terms in [F2], under its neutrality, positive-parameter and Countable Choice hypotheses [A1]. Thus the zero mode is absent and the reciprocal selection is precisely the odd- subset, not an assumed continuum average.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
19 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.