Alphabeta Math
Pipeline-generated
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.

✓ 17 results · all verified · 14 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 3 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Singular and infinite interval quadrature

1 · Prerequisites

2 · Summary

This page develops four scoped tools for difficult quadrature domains. For endpoint factors (x−a)α(b−x)β with α,β>−1, it constructs the positive Jacobi measure, defines its Gaussian rule, and proves exactness and a derivative error bound. Explicit endpoint power substitutions regularize finitely many logarithmic factors under stated derivative-order conditions.

For finite-interval, half-line, and whole-line maps, the finite trapezoid procedure separates the analytic-strip discretization estimate from the double-exponential tail estimate. Its error theorem is conditional on both hypotheses; integrability by itself supplies neither. The Cauchy principal-value definition is symmetric about the pole, and subtracting the pole value leaves a continuous quotient plus the explicit logarithmic term.

The reference-triangle Duffy map has Jacobian r and turns a vertex singularity ∥(x,y)∥−α, α<2, into the integrable weight r1−α. A weighted product Gaussian rule then has a bound in terms of pure coordinate derivatives. These results concern a flat reference triangle; curved or surface boundary-element mappings remain outside this page's claims.

The square-to-triangle map is shown schematically below. In the source square, r is horizontal and s is vertical; in the target triangle, x is horizontal and y is vertical.

\begin{tikzpicture}[scale=0.9,>=stealth]
  \coordinate (S00) at (0,0);
  \coordinate (S10) at (2,0);
  \coordinate (S01) at (0,2);
  \coordinate (S11) at (2,2);
  \coordinate (T00) at (5,0);
  \coordinate (T10) at (7,0);
  \coordinate (T11) at (7,2);
  \draw[thick] (S00)--(S10)--(S11)--(S01)--cycle;
  \draw[dashed,red,thick] (S00)--(S01);
  \draw[thick] (T00)--(T10)--(T11)--cycle;
  \fill (S00) circle (1.5pt) node[below left] {$(0,0)$};
  \fill (S10) circle (1.5pt) node[below right] {$(1,0)$};
  \fill (S01) circle (1.5pt) node[above left] {$(0,1)$};
  \fill (S11) circle (1.5pt) node[above right] {$(1,1)$};
  \fill (T00) circle (1.5pt) node[below left] {$(0,0)$};
  \fill (T10) circle (1.5pt) node[below right] {$(1,0)$};
  \fill (T11) circle (1.5pt) node[above right] {$(1,1)$};
  \node at (1,-0.55) {$[0,1]^2_{r,s}$};
  \node at (6,-0.55) {$T_{x,y}$};
  \node[red] at (-0.55,1) {$r=0$};
  \draw[->] (2.55,1)--(4.35,1) node[midway,above] {$D(r,s)=(r,rs)$};
\end{tikzpicture}

The top edge s=1 maps to y=x, the bottom edge s=0 maps to y=0, the right edge r=1 maps to x=1, and the dashed left edge r=0 collapses to (0,0). These correspondences follow by substituting the edge equations into D(r,s)=(r,rs); the local lemma also computes det⁡DD(r,s)=r. The picture is schematic and records the coordinate convention only: the Jacobian and integral identity are proved algebraically on the truncated rectangles, without relying on the diagram.

3 · Logical flowchart

4 · Definitions, theorems and proofs

AlgorithmAlgorithm: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Finite truncated tanh–sinh, exp–sinh, and sinh–sinh trapezoid rules

Definition

Input a real function f that is continuous on the interior of the selected target domain, a step h>0, nonnegative integers N−,N+, and exactly one domain mode. The finite rule evaluates f only at interior points:

  1. Finite interval (a,b), a<b. Put m=(a+b)/2, d=(b−a)/2, s(t)=sinh⁡t=(et−e−t)/2, c(t)=cosh⁡t=(et+e−t)/2, and ψ(t)=tanh⁡((π/2)s(t)), where tanh⁡u=sinh⁡u/cosh⁡u. Set x(t)=m+dψ(t), x′(t)=d(π/2)c(t)/cosh⁡2((π/2)s(t)), and Φ(t)=f(x(t))x′(t).
  2. Positive half-line (0,∞). Here f is continuous on (0,∞). Set x(t)=exp⁡((π/2)s(t)), x′(t)=x(t)(π/2)c(t), and Φ(t)=f(x(t))x′(t).
  3. Whole line R. Here f is continuous on R. Set x(t)=sinh⁡((π/2)s(t)), x′(t)=cosh⁡((π/2)s(t))(π/2)c(t), and Φ(t)=f(x(t))x′(t).

Return the finite sum Th,N−,N+(f)=h∑k=−N−N+Φ(kh). The algorithm makes no accuracy claim from integrability alone. Analytic-strip and tail hypotheses required for an error certificate are stated in A finite double-exponential trapezoid has separate strip and tail errors ↗.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

The reference-triangle Duffy map from a vertex

Definition

Let S=[0,1]2 and let T={(x,y):0≤y≤x≤1} be the reference triangle. The vertex Duffy map is D:S→T, D(r,s)=(r,rs). Its image, inverse for r>0, and Jacobian determinant are verified in The reference-triangle Duffy map has the stated image and Jacobian ↗. The change-of-variables use and endpoint limit for weak singularities are proved in The Duffy map turns a vertex singularity into an integrable radial weight ↗.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

The first divided difference of a C1 function extends continuously

Statement

Let a<c<b and f∈C1([a,b]). Define g(x)=(f(x)−f(c))/(x−c) for x≠c and set g(c)=f′(c). Then g is continuous on [a,b].

Facts & Assumptions

Given: Reals a<c<b and f∈C1([a,b]).

[F1]

Higher derivatives and the classes Ck and C∞: f∈C1 means f and its first derivative are continuous on the interval, with one-sided endpoint derivatives.

Proof

1.1givenF1algebra

On [a,b]∖{c} the numerator and denominator are continuous and the denominator is nonzero, so their quotient g is continuous at every point other than c.

2.1givenF2algebra∎

By the derivative limit in [F2], the quotient defining g(x) tends to the assigned value f′(c)=g(c) as x→c. Thus g is continuous at c as well, and hence on the whole interval.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

A double-exponential envelope bounds the omitted trapezoid tails

Statement

Let A,B,κ>0, T≥0, and let Φ:R→C be continuous with ∣Φ(t)∣≤Aexp⁡(−Bexp⁡(κ∣t∣))(∣t∣≥T). For h>0 and nonnegative integers N−,N+ with N−h,N+h≥T, one has ∫∣t∣>N−h on the left, N+h on the right∣Φ(t)∣ dt≤AκB(e−BeκN−h+e−BeκN+h), where the left and right integral means ∫−∞−N−h+∫N+h∞. The omitted trapezoid samples obey the same bound: h∑k<−N− or k>N+∣Φ(kh)∣≤AκB(e−BeκN−h+e−BeκN+h).

Facts & Assumptions

Given: A,B,κ>0, T≥0, a continuous Φ satisfying the stated envelope, h>0, and N±h≥T.

Proof

1.1givenF1F3F4algebra

For u0=BeκS, finite-interval substitution from [F3] gives ∫SRe−Beκtdt=1κ∫u0BeκRe−uu du. For u≥u0>0, 1/u≤1/u0, so the right side is at most e−u0/(κu0) after taking R→∞; the endpoint limit follows from [F4]. Since S≥0, eκS≥1, and each continuous one-sided tail is bounded by e−BeκS/(κBeκS)≤e−BeκS/(κB).

2.1givenstep 1.1algebra

Apply step 1.1 with S=N−h to t↦∣Φ(−t)∣ and with S=N+h to t↦∣Φ(t)∣, using the envelope. Adding proves the asserted integral bound and absolute integrability of both tails.

2.2givenF1F2step 1.1algebra

The function g(t)=Ae−Beκt is nonincreasing for t≥0, since its derivative is −ABκeκte−Beκt<0 by [F1]–[F2]. For every integer k>N+, hg(kh)≤∫(k−1)hkhg(t)dt; summing finite partial tails and taking their increasing limit bounds the right omitted samples by ∫N+h∞g(t)dt. The same comparison for g(−t) bounds the left tail, and step 1.1 gives the stated sum bound.

3.1step 2.1step 2.2∎

The two bounds in steps 2.1 and 2.2 are finite and have the displayed right-hand side, proving both claims.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

A sufficiently high power regularizes finite logarithmic endpoint factors

Statement

Let r,m be nonnegative integers and γ>r. Define u(t)=tγ(log⁡t)m for 0<t≤1 and u(0)=0. Then u∈Cr([0,1]) in the sense of Higher derivatives and the classes Ck and C∞, and u(j)(0)=0 for 0≤j≤r.

Facts & Assumptions

Given: Natural numbers r,m, a real exponent γ>r, and the function u above.

[F2]
[F5]

Higher derivatives and the classes Ck and C∞: membership in Cr means that derivatives through order r exist and are continuous, with one-sided endpoint derivatives.

[F6]

The exponential dominates every fixed nonnegative integer power at +∞: yd/ecy→0 as y→∞ for each nonnegative integer d and c>0.

[F7]

Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: log⁡ is strictly increasing; together with [F1], this gives −log⁡t→+∞ as t↓0.

Proof

1.1givenF1F2F3induction

For t>0, induction using [F2]–[F3] gives u(j)(t)=tγ−jPj(log⁡t), where P0(z)=zm and Pj+1(z)=(γ−j)Pj(z)+Pj′(z). Each Pj is a polynomial of degree at most m.

2.1F1F4F6F7step 1.1algebra

If δ>0 and P is a polynomial, put y=−log⁡t. For every real M, 0<t<exp⁡(−M) implies log⁡t<−M by [F1] and [F7], so y→+∞ as t↓0. Then tδ∣P(log⁡t)∣=e−δy∣P(−y)∣: for some C>0 and integer d, ∣P(−y)∣≤C(1+yd) for y≥1, while [F4] and [F6] give (1+yd)e−δy→0. Since γ−j>0 for every j≤r, step 1.1 therefore shows u(j)(t)→0 at zero.

3.1givenF5step 1.1step 2.1algebra∎

Set u(j)(0)=0 for j≤r. Continuity at zero follows from step 2.1. For j<r, the difference quotient of this extension at zero is tγ−j−1Pj(log⁡t), which tends to zero by step 2.1 because γ−j−1>0; hence the derivative at zero equals the defined u(j+1)(0). Thus the derivatives through order r exist and are continuous on [0,1] by the definition [F5].

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

The improper integral of a power at zero

Statement

For every real γ>−1, the improper Riemann integral of xγ on (0,1] converges and ∫01xγ dx=1γ+1.

Facts & Assumptions

Given: A real exponent γ>−1.

[F2]

Continuity and derivatives of positive-base real powers: on (0,∞), x↦xq is continuous and differentiable with derivative qxq−1 for every real q.

[F3]
[F4]

The exponential tends to +∞ at +∞ and to 0 at −∞: exp⁡(u)→0 as u→−∞.

[F5]

The second fundamental theorem: if G is differentiable on [a,b] with G′=f and f is integrable, then ∫abf=G(b)−G(a): on every closed interval [ε,1] with ε>0, the integral of a continuous derivative equals the endpoint increment of its primitive.

Proof

1.1givenF2F5algebra

Put q=γ+1>0. For 0<ε<1, the function x↦xq/q is differentiable on [ε,1] with derivative xq−1=xγ by [F2]. Applying [F5] gives ∫ε1xγ dx=(1−εq)/q.

1.2givenF1F3F4algebra

As ε↓0, log⁡ε→−∞: for any real M, 0<ε<exp⁡(M) implies log⁡ε<M by [F1] and [F3]. Hence qlog⁡ε→−∞ and εq=exp⁡(qlog⁡ε)→0 by [F1] and [F4].

2.1givenstep 1.1step 1.2algebra∎

Taking ε↓0 in step 1.1 using step 1.2 proves convergence of the improper integral and gives its value 1/q=1/(γ+1).

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

An analytic-strip error bound for the infinite trapezoid sum

Statement

Let d>0, 0<a<d, h>0, and let F be holomorphic on the strip Sd={z∈C:∣Im⁡z∣<d} and continuous on its closed substrip ∣Im⁡z∣≤a. Suppose there are C,η>0 such that ∣F(x+iy)∣≤Ce−η∣x∣(x∈R, ∣y∣≤a). Put I=∫RF(x) dx and I±=∫R∣F(x±ia)∣ dx. Then the infinite trapezoid sum converges absolutely and ∣I−h∑k∈ZF(kh)∣≤I++I−e2πa/h−1.

Facts & Assumptions

Given: The strip hypotheses above, a,h>0, and the complex exponential/trigonometric conventions.

[F3]
[F4]

The residue theorem for a null-homologous cycle: for a meromorphic function on an open domain and an admissible cycle, the contour integral equals 2πi times the sum of residues multiplied by the corresponding winding indices. Admissibility means that the cycle avoids poles and has index zero outside the domain (Admissible cycles for the residue theorem, Null-homologous cycles and homologous cycles in an open set).

[F6]

The winding number is the increment of a continuous argument divided by 2π: the index is the increment of a continuous argument divided by 2π. The winding number vanishes on the unbounded component of the complement of the trace: it is zero on the unbounded component outside the trace.

[F7]

Goursat's theorem for rectangles: a holomorphic function integrates to zero around every rectangle contained in its domain: a holomorphic function integrates to zero around a rectangle whose filled interior and boundary lie in its open domain.

[F8]

Linearity, product, reciprocal, and quotient rules for complex derivatives and The chain rule for complex derivatives: products, compositions, and quotients with nonzero denominator are holomorphic. Residues of p over q at a simple zero of q: a quotient of holomorphic functions with simple denominator zero has residue equal to the numerator value divided by the denominator derivative; a zero numerator makes that singularity removable.

Proof

1.1F2F3F8givenalgebraF1

Define Kh(z)=πihe2πiz/h+1e2πiz/h−1. By [F2] and [F3], its poles are exactly z=kh, k∈Z: if the denominator vanishes, its modulus gives Im⁡z=0, and Euler's formula then gives 2πz/h=2jπ. At each such point the denominator has derivative 2πi/h and the numerator is 2, so Kh has residue 1. By [F8], FKh is holomorphic away from these points and has a simple pole with residue F(kh) when F(kh)≠0, or a removable singularity with residue zero when F(kh)=0; fill in each removable value. Thus it is meromorphic on the strip.

2.1F4F6step 1.1constructalgebra

Fix N≥0 and R=(N+12)h. Let ΓR traverse the rectangle [−R,R]+i[−a,a] counterclockwise, beginning at R−ia. It is a closed piecewise linear contour inside Sd. No kh lies on its boundary: the horizontal edges have nonzero imaginary part and R/h=N+1/2 is not an integer. Every exterior point belongs to the unbounded component of the complement of this rectangle boundary, since it can be joined to infinity along an outward horizontal or vertical ray; hence its index is zero by [F6]. For an interior point p, each ray from p meets the boundary exactly once, and along a positive edge z(t) one has Im⁡(z′(t)/(z(t)−p))>0, because p lies strictly to the left of that edge. The continuous argument therefore increases through exactly one full turn, so [F6] gives index one. In particular ΓR is null-homologous in Sd. Together with the meromorphicity and boundary check above, this is precisely the admissibility required in [F4]. Its enclosed possible poles are exactly kh, −N≤k≤N, each of index one; removable points contribute zero. Thus ∫ΓRFKh dz=2πi∑k=−NNF(kh).

3.1F2givenstep 2.1algebra

On the upper edge, ∣e2πi(x+ia)/h∣=ρ:=e−2πa/h<1 and ∣Kh(x+ia)+πih∣=2πh∣e2πi(x+ia)/he2πi(x+ia)/h−1∣≤2π/he2πa/h−1. On the lower edge, the analogous estimate is ∣Kh(x−ia)−πi/h∣≤(2π/h)/(e2πa/h−1). On either vertical edge, e2πiz/h is negative real and ∣Kh(z)∣≤π/h. The vertical integrals therefore tend to zero as N→∞ by the uniform strip bound in the statement.

4.1F4F7givenstep 2.1step 3.1

[F7] applies to F on each filled rectangle [−R,R]+i[0,a] and [−R,R]+i[−a,0], since both compact rectangles lie inside the open strip Sd where F is holomorphic. Their positively oriented boundaries have no poles at all, including their real edges. Their zero contour integrals and the same vanishing vertical-side bound for F show ∫RF(x±ia) dx=I. Replacing Kh on the two long edges of step 2.1 by its constants ∓πi/h, the residue identity becomes h∑k=−NNF(kh)=12(∫−RRF(x−ia) dx+∫−RRF(x+ia) dx)+EN, where ∣EN∣≤(∫−RR∣F(x−ia)∣dx+∫−RR∣F(x+ia)∣dx)/(e2πa/h−1)+o(1) as N→∞.

5.1givenF5step 4.1∎

The real and horizontal sums and integrals converge absolutely by the exponential bound. Letting N→∞ in step 4.1, the average tends to I and the error term is at most (I−+I+)/(e2πa/h−1). This proves the assertion.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

A tensor product of two positive Gaussian rules has a derivative error bound

Statement

Let a<b and c<d and let [a,b], [c,d] be compact intervals. Let μ,ν be finite positive measures on them, respectively. Assume each has valid Gaussian moment data of orders 2n−1 and 2n for the same n and measure: the order-2n−1 datum defines its n-node Gaussian rule Qμ,Qν, while the stronger datum supplies the Hermite remainder. (It suffices that the measure has support with at least n+1 points and finite absolute moments through degree 2n.) Write Mμ=μ([a,b]), Mν=ν([c,d]), and Kμ=1(2n)!R∫pμ2 dμ,Kν=1(2n)!R∫pν2 dν, where pμ,pν are their monic node polynomials. Suppose G:[a,b]×[c,d]→R and its pure partial derivatives through order 2n in each coordinate are continuous on the rectangle. Then the tensor rule QμQνG satisfies ∣∫[a,b]∫[c,d]G(x,y) dν(y)dμ(x)−QμQνG∣≤KμMν∥∂x2nG∥∞+MμKν∥∂y2nG∥∞.

Facts & Assumptions

Given: Two finite positive order-2n Gaussian moment data, their n-node rules, and a function with the stated continuous pure partial derivatives.

[F1]

Positive-measure Gaussian quadrature moment data and The m-node Gaussian quadrature rule for a positive measure: order-2n data require finite absolute moments through 2n; discarding the last moment condition gives the same measure's order-2n−1 data used to define the Gaussian rules.

[F2]

Gaussian quadrature is exact through degree 2m−1 and has positive weights: each rule has positive weights summing to its measure's total mass.

[F3]

Gaussian quadrature has the Hermite mean-value remainder: for u∈C2n, each one-coordinate error has absolute value at most Kμ∥u(2n)∥∞ or Kν∥u(2n)∥∞, respectively.

[F5]

Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous: each continuous partial derivative on the compact rectangle is uniformly continuous.

[F6]

The Borel sigma-algebra of a topological space and Integrable real and complex functions, and their integrals: continuous bounded functions on the compact intervals are Borel measurable and integrable for the finite measures.

[F7]

Monotonicity and nonnegative homogeneity of the nonnegative integral and The Lebesgue integral is linear on L1(μ): ∣∫v dν∣≤Mν∥v∥∞, bounded integrands are integrable, and finite integral differences distribute linearly.

[F9]

For a nonempty subset of Rn with n≥1, compactness, closedness and boundedness, pseudocompactness, and attainment of extrema by every continuous real-valued function are equivalent: the rectangle is closed and bounded in R2, hence compact, and its continuous real-valued partial derivatives attain finite extrema, so their supremum norms are finite.

Proof

1.1F1F4F5F6F7F9givenconstruct

By [F9], the continuous partial derivatives are bounded on the compact rectangle; they are Borel and their integrals exist by [F1, F6]–[F7]. Define H(x)=∫[c,d]G(x,y)dν(y). For 0≤j<2n, the difference quotient of ∂xjG in x differs from ∂xj+1G(x,y) by a quantity tending uniformly in y to zero: by [F4], the quotient is the average of ∂xj+1G(u,y) between x and x+h, and [F5] makes that derivative uniformly continuous. Integrating the uniform error changes it by at most Mν times its supremum by [F7], so induction gives H∈C2n and H(2n)(x)=∫∂x2nG(x,y)dν(y).

1.2F2F3F8givenalgebra

Expand Qμ(H)−QμQνG=∑iwi(∫G(xi,y)dν(y)−Qν(G(xi,⋅))). The positive weights in [F2] sum to Mμ, and [F3] bounds each parenthesized error by Kν∥∂y2nG∥∞. Therefore this term has absolute value at most MμKν∥∂y2nG∥∞.

2.1F3step 1.1algebra

Apply [F3] to H under μ. The derivative formula in step 1.1 gives ∣∫H dμ−Qμ(H)∣≤KμMν∥∂x2nG∥∞.

3.1step 2.1step 1.2algebra∎

The iterated integral minus the tensor rule is the sum of the errors in steps 2.1 and 1.2. The triangle inequality gives the stated bound.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Symmetric Cauchy principal value by subtraction

Definition

Let a<c<b and f∈C1([a,b]). The symmetric Cauchy principal value of f(x)/(x−c), when the limit exists, is PV⁡ ⁣∫abf(x)x−c dx:=lim⁡ε↓0(∫ac−εf(x)x−c dx+∫c+εbf(x)x−c dx), where 0<ε<min⁡(c−a,b−c). The first divided difference of a C1 function extends continuously supplies the continuous subtraction remainder; the existence and value of the limit are proved in The Cauchy principal-value subtraction identity ↗.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

The reference-triangle Duffy map has the stated image and Jacobian

Statement

For the map D(r,s)=(r,rs) of The reference-triangle Duffy map from a vertex, the image of [0,1]2 is T={(x,y):0≤y≤x≤1}. On r>0 it has inverse (x,y)↦(x,y/x) and Jacobian determinant r; the edge r=0 maps to (0,0).

Facts & Assumptions

Given: The map D(r,s)=(r,rs) on the square [0,1]2.

[F1]

The reference-triangle Duffy map from a vertex: D(r,s)=(r,rs) and T={(x,y):0≤y≤x≤1}.

[F2]

Continuously differentiable maps, local inverses, and local diffeomorphisms: a map on an open Euclidean set is C1 when all components are differentiable with continuous derivative entries; a local inverse is the inverse of a bijective restriction.

[F3]

The Jacobian determinant of a square-dimensional C1 map is the determinant of its Jacobian matrix: the Jacobian determinant is the determinant of the derivative matrix.

Proof

1.1F1F2F3algebra

For an increment (h,k), D(r+h,s+k)−D(r,s)=(h,sh+rk+hk). The linear part (h,sh+rk) has matrix (10sr), while the remainder has Euclidean norm ∣hk∣≤(h2+k2)/2; divided by ∥(h,k)∥2=h2+k2 it tends to zero. Thus this is the total derivative. Its entries are continuous, so the polynomial extension is C1 on R2 by [F2]; its determinant is r by [F3].

2.1F1step 1.1givenalgebra∎

If 0≤r,s≤1, then 0≤rs≤r≤1, so D(r,s)∈T. Conversely, for (x,y)∈T with x>0, r=x and s=y/x lie in [0,1] and map to (x,y); when x=0, y=0 and every (0,s) maps to the vertex. For r>0, the displayed inverse is unique. This proves the image, inverse, and collapsed-edge claims.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passOpen item page →

A power above exponent minus one is Lebesgue integrable at zero

Statement

Assume the Axiom of Countable Choice. For γ>−1, define gγ(0)=0 and gγ(x)=xγ for 0<x≤1. Then gγ is Lebesgue measurable and integrable on [0,1], with ∫[0,1]gγ dλ=1γ+1.

Facts & Assumptions

Given: Countable Choice and a real exponent γ>−1.

[A1]

The Axiom of Countable Choice (ACω): every sequence of nonempty sets has a choice function; this is the assumption used by the construction of Lebesgue measure.

[F2]

Assuming countable choice, every Borel subset of Rn is Lebesgue measurable: under [A1], Borel sets are Lebesgue measurable. A nonnegative measurable function multiplied by the indicator of a measurable set remains measurable, and increasing limits of measurable functions are measurable (Closure properties of measurable functions used by the integral).

[F3]

The improper integral of a power at zero: for every γ>−1, lim⁡ε↓0∫ε1xγ dx=1/(γ+1).

[F4]

Continuity and derivatives of positive-base real powers: xγ is continuous on (0,∞) and has derivative γxγ−1 there.

[F5]

The second fundamental theorem: if G is differentiable on [a,b] with G′=f and f is integrable, then ∫abf=G(b)−G(a): on a compact interval bounded away from zero, the integral of the derivative of a primitive equals its endpoint increment.

[F7]

A bounded Riemann integrable function on a closed bounded interval is Lebesgue measurable and has the same integral: a bounded Riemann-integrable function is Lebesgue measurable and its Lebesgue integral equals its Riemann integral.

[F8]

Monotone convergence for the integral: nonnegative measurable functions increasing pointwise to g have integrals increasing to ∫g dλ.

Proof

1.1givenA1F2F4F6F9construct

For each integer n≥2, define gn(x)=xγ on [1/n,1] and gn(x)=0 on [0,1/n). For every real c, its strict superlevel is all of [0,1] if c<0, and [1/n,1]∩{x>0:xγ>c} if c≥0. The latter is Borel because the power is continuous on (0,∞) by [F4]; hence [F2] makes gn measurable, and gn≥0. By [F9], xγ is bounded on [1/n,1], so gn is bounded and continuous on each side of its only possible jump at 1/n; isolating that point in an interval of arbitrarily small length and using uniform continuity on the two remaining compact pieces makes its Darboux gap arbitrarily small, so [F6] gives Riemann integrability.

2.1F1F4F5F7step 1.1algebra

The equality of Riemann and Lebesgue integrals in [F7], followed by [F4] and [F5] on [1/n,1], gives ∫gn dλ=∫1/n1xγ dx=(1−n−(γ+1))/(γ+1). The sequence gn is nondecreasing and converges pointwise to gγ.

3.1A1F1F2F3F8step 2.1∎

The increasing-limit clause of [F2] makes gγ measurable. Apply monotone convergence [F8] to the sequence (gk+1)k≥1 from step 2.1. Its integral limit is 1/(γ+1) by [F3], so gγ is integrable and the displayed value follows. The only choice assumption used is [A1], which supplies the underlying Lebesgue measure in [F1].

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passOpen item page →

The double-exponential maps and their change-of-variable identities

Statement

The three real maps in Finite truncated tanh–sinh, exp–sinh, and sinh–sinh trapezoid rules are continuously differentiable, strictly increasing bijections from R onto (a,b), (0,∞), and R, respectively, with the derivatives used there. If the corresponding transformed integrand Φ is absolutely integrable on R as an improper Riemann integral, then the target improper integral exists absolutely and equals ∫RΦ(t) dt. This is a change-of-variable identity; it asserts no quadrature error for every integrable f.

Facts & Assumptions

Given: One of the finite-interval, positive-half-line, or whole-line modes and its transformed integrand Φ from Finite truncated tanh–sinh, exp–sinh, and sinh–sinh trapezoid rules, with absolutely convergent improper integral ∫−∞∞∣Φ(t)∣ dt.

[F1]

Finite truncated tanh–sinh, exp–sinh, and sinh–sinh trapezoid rules: sinh⁡t=(et−e−t)/2, cosh⁡t=(et+e−t)/2, and the three maps and derivatives are displayed in its Definition.

[F2]

The exponential tends to +∞ at +∞ and to 0 at −∞: et→+∞ as t→+∞ and et→0 as t→−∞.

[F3]

Substitution: if φ is differentiable on [c,d] with φ′ integrable and f is continuous on an interval containing φ([c,d]), then ∫φ(c)φ(d)f=∫cd(f∘φ) φ′: for a differentiable map with Riemann-integrable derivative on a nondegenerate compact interval and a continuous integrand on an interval containing its image, the oriented definite integral changes variables with the derivative factor.

[F7]

The exponential function is smooth and (exp⁡)′=exp⁡: the real exponential is smooth and its derivative is itself.

[F8]

A continuous function on [a,b] is Riemann integrable, by Heine-Cantor and Riemann's criterion: a continuous real function on a nondegenerate compact interval is Riemann integrable there.

Proof

1.1F1F4F5F6F7givenalgebraconstruct

Differentiating s(t) and c(t) from their exponential formulas gives s′(t)=c(t)>0. By [F6], multiplying the defining quotient sinh⁡u/cosh⁡u by eu/eu gives tanh⁡u=(e2u−1)/(e2u+1), with positive denominator. Differentiating this quotient using [F7] gives tanh⁡′(u)=1/cosh⁡2u>0. The chain rule therefore gives the three positive derivatives in [F1]; [F5] makes each map strictly increasing.

2.1F1F2F5step 1.1algebra

By [F2], s(t)→±∞ as t→±∞. Thus tanh⁡((π/2)s(t))→±1, exp⁡((π/2)s(t)) tends to 0 and +∞ at the two ends, and sinh⁡((π/2)s(t))→±∞. Continuity, strict increase, and these endpoint limits prove the stated ranges and bijectivity.

3.1F1F3F7F8givenstep 1.1step 2.1∎

Fix T>0. The displayed derivatives in [F1] are continuous by their exponential formulas, so [F8] makes them Riemann integrable on [−T,T]. The relevant f is continuous on the nondegenerate compact image interval, so [F3] gives ∫x(−T)x(T)f(x) dx=∫−TTΦ(t) dt. Applying the same identity to ∣f∣ shows that the truncated absolute integrals equal ∫−TT∣Φ(t)∣ dt. The two nonnegative absolute integrals on either side of x(0) increase and are bounded by ∫R∣Φ∣, so each converges separately. Since the endpoints tend to the target endpoints by step 2.1, the target integral converges absolutely, and taking limits in the signed identity proves the asserted equality.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

The Jacobi weight defines a finite positive measure with full support

Statement

Assume Countable Choice. Let α,β>−1 and define wα,β(t)={(1−t)α(1+t)β,−1<t<1,0,t=±1. Let λ be Lebesgue measure restricted to the Borel subsets of [−1,1], and set μα,β(E)=∫Ewα,β dλ. Then μα,β is a finite positive Borel measure, its relative support is all of [−1,1], and every moment ∫∣t∣k dμα,β is finite for k∈N0.

Facts & Assumptions

Given: Countable Choice and real parameters α,β>−1.

[A1]

The Axiom of Countable Choice (ACω): the Countable Choice axiom is assumed.

[F1]

A power above exponent minus one is Lebesgue integrable at zero: for every q>−1, x↦xq on (0,1], extended by zero at zero, is nonnegative and Lebesgue integrable with integral 1/(q+1).

[F4]

The measure with density f relative to μ: a nonnegative measurable density w defines the measure w dλ by E↦∫Ew dλ.

[F6]

Monotonicity and nonnegative homogeneity of the nonnegative integral: the nonnegative integral is monotone and positively homogeneous.

[F8]

Monotone convergence for the integral and Closure properties of measurable functions used by the integral: increasing nonnegative measurable cutoffs have integrals increasing to the integral of their limit.

Proof

1.1A1F2F3givenalgebra

The density is nonnegative and continuous on (−1,1) by [F3]. For every real c, its strict superlevel is all of [−1,1] when c<0, and the relatively open set {t∈(−1,1):wα,β(t)>c} when c≥0; thus the endpoint extension is Borel, and [F2] makes it Lebesgue measurable. Put Mα=max⁡(1,2α) and Mβ=max⁡(1,2β). On (−1,0] the factor (1−t)α is at most Mα, and on [0,1) the factor (1+t)β is at most Mβ.

2.1A1F1F6F7F8F9step 1.1constructalgebra

To justify the endpoint integral comparisons, set wn=wα,βχ[−1+1/n,1−1/n] for n≥2. Its superlevels are Borel by step 1.1. It is bounded and continuous except possibly at the two cutoff points; isolating these in intervals of arbitrarily small total length and using uniform continuity on the remaining compact pieces proves the Darboux criterion [F9]. The same argument applies to each half-interval restriction and to the corresponding power cutoffs. Consequently [F7] and the Riemann substitutions u=1+t and u=1−t give ∫−10wn dλ≤Mα∫1/n1uβ dλ≤Mα/(β+1) and ∫01wn dλ≤Mβ∫1/n1uα dλ≤Mβ/(α+1), using [F1] and [F6] for the final bounds. Since wn↑wα,β pointwise, including at the endpoints, [F8] gives ∫[−1,1]wα,β dλ≤Mα/(β+1)+Mβ/(α+1)<∞.

3.1A1F2F4F5F6step 1.1step 2.1choose

By [F4], μα,β is a positive Borel measure, and step 2.1 makes its total mass finite. If U⊆[−1,1] is nonempty and relatively open, choose a nondegenerate closed interval [c,d]⊂U∩(−1,1). The density is continuous and strictly positive on [c,d], so [F5] gives a minimum m>0 there. By [F2] and monotonicity [F6], μα,β(U)≥∫[c,d]wα,β dλ≥m(d−c)>0. Therefore every point is in the relative support.

4.1F6step 2.1algebra∎

For every k∈N0, ∣t∣k≤1 on [−1,1], so [F6] gives ∫∣t∣k dμα,β≤μα,β([−1,1])<∞ by step 2.1. This proves all moment claims.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

The Cauchy principal-value subtraction identity

Statement

For a<c<b and f∈C1([a,b]), the principal value of Symmetric Cauchy principal value by subtraction exists and, with g(c)=f′(c) and g(x)=(f(x)−f(c))/(x−c) otherwise, satisfies PV⁡ ⁣∫abf(x)x−c dx=∫abg(x) dx+f(c)log⁡b−cc−a. The first integral is an ordinary integral of a continuous function.

Facts & Assumptions

Given: Reals a<c<b and f∈C1([a,b]).

[F1]

Symmetric Cauchy principal value by subtraction: the principal value is the symmetric limit of the two truncated integrals.

[F2]

The first divided difference of a C1 function extends continuously: the subtraction quotient g extended by g(c)=f′(c) is continuous on [a,b].

[F5]

The first fundamental theorem: if f is integrable on [a,b] and continuous at c, then F′(c)=f(c); in particular a continuous f has F as a primitive: the integral function of a continuous integrand is a continuous primitive, so its increments over intervals whose endpoints tend to c tend to zero.

Proof

1.1F1F2F3F4algebra

For x≠c, f(x)/(x−c)=g(x)+f(c)/(x−c). If 0<ε<min⁡(c−a,b−c), apply [F3]–[F4] separately on [a,c−ε] and [c+ε,b]. The two singular terms sum to f(c)(log⁡ε−log⁡(c−a)+log⁡(b−c)−log⁡ε)=f(c)log⁡b−cc−a. Thus the truncated principal value equals ∫ac−εg+∫c+εbg+f(c)log⁡((b−c)/(c−a)).

2.1F2F5step 1.1algebra

Let G(x)=∫axg. By [F2] and [F5], G is continuous and its interval increments equal the corresponding integrals. Additivity gives ∫ac−εg+∫c+εbg=∫abg−[G(c+ε)−G(c−ε)]. The bracket tends to zero by continuity of G.

3.1F1F2step 1.1step 2.1∎

Taking ε↓0 in step 1.1 and using step 2.1 proves existence of the symmetric limit and the asserted identity. Since g is continuous, its ordinary integral exists.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

A finite double-exponential trapezoid has separate strip and tail errors

Statement

Use one of the modes of Finite truncated tanh–sinh, exp–sinh, and sinh–sinh trapezoid rules and let Φ be its transformed real integrand. Suppose Φ has an extension F satisfying all hypotheses of An analytic-strip error bound for the infinite trapezoid sum for some 0<a<d, with horizontal integrals I±=∫R∣F(x±ia)∣dx. Also suppose ∣Φ(t)∣≤Ae−Beκ∣t∣ for ∣t∣≥T, where A,B,κ>0, and N±h≥T. If I is the target improper integral and Th,N−,N+ is the finite sum in the algorithm, then it is absolutely convergent as an improper integral and ∣I−Th,N−,N+∣≤I++I−e2πa/h−1+AκB(e−BeκN−h+e−BeκN+h). The strip and tail hypotheses are separate assumptions; integrability alone implies neither estimate.

Facts & Assumptions

Given: A mode and transformed function Φ from Finite truncated tanh–sinh, exp–sinh, and sinh–sinh trapezoid rules, its target I, an analytic extension satisfying the strip hypotheses, and a double-exponential real-tail envelope with the stated cutoff conditions.

[F1]

Finite truncated tanh–sinh, exp–sinh, and sinh–sinh trapezoid rules: the output is h∑k=−N−N+Φ(kh).

[F2]

The double-exponential maps and their change-of-variable identities: if Φ is absolutely integrable as an improper Riemann integral, the target exists absolutely and equals ∫RΦ(t)dt.

[F3]

An analytic-strip error bound for the infinite trapezoid sum: under the closed-substrip exponential bound and analyticity hypotheses, ∣∫Φ−h∑k∈ZΦ(kh)∣≤(I++I−)/(e2πa/h−1) and the infinite sum is absolutely convergent.

[F4]

A double-exponential envelope bounds the omitted trapezoid tails: the continuous and sampled omitted tails each have the stated one-sided envelope bound.

[F5]

A continuous function on [a,b] is Riemann integrable, by Heine-Cantor and Riemann's criterion: a continuous real function on a compact interval is Riemann integrable there.

Proof

1.1givenF2F4F5algebra

Put T0=max⁡(T,0). The envelope holds for ∣t∣≥T0, and N±h≥0 together with N±h≥T gives N±h≥T0. Thus [F4] makes the two tails outside [−N−h,N+h] absolutely integrable. Set S=(N−+N++1)h>0. The continuous function ∣Φ∣ is Riemann integrable on [−S,S] by [F5], and this interval contains both cutoffs, so Φ is absolutely integrable on R as an improper Riemann integral. Now [F2] identifies I=∫RΦ.

1.2F1F3given

By [F3], h∑k∈ZΦ(kh) is absolutely convergent. Splitting its terms into −N−≤k≤N+ and the two omitted tails is therefore valid.

2.1step 1.1step 1.2algebra

Add and subtract the infinite trapezoid sum. The triangle inequality bounds the target-to-finite-sum error by the target-to-infinite-sum error plus the absolute omitted sample sum.

3.1F3F4step 1.1step 2.1∎

Apply [F3] to the first term in step 2.1 and the sampled-tail estimate [F4], with cutoff T0 from step 1.1, to the second. Their sum is the displayed bound.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

The Duffy map turns a vertex singularity into an integrable radial weight

Statement

Let α<2 and let q:T→R be continuous. On T∖{(0,0)} put f(x,y)=∥(x,y)∥2−αq(x,y), where ∥⋅∥2 is the Euclidean norm. The improper integral over T is absolutely convergent and ∫Tf(x,y) dx dy=∫01∫01r1−αG(r,s) ds dr,G(r,s)=(1+s2)−α/2q(r,rs). In particular, the transformed radial weight r1−α is integrable at zero because 1−α>−1.

Facts & Assumptions

Given: A real exponent α<2, a continuous amplitude q on the reference triangle T, and the map D of The reference-triangle Duffy map from a vertex.

[F1]

The reference-triangle Duffy map from a vertex and The reference-triangle Duffy map has the stated image and Jacobian: D(r,s)=(r,rs) maps the square to T, is one-to-one with inverse (x,y)↦(x,y/x) for r>0, and has determinant r.

[F2]

The p-norms ∥x∥p for rational p≥1, and ∥x∥∞: ∥(r,rs)∥2=r1+s2 for r>0.

[F3]

Change of variables for an injective C1 map on a compact Jordan set: on a compact truncated region where the map is one-to-one with nonzero Jacobian, the integral changes by the absolute Jacobian determinant.

[F5]

The improper integral of a power at zero: if γ>−1, then ∫0εrγdr=εγ+1/(γ+1).

[F6]

The exponent, product, quotient, and iterated-power laws for positive real bases and real exponents: positive-base powers satisfy (ab)u=aubu and (av)u=avu.

[F8]

A continuous real function on a compact Jordan measurable set is Riemann integrable over that set: a continuous real function on a compact Jordan set is Riemann integrable there. A continuous function on a closed rectangle has repeated Riemann integrals in every coordinate order, all equal to its multiple integral identifies a continuous function's multiple integral on each truncated rectangle with its repeated integrals.

Proof

1.1F1F2F3F6F8givenalgebra

For 0<ε<1, restrict to Tε={(x,y)∈T:x≥ε}. The polynomial map D(r,s)=(r,rs) extends to the open set U=(0,∞)×R, where it is injective with inverse (x,y)↦(x,y/x) and determinant r>0. Its image Tε is the compact polygon {ε≤x≤1, 0≤y≤x} and is Jordan measurable, since its boundary is a finite union of line segments. On this image ∥(x,y)∥2≥ε, so f and ∣f∣ are continuous and bounded there and [F8] makes both Riemann integrable. Thus [F3] applies to each on the compact Jordan rectangle [ε,1]×[0,1]. By [F1]–[F2] and [F6], its transformed integrand is r (r1+s2)−αq(r,rs)=r1−αG(r,s), continuous on the truncated rectangle, so [F8] identifies its multiple integral with ∫ε1∫01r1−αG(r,s) ds dr.

2.1F4F5F7step 1.1algebra

The function G is continuous on [0,1]2 by [F4] and [F7], so let M=max⁡∣G∣<∞. Since 1−α>−1, [F5] bounds the absolute transformed integral over 0<r<ε by Mε2−α/(2−α), which tends to zero. Hence the truncated integrals have an absolutely convergent limit and the displayed identity follows from step 1.1.

3.1F1step 2.1algebra∎

The same bound applies to any neighborhood of the vertex contained in 0≤x<ε, and every sufficiently small Euclidean ball about (0,0) is contained in such a set. Therefore the absolute integral near the vertex tends to zero independently of the particular shrinking neighborhood, establishing the usual improper-integral interpretation.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

The Gauss–Jacobi quadrature rule

Definition

Assume Countable Choice, let n≥1, and let α,β>−1. Let μα,β be the finite positive Borel measure with density (1−t)α(1+t)β on (−1,1) from The Jacobi weight defines a finite positive measure with full support. Its moments through degree 2n−1 are finite and its support is all of [−1,1], so it is Gaussian moment data of order 2n−1 in Positive-measure Gaussian quadrature moment data. The n-node Gauss–Jacobi rule is the general Gaussian rule Qn for this measure as defined in The m-node Gaussian quadrature rule for a positive measure: its nodes are the roots of the monic degree-n orthogonal polynomial, and each weight is the integral of the corresponding Lagrange cardinal polynomial. This definition makes no accuracy or computed-node claim; local well-definedness is supplied by Gauss–Jacobi nodes and weights are well-defined ↗.

AlgorithmAlgorithm: Literature-sourcedProof: Not applicableOpen item page →

Weighted product Gauss quadrature after the Duffy transform

Definition

Assume Countable Choice. Let α<2, put ρ=1−α>−1, and let n≥1. For a continuous amplitude G on [0,1]2, let (zj,wj)j=1n be the Gauss–Jacobi rule for weight (1+t)ρ on [−1,1], and (ζi,vi)i=1n the rule for weight 1 there. Map nodes and weights to [0,1] by rj=(1+zj)/2,aj=2−(ρ+1)wj,si=(1+ζi)/2,bi=vi/2. The Duffy weighted product rule is Qn,αD(G)=∑j=1n∑i=1najbiG(rj,si). It approximates ∫01∫01r1−αG(r,s) ds dr. When G(r,s)=(1+s2)−α/2q(r,rs) for a continuous q:T→R, this target is the triangle integral identified in The Duffy map turns a vertex singularity into an integrable radial weight. The finite nodes and weights are well-defined by the supplied Gauss–Jacobi rule; the error estimate for such transformed amplitudes is The Duffy weighted product rule has an explicit bound using pure coordinate derivatives ↗.

AlgorithmAlgorithm: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Finite endpoint power substitution followed by Gauss–Jacobi quadrature

Definition

Assume Countable Choice. Input a<b, an integer n≥1, exponents α,β>−1, nonnegative integers ma,mb, a function h∈C2n([a,b]) in the sense of Higher derivatives and the classes Ck and C∞, and positive integers qa,qb satisfying qa(α+1)−1>2n and qb(β+1)−1>2n. On (a,b) define f(x)=(x−a)α(b−x)β(log⁡x−ab−a)ma(log⁡b−xb−a)mbh(x). The logarithms are natural logarithms and their arguments are positive. Put c=(a+b)/2, xL(t)=a+(c−a)tqa, and xR(t)=b−(b−c)tqb. For 0<t≤1 set FL(t)=f(xL(t))qa(c−a)tqa−1 and FR(t)=f(xR(t))qb(b−c)tqb−1; set FL(0)=FR(0)=0.

Let (zj,wj)j=1n be the nodes and weights of the n-node Gauss–Jacobi rule for α=β=0 on [−1,1]. Set sj=(1+zj)/2 and vj=wj/2. The output is the finite number I^=∑j=1nvjFL(sj)+∑j=1nvjFR(sj). The inputs qa,qb are supplied finite cutoff orders; this definition makes no claim of automatic parameter selection. The conditional integral and error guarantee are proved in Error bound after endpoint power regularization ↗.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Gauss–Jacobi nodes and weights are well-defined

Statement

Assume Countable Choice. For n≥1 and α,β>−1, the measure and order-2n−1 moment datum in The Gauss–Jacobi quadrature rule are valid Gaussian quadrature data. In particular the monic orthogonal polynomial exists, its n roots are distinct points of (−1,1), and the Lagrange weights and finite rule are well-defined.

Facts & Assumptions

Given: Countable Choice, an integer n≥1, and real α,β>−1.

[A1]

The Axiom of Countable Choice (ACω): Countable Choice is assumed for construction of the Jacobi measure.

[F1]

The Jacobi weight defines a finite positive measure with full support: μα,β is a finite positive Borel measure whose relative support is all of [−1,1] and whose moments of every finite degree are finite.

[F2]

Positive-measure Gaussian quadrature moment data: order-2n−1 moment data require a finite positive measure, at least n+1 support points, and finite absolute moments through degree 2n−1.

[F3]

The Gauss–Jacobi quadrature rule and The m-node Gaussian quadrature rule for a positive measure: the Jacobi rule is the general Gaussian rule for this moment datum, with roots of its monic orthogonal polynomial as nodes and Lagrange-integral weights.

[F4]

The Gaussian nodes, cardinal polynomials and weights are well-defined: for order-2n−1 Gaussian moment data, the nodes can be ordered as distinct interior roots, each Lagrange polynomial is defined, every weight is finite, and the rule is a finite real sum.

Proof

1.1A1F1F2givenalgebraconstruct

By [F1], the measure is finite and positive, all required moments are finite, and each of the n+1 explicit points tj=−1+2j/n for j=0,…,n lies in its support; these points are distinct because n≥1. Thus the data satisfy [F2].

2.1F3F4step 1.1∎

Applying [F4] to the moment datum of step 1.1 gives distinct roots in (−1,1), nonzero node differences, finite Lagrange-weight integrals, and a finite rule. These are exactly the asserted well-definedness properties in [F3].

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Gauss–Jacobi exactness and the derivative remainder

Statement

Assume Countable Choice. Let n≥1, α,β>−1, and let Qnα,β be the rule of The Gauss–Jacobi quadrature rule for dμα,β=(1−t)α(1+t)β dt on [−1,1]. It integrates every polynomial of degree at most 2n−1 exactly and has positive weights. If g∈C2n([−1,1]), and pn is the monic node polynomial, then some ξ∈(−1,1) satisfies ∫[−1,1]g dμα,β−Qnα,β(g)=g(2n)(ξ)(2n)!R∫[−1,1]pn(t)2 dμα,β(t). In particular, with Kn,α,β:=(2n)!R−1∫pn2 dμα,β>0, ∣∫g dμα,β−Qnα,β(g)∣≤Kn,α,β ∥g(2n)∥∞.

Facts & Assumptions

Given: Countable Choice, n≥1, α,β>−1, the Gauss–Jacobi rule, and g∈C2n([−1,1]).

[A1]

The Axiom of Countable Choice (ACω): Countable Choice is the only axiom used to construct the Jacobi density measure.

[F1]

The Jacobi weight defines a finite positive measure with full support and Gauss–Jacobi nodes and weights are well-defined: μα,β is finite positive, has at least n+1 support points, has every finite moment, and the n nodes and weights are defined.

[F2]

The Gauss–Jacobi quadrature rule: Qnα,β is the Gaussian rule for μα,β, with node polynomial pn and weights defined by integrating the Lagrange cardinal polynomials.

[F3]

Gaussian quadrature is exact through degree 2m−1 and has positive weights: an n-node Gaussian rule for finite positive order-2n−1 moment data is exact through degree 2n−1, has positive weights, and its weights sum to the total mass.

[F4]

Gaussian quadrature has the Hermite mean-value remainder: for order-2n moment data and g∈C2n, the Gaussian error equals g(2n)(ξ)/(2n)!R times the squared norm of the monic node polynomial.

[F6]

The polynomial moment pairing is a real inner product: a nonzero polynomial of degree at most n has strictly positive squared integral under this full-support positive measure.

[F8]

Higher derivatives and the classes Ck and C∞: C2n means the derivatives through order 2n exist and are continuous.

Proof

1.1A1F1F3F4given

By [F1], μα,β is a finite positive measure with all moments finite and support containing at least n+1 points. Thus its moment datum satisfies both the order-2n−1 and order-2n hypotheses in [F3] and [F4].

2.1F2F3step 1.1

Applying [F3] to the rule [F2] proves polynomial exactness through degree 2n−1 and positivity of the weights.

2.2F1F2F4givenstep 1.1

Apply the Hermite remainder [F4] to g and the order-2n datum from step 1.1. It gives the stated ξ and error identity with the same monic node polynomial pn.

3.1F1F5F6F7F8step 2.2algebra∎

The integral of pn2 is finite by [F1] and strictly positive by [F6], since pn is monic and hence nonzero. Thus Kn,α,β>0 by [F7]. The derivative g(2n) is continuous by [F8] on a compact interval, so [F5] gives ∥g(2n)∥∞<∞; taking absolute values in step 2.2 yields the claimed error bound.

CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passOpen item page →

The Duffy weighted product rule has an explicit bound using pure coordinate derivatives

Statement

Assume Countable Choice, let α<2, ρ=1−α, n≥1, and let G∈C2n in each coordinate on [0,1]2. Let p~n,ρ and p~n,0 be the monic node polynomials of the pushed-forward Gauss–Jacobi rules for rρdr and ds, respectively. Define Mρ=∫01rρdr=1ρ+1,Kρ=1(2n)!R∫01p~n,ρ(r)2rρdr,K0=1(2n)!R∫01p~n,0(s)2ds. Then the rule of Weighted product Gauss quadrature after the Duffy transform satisfies ∣∫T∥(x,y)∥2−αq(x,y) dx dy−Qn,αD(G)∣≤Kρ∥∂r2nG∥∞+MρK0∥∂s2nG∥∞, where G is the transformed amplitude from The Duffy map turns a vertex singularity into an integrable radial weight.

Facts & Assumptions

Given: Countable Choice, α<2, n≥1, continuous q on the reference triangle, the Duffy rule, and the stated coordinate smoothness of its transformed amplitude G.

[A1]

The Axiom of Countable Choice (ACω): Countable Choice is used to supply the Lebesgue-density positive measures underlying the two Gaussian rules.

[F1]

The Duffy map turns a vertex singularity into an integrable radial weight: the singular triangle integral equals ∫01∫01rρG(r,s)dsdr.

[F2]

Weighted product Gauss quadrature after the Duffy transform: its finite sum is the tensor product of the n-node rules for rρdr and ds.

[F3]

Gauss–Jacobi exactness and the derivative remainder: each pushed-forward one-dimensional rule has error constant (2n)!−1∫p~n2dμ and integrates the measure mass exactly.

[F4]

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.

[F5]

The Jacobi weight defines a finite positive measure with full support: the weights (1+t)ρ for ρ>−1 and 1 define finite positive full-support measures with moments of every finite order.

[F6]

The improper integral of a power at zero: ∫01rρdr=1/(ρ+1) for ρ>−1.

Proof

1.1A1F2F5givenalgebra

The exponent ρ=1−α satisfies ρ>−1. By [F5] and [A1], the Jacobi weights (1+t)ρ and 1 define finite positive measures with full support; the affine node/weight scalings in [F2] give their Gaussian rules for rρdr and ds.

1.2F2F3F6F7algebra

The first measure has mass Mρ=1/(ρ+1) by [F6], and the second has mass 1. For the first affine pushforward, r=(1+t)/2 gives rρdr=2−(ρ+1)(1+t)ρdt and its monic node polynomial is p~n,ρ(r)=2−npn,ρ(2r−1). Hence its squared-node-polynomial integral is 2−(ρ+1+2n)∫−11pn,ρ(t)2(1+t)ρdt. The derivative of H((1+t)/2) contributes 2−2n, so [F3] gives exactly Kρ as defined. The same calculation with ρ=0 gives K0. Positivity of the factorial denominator follows from [F7].

2.1F1F2F4step 1.2∎

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.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Error bound after endpoint power regularization

Statement

Assume Countable Choice and the inputs of Finite endpoint power substitution followed by Gauss–Jacobi quadrature. Let FL,FR be its transformed functions and define Cn=1(2n)!R∫01p~n(s)2 ds, where p~n is the monic degree-n polynomial orthogonal for Lebesgue measure on [0,1]. Then the improper integral I=∫abf(x) dx exists, the algorithm's output is I^=Q~n(FL)+Q~n(FR), and ∣I−I^∣≤Cn(∥FL(2n)∥∞+∥FR(2n)∥∞). Here Q~n(H)=12∑j=1nwjH((1+zj)/2) is the affine image on [0,1] of the n-node α=β=0 rule on [−1,1].

Facts & Assumptions

Given: Countable Choice, a<b, n≥1, α,β>−1, nonnegative integers ma,mb, h∈C2n([a,b]), and positive integers qa,qb with qa(α+1)−1>2n and qb(β+1)−1>2n.

[A1]

The Axiom of Countable Choice (ACω): this axiom is used only to form the Lebesgue-density Gaussian rule.

[F1]

Finite endpoint power substitution followed by Gauss–Jacobi quadrature: xL(t)=a+(c−a)tqa and xR(t)=b−(b−c)tqb, and FL,R=f(xL,R)∣xL,R′∣ on (0,1], extended by zero at 0; the output is the sum of the two shifted n-node Gauss–Jacobi values.

[F2]

A sufficiently high power regularizes finite logarithmic endpoint factors: if δ>r, then tδP(log⁡t), extended by zero at 0 for any polynomial P, is Cr on [0,1] with its first r derivatives zero at 0.

[F3]

Gauss–Jacobi exactness and the derivative remainder: for the weight 1 on [−1,1], the n-node Gaussian rule has error constant (2n)!−1∫−11pn2 multiplying the supremum norm of the 2n-th derivative.

[F4]

Substitution: if φ is differentiable on [c,d] with φ′ integrable and f is continuous on an interval containing φ([c,d]), then ∫φ(c)φ(d)f=∫cd(f∘φ) φ′: on a compact interval, differentiable substitution with integrable derivative gives the corresponding oriented change-of-variable identity for continuous integrands.

[F5]

Higher derivatives and the classes Ck and C∞: C2n means continuous derivatives through order 2n, including one-sided endpoint derivatives.

[F8]

The exponent, product, quotient, and iterated-power laws for positive real bases and real exponents and Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: positive-base powers obey product and iterated-power laws, while log⁡(uv)=log⁡u+log⁡v. For a positive integer q, iterating the logarithm product law gives log⁡(tq)=qlog⁡t.

Proof

1.1A1F1F2F5F7F8givenalgebra

Put c=(a+b)/2. On the left half, xL(t)−a=(c−a)tqa and b−xL(t)=(b−a)(1−tqa/2)≥(b−a)/2. The endpoint logarithm is log⁡((c−a)/(b−a))+qalog⁡t, so its ma-th power is a polynomial in log⁡t; the opposite power and logarithm and h(xL(t)) have C2n derivatives because their arguments remain positive and bounded away from zero, by [F7]. Hence FL(t)=tδLPL(log⁡t)ϕL(t) times a constant, where δL=qa(α+1)−1>2n, deg⁡PL≤ma, and ϕL∈C2n([0,1]). By [F2] and the product rule, FL extends to C2n at zero with the assigned value.

1.2F1F2F5F7F8givenalgebra

On the right half, b−xR(t)=(b−c)tqb and xR(t)−a=(b−a)(1−tqb/2)≥(b−a)/2. Its singular logarithm is log⁡((b−c)/(b−a))+qblog⁡t, while the opposite factors and h(xR(t)) have C2n derivatives by [F7]. The same factorization has δR=qb(β+1)−1>2n and a polynomial in log⁡t of degree at most mb; [F2] therefore gives FR∈C2n([0,1]).

1.3F3F6givenalgebra

For H∈C2n([0,1]), apply [F3] to H((1+t)/2) on [−1,1] and multiply the integral and quadrature values by 1/2. The chain rule contributes 2−2n to the 2n-th derivative, so the shifted rule's error constant is 2−2n−1(2n)!R−1∫−11pn(t)2dt=(2n)!R−1∫01p~n(s)2ds=Cn; the affine node polynomial is p~n(s)=2−npn(2s−1). Consequently its error is at most Cn∥H(2n)∥∞.

2.1F1F4step 1.1step 1.2

For every 0<ε<1, apply [F4] on [ε,1]. Since xL is increasing, ∫ε1FL(t) dt=∫xL(ε)cf(x) dx. Since xR is decreasing and FR(t)=−f(xR(t))xR′(t), the oriented substitution gives ∫ε1FR(t) dt=∫cxR(ε)f(x) dx. Letting ε↓0, the endpoints tend to a and b, while FL,FR are continuous on [0,1] by steps 1.1–1.2. Thus both improper half-integrals converge and their sum is I=∫01FL+∫01FR.

3.1F1step 1.1step 1.2step 2.1step 1.3algebra∎

Apply step 1.3 to FL and FR, whose required smoothness was proved in steps 1.1–1.2. Since I is their integral sum by step 2.1 and I^ is their quadrature sum by [F1], the triangle inequality gives the stated error bound.

5 · Examples, counterexamples and false statements

None yet.

Sources