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 two-node Gaussian Nyström rule solves a rank-two separable equation exactly
Example
Assume Countable Choice. Let be Lebesgue measure on , take , , and set and . The equation has the unique solution The two-node Gaussian rule for gives the exact same solution and a nonsingular two-by-two grid system. The continuous integrals can equivalently be read as Riemann integrals under Countable Choice.
Facts & Assumptions
Given: Countable Choice, Lebesgue measure on , the kernel with , , and .
The Axiom of Countable Choice () and A bounded Riemann integrable function on a closed bounded interval is Lebesgue measurable and has the same integral: for continuous integrands, the Riemann and Lebesgue integrals on agree under Countable Choice.
Positive-measure Gaussian quadrature moment data: an order- datum is a finite positive measure of positive mass whose support has at least points and whose moments through degree are finite; for this example, the Lebesgue measure on meets these conditions by [F6] and [F7].
The m-node Gaussian quadrature rule for a positive measure: the Gaussian rule uses its two nodes and weights to approximate integration against .
Gaussian quadrature is exact through degree 2m−1 and has positive weights: for this order-3 datum, for every polynomial of degree at most .
Nyström quadrature operators and their reconstructed equations: the Nyström equation replaces each integral by its quadrature rule and reconstructs from its nodal values.
Finite-node Nyström equations are equivalent to their reconstructed equations: solutions of the grid system reconstruct function solutions, and the nullspaces of its matrix and reconstructed operator are linearly isomorphic.
The relative Lebesgue measure of is , and every relatively open neighborhood of , , or contains a closed subinterval of positive length. Each such interval has its length as measure (A box in with parameters is Lebesgue measurable of measure , whichever of its faces are included), so all three points lie in the relative support of .
The functions for are continuous, bounded, and Riemann integrable (A continuous function on is Riemann integrable, by Heine-Cantor and Riemann's criterion). Under [A1] they are Lebesgue integrable with finite moments, so the order-3 moment condition holds.
For , the Riemann moment is by the Riemann–Stieltjes fundamental theorem applied to (The two FTC forms for a Riemann–Stieltjes integral with a integrator, 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); [A1] gives the same Lebesgue moments.
The Riemann integral is linear on continuous functions on (Integrable functions on form a set closed under sums and scalar multiples, and ).
Verification
Given: The data above and the two moments , of a solution.
By [A1], the continuous integrands may be integrated as Riemann integrals. Since , any solution is affine and has the form . Integrating this identity against and against , using [F8] for the moments and [F9] for linearity, gives At the specified parameters the determinant is , and solving gives , , hence .
The datum conditions in [F1] hold by [F6] and [F7]. The function is affine and is quadratic, so [F3] gives and . Substituting these two exact quadrature moments into the Nyström formula [F4] yields for every ; thus the continuous solution is also a Nyström solution.
Any solution of the inhomogeneous two-node Nyström equation has the form , hence is affine. Exactness [F3] then makes its two Lebesgue moments satisfy the same nonsingular system in step 1.1, so those moments and the reconstructed function are unique; step 2.1 supplies existence. A nonzero vector in the grid-matrix kernel would, by the nullspace correspondence [F5], give a nonzero homogeneous solution, which could be added to this solution and contradict uniqueness. Thus the grid matrix is nonsingular, and its reconstruction is the displayed solution.
Depends on
- Nyström quadrature operators and their reconstructed equations
- Finite-node Nyström equations are equivalent to their reconstructed equations
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Positive-measure Gaussian quadrature moment data
- The m-node Gaussian quadrature rule for a positive measure
- Gaussian quadrature is exact through degree 2m−1 and has positive weights
- A bounded Riemann integrable function on a closed bounded interval is Lebesgue measurable and has the same integral
- A box in $\mathbb{R}^n$ with parameters $a_i\le b_i$ is Lebesgue measurable of measure $\prod_{i<n}(b_i-a_i)$, whichever of its faces are included
- A continuous function on $[a,b]$ is Riemann integrable, by Heine-Cantor and Riemann's criterion
- The two FTC forms for a Riemann–Stieltjes integral with a $C^1$ integrator
- 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
- 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$
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
99 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)