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.
The Duffy weighted product rule has an explicit bound using pure coordinate derivatives
Statement
Assume Countable Choice, let , , , and let in each coordinate on . Let and be the monic node polynomials of the pushed-forward Gauss–Jacobi rules for and , respectively. Define Then the rule of Weighted product Gauss quadrature after the Duffy transform satisfies where is the transformed amplitude from The Duffy map turns a vertex singularity into an integrable radial weight.
Facts & Assumptions
Given: Countable Choice, , , continuous on the reference triangle, the Duffy rule, and the stated coordinate smoothness of its transformed amplitude .
The Axiom of Countable Choice (): Countable Choice is used to supply the Lebesgue-density positive measures underlying the two Gaussian rules.
The Duffy map turns a vertex singularity into an integrable radial weight: the singular triangle integral equals .
Weighted product Gauss quadrature after the Duffy transform: its finite sum is the tensor product of the -node rules for and .
Gauss–Jacobi exactness and the derivative remainder: each pushed-forward one-dimensional rule has error constant and integrates the measure mass exactly.
A tensor product of two positive Gaussian rules has a derivative error bound: the tensor error is bounded by the first coordinate constant times the second mass and the first mass times the second coordinate constant.
The Jacobi weight defines a finite positive measure with full support: the weights for and define finite positive full-support measures with moments of every finite order.
The factorial and the falling factorial , defined by recursion in and Laws of finite sums and products in , and : is the positive real image of .
Proof
The exponent satisfies . By [F5] and [A1], the Jacobi weights and define finite positive measures with full support; the affine node/weight scalings in [F2] give their Gaussian rules for and .
The first measure has mass by [F6], and the second has mass . For the first affine pushforward, gives and its monic node polynomial is . Hence its squared-node-polynomial integral is . The derivative of contributes , so [F3] gives exactly as defined. The same calculation with gives . Positivity of the factorial denominator follows from [F7].
Apply [F4] to the transformed integral and tensor rule identified by [F1]–[F2]. Substituting the masses and constants from step 1.2 yields the displayed error bound.
Depends on
- Weighted product Gauss quadrature after the Duffy transform
- The Duffy map turns a vertex singularity into an integrable radial weight
- A tensor product of two positive Gaussian rules has a derivative error bound
- Gauss–Jacobi exactness and the derivative remainder
- The Jacobi weight defines a finite positive measure with full support
- The improper integral of a power at zero
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- The factorial $n!$ and the falling factorial $n^{\underline{k}}$, defined by recursion in $\mathbb{N}$
- Laws of finite sums and products in $\mathbb{N}$, and $\iota\big(\sum_{k<n} a_k\big) = \sum_{k<n} \iota(a_k)$
Used by
- Certified near-quadrature and far-multipole matrix assembly Algorithm
- A 1 over r singularity on the reference triangle Example
- Certified touching-panel and disjoint-panel quadrature for the Laplace P0 matrix Lemma
- A certified matrix defect transfers to a Galerkin error bound Theorem
Cited to discharge well-definedness by Weighted product Gauss quadrature after the Duffy transform.
Dependency tree · two levels
80 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
- Imperial College London, Numerical quadrature, Finite Element course notes, §1.6 (standard reference, not scraped)
- Christopher J. Bishop, The Riemann Mapping Theorem, Chapter 3 §3, Gauss-Jacobi quadrature lecture notes (standard reference, not scraped)