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.
Peano representation and L1 error bound
Statement
Let , let and define the finite quadrature and residual of Peano kernel of a finite quadrature functional, and let with . Assume vanishes on the evaluation functions of the zero polynomial and every nonzero formal polynomial of degree at most , and let . For the kernel of Peano kernel of a finite quadrature functional,
Facts & Assumptions
Given: A nondegenerate interval , a finite real weighted quadrature exact on , an integer , and .
, with , vanishes on the evaluation functions of the zero polynomial and every nonzero formal polynomial of degree at most , and has continuous derivatives through order .
Peano kernel of a finite quadrature functional: and , where for and ; the factorial image is positive and invertible.
Higher derivatives and the classes and : has continuous derivatives through order , including one-sided endpoint derivatives.
The second fundamental theorem: if is differentiable on with and is integrable, then : for a continuous derivative, integration over equals the endpoint increment of a primitive.
For a natural the function is differentiable everywhere with derivative ; for it is the constant , with derivative ; for a natural the function is differentiable at every with derivative ; consequently every polynomial function is differentiable at every real, with the derivative computed term by term, The chain rule, in one line from Carathéodory: if is differentiable at and is differentiable at , then is differentiable at with , and Sums, scalar multiples, products and quotients: , , , and when : polynomial powers and their products with derivatives obey the usual differentiation rules on each interval; together with FTC these give the integration-by-parts identity used below.
A continuous function on a closed rectangle has repeated Riemann integrals in every coordinate order, all equal to its multiple integral: a continuous function on a closed rectangle has equal repeated Riemann integrals in either coordinate order.
Integrable functions on form a set closed under sums and scalar multiples, and and For : is integrable on if and only if it is integrable on and on , and then ; with the oriented form for arbitrary : integrals are linear and additive over adjacent intervals. The factorial and the falling factorial , defined by recursion in supplies the natural factorials; their canonical real images in real denominators are the convention fixed by [F1].
A continuous function on is Riemann integrable, by Heine-Cantor and Riemann's criterion: continuous functions on closed intervals are Riemann-integrable.
Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous: a continuous function on a compact metric rectangle is uniformly continuous.
Changing an integrable function at finitely many points changes neither its integrability nor its integral: changing finitely many values preserves Riemann integrability and leaves the integral unchanged.
If are integrable on then so are , , , and , and and If on and both are integrable then ; and : products and absolute values of integrable functions are integrable, and pointwise order passes to their integrals.
For a nonempty subset of with , compactness, closedness and boundedness, pseudocompactness, and attainment of extrema by every continuous real-valued function are equivalent: every continuous real function on the compact interval is bounded and attains its extrema.
Proof
We first establish Taylor's integral remainder by induction on the natural order (The principle of mathematical induction). For , [F3] gives . If the remainder formula holds at order , put . The product rule and FTC give , and . Rearranging yields Thus induction yields .
Extend the last integral to by setting its kernel to zero when . With , the result is . Since is zero or has degree at most , [A1] gives .
Suppose first that . The function is continuous on because and is continuous. By [F5]–[F7], applying the integral part of to step 2.1 and interchanging the two rectangle integrals gives . Each finite evaluation term of commutes with the -integral by [F6]. Therefore . The function is uniformly continuous on the compact square by [F8], so its -integral and its finite weighted evaluations vary continuously with ; hence is continuous and integrable.
If , exactness on constants gives . For outside the finite node set, [F1] gives . It is bounded and affine between consecutive nodes. Extend each affine piece continuously to its closed subinterval; the resulting pieces are integrable by [F7] and add to an integrable piecewise function by [F6]. The kernel differs from that function at only finitely many nodes, so it is integrable and has the same integral by [F9]. Since is continuous, [F10] makes integrable; changing the kernel values at the finite node set does not change that product integral by [F9]. By [F3]–[F4] and integration by parts, , while . Subtracting gives .
By [F2] and [F11], is bounded on , so . In either case, the kernel is integrable and is integrable by [F10]. Apply monotonicity in [F10] to , and use the representation in step 3.1 or 3.2. This gives the asserted bound.
Depends on
- Peano kernel of a finite quadrature functional
- The factorial $n!$ and the falling factorial $n^{\underline{k}}$, defined by recursion in $\mathbb{N}$
- Higher derivatives and the classes $C^k$ and $C^\infty$
- For a natural $n \ge 1$ the function $x \mapsto x^{n}$ is differentiable everywhere with derivative $\iota(n)\,x^{\,n-1}$; for $n = 0$ it is the constant $1$, with derivative $0$; for a natural $n \ge 1$ the function $x \mapsto x^{-n}$ is differentiable at every $x \ne 0$ with derivative $-\iota(n)\,x^{-n-1}$; consequently every polynomial function is differentiable at every real, with the derivative computed term by term
- The chain rule, in one line from Carathéodory: if $g$ is differentiable at $c$ and $f$ is differentiable at $g(c)$, then $f \circ g$ is differentiable at $c$ with $(f \circ g)'(c) = f'(g(c))\,g'(c)$
- Sums, scalar multiples, products and quotients: $(f+g)'(c) = f'(c) + g'(c)$, $(\alpha f)'(c) = \alpha f'(c)$, $(fg)'(c) = f'(c)g(c) + f(c)g'(c)$, and $(f/g)'(c) = \bigl(f'(c)g(c) - f(c)g'(c)\bigr)/g(c)^{2}$ when $g(c) \ne 0$
- The principle of mathematical induction
- A continuous function on a closed rectangle has repeated Riemann integrals in every coordinate order, all equal to its multiple integral
- The second fundamental theorem: if $G$ is differentiable on $[a,b]$ with $G' = f$ and $f$ is integrable, then $\int_a^b f = G(b)-G(a)$
- Integrable functions on $[a,b]$ form a set closed under sums and scalar multiples, and $\int_a^b(\lambda f+\mu g) = \lambda\int_a^b f + \mu\int_a^b g$
- For $a<c<b$: $f$ is integrable on $[a,b]$ if and only if it is integrable on $[a,c]$ and on $[c,b]$, and then $\int_a^b f = \int_a^c f + \int_c^b f$; with the oriented form for arbitrary $a,b,c$
- A continuous function on $[a,b]$ is Riemann integrable, by Heine-Cantor and Riemann's criterion
- Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous
- For a nonempty subset of $\mathbb{R}^n$ with $n\ge1$, compactness, closedness and boundedness, pseudocompactness, and attainment of extrema by every continuous real-valued function are equivalent
- Changing an integrable function at finitely many points changes neither its integrability nor its integral
- If $f,g$ are integrable on $[a,b]$ then so are $\lvert f\rvert$, $f^{2}$, $fg$, $\max(f,g)$ and $\min(f,g)$, and $\bigl\lvert\int_a^b f\bigr\rvert \le \int_a^b\lvert f\rvert$
- If $f \le g$ on $[a,b]$ and both are integrable then $\int_a^b f \le \int_a^b g$; and $m(b-a) \le \int_a^b f \le M(b-a)$
Used by
Dependency tree · two levels
102 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.2 (standard reference, not scraped)