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.
Finite Romberg table from nested composite trapezoid levels
Definition
Input a real function on a nondegenerate closed interval and an integer . The output is the finite triangular table and its top entry .
- For each , set using natural exponentiation of Exponentiation of natural numbers, , and its agreement with the integer power in . Since and , induction gives , as required by Composite trapezoidal rule. Set and using its composite trapezoidal value. Natural powers in real scalar expressions are understood through their canonical real images.
- For , and then for each , set
For , claim 3 of Monotonicity of and of gives , using the natural-to-real power identity of Exponentiation of natural numbers, , and its agreement with the integer power in ; thus every displayed denominator is the positive real and is invertible by The reals form a field. This definition returns only the stated finite table; it makes no accuracy claim for nonsmooth inputs or finite-precision arithmetic.
Depends on
- Composite trapezoidal rule
- The canonical natural $\iota(n) = n \cdot 1_F$ of a field
- The reals form a field
- Exponentiation of natural numbers, $m^{n}$, and its agreement with the integer power in $\mathbb{R}$
- Canonical naturals are positive and strictly increasing
- Monotonicity of $x \mapsto x^n$ and of $n \mapsto a^n$
Used by
Dependency tree · two levels
32 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
- L. Ridgway Scott, Numerical Analysis, 2nd ed., §13.3 (standard reference, not scraped)
- NIST Digital Library of Mathematical Functions, §3.5 Quadrature (standard reference, not scraped)