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 small-norm ball scatterer has a certified Born tail
Example
Assume Countable Choice. Take , constant contrast , real , and arbitrary . The general kernel estimate gives , so the Born series converges and its th partial sum has an explicit geometric error bound.
Verification
Given: Countable Choice, the ball, contrast and volume operator from The three-dimensional volume integral scattering model.
[F1] The ball has volume and diameter (A closed three-dimensional ball of radius has volume ).
[F2] For the three-dimensional kernel, (The three-dimensional free-space scattering kernel is square integrable).
[F3] If , the equation has a unique solution and Born tail (Born truncation error for a small-norm volume integral operator).
Substituting , , and into [F2] gives .
Set . Step 1.1 gives , so [F3] applies and yields a unique solution and . The last inequality follows termwise from , which is increasing on .
Depends on
- The three-dimensional volume integral scattering model
- The three-dimensional free-space scattering kernel is square integrable
- Born truncation error for a small-norm volume integral operator
- A closed three-dimensional ball of radius $r\ge0$ has volume $4\pi r^3/3$
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
33 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
- Otmar Scherzer and Leonidas Mindrinos, Inverse Problems: Lecture Notes, Sommersemester 2015, Chapter 5, §5.2.6 (standard reference, not scraped)
- Habib Ammari, Brian Fitzpatrick, and Sanghyeon Yu, Mathematical and Computational Methods in Photonics: Tutorial Notes, §1.3 (standard reference, not scraped)