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.
Gaussian quadrature — Examples
1 · Prerequisites
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Cyclic Groups and Direct Products
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Fundamental Trigonometric Identities
- Gaussian quadrature
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Outward rounded interval and ball arithmetic
- Polynomial interpolation and remainder
- Polynomial Rings, the Division Algorithm and Roots
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Simple Field Extensions and the Construction of the Complex Numbers
- Splitting Fields
- Subspaces, Products, and Quotients
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The Topology of Euclidean Space
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
The examples compute the two-node Gauss–Legendre rule from its moments and Jacobi matrix, derive positive two-node weights from cardinal-polynomial squares, and count the nodes and exactness range of a four-coordinate tensor rule. The Legendre example states its countable-choice assumption where the library's Lebesgue measure construction requires it.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Two Gaussian weights are the squared norms of the two cardinal polynomials
Example
Let be Gaussian moment data, with distinct Gaussian nodes and weights . Its cardinal polynomials are The degree-three exactness theorem implies where for .
Facts & Assumptions
Given: Moment data of order , its two-node Gaussian rule, and its distinct nodes .
Gaussian quadrature is exact through degree 2m−1 and has positive weights: the rule is exact through degree and .
Cardinal-polynomial interpolation and Cardinal interpolation functions are polynomials of the stated degrees: the displayed are degree one and satisfy for and otherwise.
Positive-measure Gaussian quadrature moment data and The Lebesgue integral is linear on : for , , and integration distributes over the finite polynomial expansion.
Proof
Since , exactness [F2] gives . Expanding the finite rule sum [F1] and using the cardinal values [F3] gives , hence .
The formula for gives . Integrating term by term using [F4] proves the displayed expression for . Replacing the omitted node by gives the displayed expression for . Their strict positivity is [F2].
Four two-node Gaussian rules give a sixteen-node tensor rule
Example
Take four coordinate moment data sets, each with a two-node Gaussian rule . The tensor rule has node set so it has distinct nodes. It is exact for every coordinatewise polynomial with degree at most three in each variable. In particular,
Facts & Assumptions
Given: Four order-three moment data sets and their two-node Gaussian rules.
Tensor-product Gaussian quadrature: the tensor nodes are all coordinate tuples and the tensor weights are products of the coordinate weights.
Coordinatewise product-moment functional for tensor polynomials: the product-moment functional on a coordinate monomial is the product of its coordinate moments.
Tensor-product Gaussian quadrature preserves coordinatewise exactness: the tensor rule is exact for the stated coordinatewise degree ranges and has the product number of distinct nodes.
Gaussian quadrature is exact through degree 2m−1 and has positive weights: each coordinate rule integrates every degree-at-most-three monomial exactly.
The Gauss orthogonal polynomial has simple roots inside the interval: each two-node Gaussian rule has distinct nodes.
Proof
Since each coordinate has two distinct nodes by [F5], the sixteen coordinate tuples are distinct: two different tuples differ in a coordinate whose node entries are distinct.
The node-count statement of [F3] gives . For each coordinate degree , [F4] evaluates the corresponding one-dimensional sum as its moment. Distributing the finite sums in [F1] therefore gives the product of those four moments, which is [F2]. Taking the specified exponents proves the displayed calculation and the general coordinatewise exactness claim.
The two-node Gauss–Legendre rule is exact through degree three
Example
Assume the Axiom of Countable Choice and take Lebesgue measure restricted to the relative Borel sets of . Its relative support is all of , so it gives order-three moment data for . The moments are , , , and . The monic orthogonal polynomials through degree two are , , and . Thus the Gaussian nodes are and .
The Jacobi matrix is Its unit eigenvectors and give weights . Therefore is exact for every real polynomial of degree at most three.
Facts & Assumptions
Given: Countable choice and Lebesgue measure on restricted to relative Borel sets.
The Axiom of Countable Choice (): the Axiom of Countable Choice is assumed for the Lebesgue measure and Riemann–Lebesgue results used in this example.
The Axiom of Countable Choice (), Assuming countable choice, is a sigma-algebra containing every elementary set and is a complete measure extending elementary volume, and Assuming countable choice, every Borel subset of is Lebesgue measurable: under countable choice, the restriction is a positive measure on the relative Borel sets.
A box in with parameters is Lebesgue measurable of measure , whichever of its faces are included: a closed interval has measure its length; every positive-length subinterval of has positive measure.
A continuous function on is Riemann integrable, by Heine-Cantor and Riemann's criterion, The second fundamental theorem: if is differentiable on with and is integrable, then , 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, and A bounded Riemann integrable function on a closed bounded interval is Lebesgue measurable and has the same integral: under countable choice, the Lebesgue moments of equal their ordinary integrals, which can be evaluated by polynomial primitives.
Monic orthogonal polynomials exist uniquely through the quadrature order: checking the orthogonality equations identifies the monic polynomials uniquely.
Monic orthogonal polynomials satisfy a three-term recurrence: the normalized recurrence coefficients form the displayed symmetric Jacobi matrix.
The Jacobi matrix spectrum is the set of Gauss nodes: its eigenvalues are the Gaussian nodes.
Gaussian weights equal the total mass times a Jacobi eigenvector's first-coordinate square: a unit eigenvector at a node gives weight times the square of its first coordinate.
Gaussian quadrature is exact through degree 2m−1 and has positive weights: the two-node rule is exact through degree .
The absolute value makes a metric space: is a metric, its open balls are the intervals , and it is unbounded, Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace and The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement: the usual real topology is its absolute-value metric topology, and every relative open neighborhood contains the intersection of with an open metric ball about its point.
The Borel sigma-algebra of a subspace is the trace of the ambient Borel sigma-algebra: every relative Borel set of is for an ambient real Borel set .
Nonnegative real square roots exist uniquely: every positive real has a unique positive square root.
Proof
By [F10], every relative Borel set is for ambient Borel . The interval is closed, hence ambient Borel, so this intersection is ambient Borel and is Lebesgue measurable by [F1]. Restricting Lebesgue measure to this sigma-algebra therefore defines the asserted positive measure; disjoint relative Borel unions are the same ambient measurable unions, so countable additivity is inherited. For , [F9] gives an such that lies in any chosen relative open neighborhood of . Choose a closed interval of positive length inside that intersection, using a one-sided interval when is an endpoint. Then is relative Borel and [F2] gives . Since and both sets are relative Borel, countable additivity and nonnegativity from [F1] imply . Thus every lies in the relative support, which has at least three points.
The functions are continuous, hence Riemann integrable by [F3]. Their primitives , evaluated at and , give respectively . The Riemann–Lebesgue equality in [F3] gives the stated moment values.
The monic polynomials and are orthogonal in the required degrees: . The monic polynomial is orthogonal to because , and to because . Uniqueness [F4] identifies as stated. By [F11], exists uniquely. The identity gives exactly the two roots .
Here , , and both recurrence diagonal entries are zero by the odd moments. Hence , and [F5] gives the displayed . Direct multiplication shows its two displayed unit eigenvectors have eigenvalues and ; [F6] identifies those as the Gaussian nodes.
For either unit eigenvector, the first-coordinate square is . Applying [F7] with gives each weight as . Exactness through degree three is [F8], proving the stated rule.
5 · Examples, counterexamples and false statements
None yet.