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.
GLL quadrature changes only the top Legendre modes and is p-uniformly equivalent
Statement
For every , the one-dimensional GLL rule integrates all polynomials of degree at most exactly and has positive weights. If , then For every , The same inequalities hold on affine boxes under the transported rule. If a pointwise-defined scalar coefficient is Lebesgue measurable on and satisfies throughout , the sampled form is equivalent to the exact weighted energy with lower factor and upper factor . These are p-uniform stability bounds; they do not bound the Strang consistency defect or equate quadrature with exact Galerkin assembly.
Facts & Assumptions
Given: Integer , dimension , the GLL nodes and weights, and, for the coefficient bound, a pointwise-defined scalar coefficient that is Lebesgue measurable on and has the stated bounds at every point of .
Legendre-Gauss-Lobatto nodes, weights, and tensor quadrature: the nodes are , , and the roots of , and the weights are interpolatory integrals of the degree- cardinal polynomials.
Legendre polynomials by Rodrigues' formula and their unweighted pairing and Legendre polynomials have explicit norms and weighted derivative orthogonality: has degree , leading coefficient , and .
The local tensor polynomial space and affine box conventions are those of Variable-degree conforming hp spaces on matching affine meshes.
Proof
Define ; it vanishes at all GLL nodes and has degree . For , divide any polynomial of degree at most as with and . Integration by parts gives , since the boundary term vanishes and the bracket has degree at most . The quadrature of is also zero because vanishes at every node, while the interpolatory definition integrates exactly. Thus . For , interpolatory exactness through degree is the required degree .
Divide with and . Since the leading coefficient of is , the leading coefficient of is . Integration by parts as in step 1.1 gives . The bracket has degree at most and leading coefficient , so it equals plus a polynomial of degree below ; orthogonality [F2] therefore gives . Since and , it follows that .
Write any degree- polynomial as with . Step 1.1 integrates and exactly, so step 2.1 gives , where . For a cardinal polynomial , by its nodal values, while the displayed identity gives . Thus all quadrature weights are positive and the one-dimensional squared norm ratio is between and .
Expand a tensor polynomial in the orthogonal basis , . The tensor quadrature and exact integral are both diagonal on this basis: every cross term is exact by step 1.1, and each diagonal factor has ratio unless , when step 3.1 bounds it by . Multiplying the coordinate factors proves the mass norm bounds. Each coordinate derivative of a tensor polynomial is still in , so applying the same tensor norm bounds to each component and summing proves the gradient bounds.
An affine change of variables multiplies both exact integrals and the transported quadrature by the same positive Jacobian. Apply the unweighted bounds of step 4.1 to each physical gradient component pulled back to the reference cube. The measurable bounded coefficient makes integrable on the bounded box, and its specified values on define every quadrature sample. Positivity of the weights and the pointwise bounds give and the analogous inequalities for the exact integral; combine them with step 4.1 to obtain the stated weighted comparison. The constants are independent of .
Depends on
Used by
Dependency tree · two levels
13 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
- Saul A. Teukolsky, Short note on the mass matrix for Gauss-Lobatto grid points (standard reference, not scraped)
- Lucas Johannes Petrus Timmermans, Analysis of Spectral Element Methods with Application to Incompressible Flow (standard reference, not scraped)