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 near-resonant Nyström equation amplifies midpoint quadrature error
Example
For , set , define and let . The exact solution of is For the -panel composite midpoint rule with , the Nyström solution is Its error is the midpoint residual multiplied by a factor which is at least whenever . Thus a small quadrature residual can produce a much larger solution error as approaches the resonance value .
Facts & Assumptions
Given: , , , , and the rank-one integral operator and midpoint Nyström rule in the Example.
Nyström quadrature operators and their reconstructed equations: for the rank-one kernel .
Verification
Given: The data above, and the exact and discrete affine candidates and .
Substituting into gives , so . Since , the unique coefficient is , proving the exact formula.
On each midpoint panel, direct integration gives and Summing the panels yields and .
Any discrete solution has the form because the range of is contained in the span of . Its coefficient satisfies , hence ; the denominator is positive, so the discrete solution is unique.
On the direction , , so scales that direction by . Also , so scales it by . Directly using the exact and discrete coefficients from steps 1.1 and 2.1 gives The ratio of solution error to quadrature residual is exactly , and the stated lower bound follows when .
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
10 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
- Andreas Neubauer and Ronny Ramlau, Lecture Notes: Integral Equations and Boundary Value Problems, §3.3 (standard reference, not scraped)
- Tobin A. Driscoll and Richard J. Braun, Fundamentals of Numerical Computation, §5.6 (standard reference, not scraped)