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.

✓ 4 results · all verified · 3 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 1 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Nystrom product integration and fredholm error — Examples

1 · Prerequisites

2 · Summary

These examples compute an exact rank-two Gaussian Nyström solution, quantify error amplification near a rank-one resonance, refute operator-norm convergence of standard midpoint Nyström operators on C([0,1]) with an explicit continuous witness, and compare direct midpoint sampling with exact half-order product integration.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

A two-node Gaussian Nyström rule solves a rank-two separable equation exactly

Example

Assume Countable Choice. Let μ be Lebesgue measure on [0,1], take α=1/4, β=1/2, and set k(x,y)=α+βxy and f(x)=1. The equation u(x)−∫[0,1]k(x,y)u(y) dμ(y)=1 has the unique solution u(x)=80+24x57. 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 [0,1], the kernel k(x,y)=α+βxy with α=1/4, β=1/2, and f(x)=1.

[A1]

The Axiom of Countable Choice (ACω) 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 [0,1] agree under Countable Choice.

[F1]

Positive-measure Gaussian quadrature moment data: an order-2m−1 datum is a finite positive measure of positive mass whose support has at least m+1 points and whose moments through degree 2m−1 are finite; for this example, the Lebesgue measure on [0,1] meets these conditions by [F6] and [F7].

[F2]

The m-node Gaussian quadrature rule for a positive measure: the Gaussian rule Q2 uses its two nodes and weights to approximate integration against μ.

[F3]

Gaussian quadrature is exact through degree 2m−1 and has positive weights: for this order-3 datum, Q2(p)=∫p dμ for every polynomial p of degree at most 3.

[F4]

Nyström quadrature operators and their reconstructed equations: the Nyström equation replaces each integral ∫k(x,y)u(y)dμ(y) by its quadrature rule and reconstructs u from its nodal values.

[F5]

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.

[F6]

The relative Lebesgue measure of [0,1] is 1, and every relatively open neighborhood of 0, 1/2, or 1 contains a closed subinterval of positive length. Each such interval has its length as measure (A box in Rn with parameters ai≤bi is Lebesgue measurable of measure ∏i<n(bi−ai), whichever of its faces are included), so all three points lie in the relative support of μ.

[F7]

The functions yj for 0≤j≤3 are continuous, bounded, and Riemann integrable (A continuous function on [a,b] 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.

Verification

Given: The data above and the two moments m0:=∫[0,1]u(y) dμ(y), m1:=∫[0,1]yu(y) dμ(y) of a solution.

1.1givenA1F7F8F9algebra

By [A1], the continuous integrands may be integrated as Riemann integrals. Since Ku(x)=αm0+βxm1, any solution is affine and has the form u(x)=1+αm0+βxm1. Integrating this identity against 1 and against y, using [F8] for the moments and [F9] for linearity, gives (1−α−β/2−α/21−β/3)(m0m1)=(11/2). At the specified parameters the determinant is (3/4)(5/6)−(1/4)(1/8)=19/32≠0, and solving gives m0=92/57, m1=16/19, hence u(x)=(80+24x)/57.

2.1givenF1F2F3F4F6F7step 1.1

The datum conditions in [F1] hold by [F6] and [F7]. The function u is affine and yu(y) is quadratic, so [F3] gives Q2(u)=m0 and Q2(yu)=m1. Substituting these two exact quadrature moments into the Nyström formula [F4] yields 1+αm0+βxm1=u(x) for every x; thus the continuous solution is also a Nyström solution.

3.1F1F3F4F5F6F7step 1.1step 2.1algebra∎

Any solution v of the inhomogeneous two-node Nyström equation has the form v(x)=1+αQ2(v)+βxQ2(yv), 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.

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

A near-resonant Nyström equation amplifies midpoint quadrature error

Example

For 0<δ<1, set λ:=3(1−δ), define (Ku)(x):=λx∫01yu(y) dy, and let f(x)=1. The exact solution of u−Ku=f is u(x)=1+λ2δx. For the N-panel composite midpoint rule with h=1/N, the Nyström solution is uN(x)=1+λ2(δ+λh2/12)x. Its error is the midpoint residual multiplied by a factor (δ+λh2/12)−1, which is at least (2δ)−1 whenever λh2/12≤δ. Thus a small quadrature residual can produce a much larger solution error as δ approaches the resonance value 0.

Facts & Assumptions

Given: 0<δ<1, λ=3(1−δ), h=1/N, f≡1, and the rank-one integral operator and midpoint Nyström rule in the Example.

[F1]

Nyström quadrature operators and their reconstructed equations: KNu(x)=λxQN(yu(y)) for the rank-one kernel k(x,y)=λxy.

[F2]

Composite midpoint rule on a uniform grid: QNg=h∑j=0N−1g((j+12)h).

Verification

Given: The data above, and the exact and discrete affine candidates u(x)=1+cx and uN(x)=1+cNx.

1.1givenalgebra

Substituting u=1+cx into u=1+Ku gives c=λ(1/2+c/3), so c(1−λ/3)=λ/2. Since 1−λ/3=δ>0, the unique coefficient is c=λ/(2δ), proving the exact formula.

1.2givenF2algebra

On each midpoint panel, direct integration gives ∫jh(j+1)hy dy=h(j+12)h and ∫jh(j+1)hy2 dy−h((j+12)h)2=h3/12. Summing the N panels yields QN(y)=1/2 and QN(y2)=1/3−h2/12.

2.1givenF1step 1.2algebra

Any discrete solution has the form uN(x)=1+cNx because the range of KN is contained in the span of x. Its coefficient satisfies cN=λ(1/2+cN(1/3−h2/12)), hence cN=λ/(2(δ+λh2/12)); the denominator is positive, so the discrete solution is unique.

3.1givenF1step 1.1step 1.2step 2.1algebra∎

On the direction x, Kx=(λ/3)x, so I−K scales that direction by δ. Also KNx=λ(1/3−h2/12)x, so I−KN scales it by δ+λh2/12. Directly using the exact and discrete coefficients from steps 1.1 and 2.1 gives ∥KNu−Ku∥∞=λ2h224δ,∥uN−u∥∞=λ2h224δ(δ+λh2/12). The ratio of solution error to quadrature residual is exactly (δ+λh2/12)−1, and the stated lower bound follows when λh2/12≤δ.

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

Standard midpoint Nyström operators need not converge in operator norm on C

Statement refuted

For every continuous kernel k on [0,1]2, the composite midpoint Nyström operators KN converge to the integral operator K in the operator norm on C([0,1],R).

Facts & Assumptions

Given: The constant kernel k(x,y)=1, the operator K and composite midpoint Nyström operators KN from Nyström quadrature operators and their reconstructed equations, and h=1/N.

[F1]

Nyström quadrature operators and their reconstructed equations: Ku=(∫01u(y)dy)1 and KNu=(h∑j=0N−1u((j+12)h))1.

[F2]

Composite midpoint rule on a uniform grid: the midpoint nodes are separated by h, each has weight h, and the weights sum to 1.

Counterexample

Given: A fixed N≥1, h=1/N, and 0<ρ<h/2.

1.1givenF2construct

Let mj:=(j+12)h. Define uρ to equal −1+2∣y−mj∣/ρ on each interval ∣y−mj∣≤ρ and 1 elsewhere. The windows are disjoint and lie inside [0,1], so uρ is continuous and ∥uρ∥∞=1. Its integral over each window is zero, hence ∫01uρ(y)dy=1−2Nρ.

2.1givenF1F2step 1.1algebra

Every midpoint value is uρ(mj)=−1, so KNuρ=−1 by [F1] and [F2], whereas Kuρ=1−2Nρ. Therefore ∥(K−KN)uρ∥∞=2−2Nρ.

3.1givenF1F2step 2.1algebra∎

The operators K and KN both have norm at most 1, because their defining integrals or positive quadrature weights have total mass 1. Thus ∥K−KN∥≤2. Letting ρ↓0 in step 2.1 gives ∥K−KN∥≥2, so ∥K−KN∥=2 for every N. This disproves the claimed operator-norm convergence.

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passOpen item page →

Direct midpoint quadrature loses order on a half-order singularity

Example

At x=0, take the weakly singular kernel s(0,y)=y−1/2 and smooth factor a≡1, u≡1. The exact integral is 2. The composite midpoint rule on panels of width h=1/N underestimates it by at least (2−2)h, so direct midpoint sampling of this singular integrand is not second order. The product-integration rule of Piecewise-linear product integration for a half-order diagonal singularity is exact for this constant smooth factor, because its interpolant is identically 1.

Facts & Assumptions

Given: N≥1, h=1/N, the function g(y)=y−1/2 on (0,1], its improper integral, and the product-integration rule from the A page. For the midpoint algorithm, use the extension g~:[0,1]→R given by g~(0)=0 and g~(y)=g(y) for y>0.

[F1]

The half-order diagonal singularity defines a bounded improper integral: ∫01y−1/2 dy=2 and the product weights integrate the constant function with their total weight S0(1)=2.

[F2]

Piecewise-linear product integration for a half-order diagonal singularity: Knu(0)=S0(Ing0) and the hats form the piecewise-linear interpolant.

[F3]

Composite midpoint rule on a uniform grid applies to the everywhere evaluable function g~ and uses g~((j+12)h)=g((j+12)h) on each panel with weight h. No endpoint is sampled, and the assigned value at zero does not enter the improper integral.

[F4]

On (0,∞), g(y)=y−1/2 is C2 with g′(y)=−12y−3/2 and g′′(y)=34y−5/2>0; positive-base powers are exponentials and the exponential is positive (Continuity and derivatives of positive-base real powers, Real powers for positive bases, with the zero-base positive-exponent convention, The exponential is positive and satisfies exp⁡(−x)=1/exp⁡(x)).

[F5]

The mean value theorem on a closed interval gives a point where the derivative equals the secant slope (Mean value theorem on a closed real interval).

[F6]

A continuous function on a closed interval is Riemann integrable (A continuous function on [a,b] is Riemann integrable, by Heine-Cantor and Riemann's criterion).

Verification

Given: The data in the Example, mj:=(j+12)h, g(y)=y−1/2 for y>0, and the extension g~ above.

1.1givenF1F3algebra

Since every mj>0, the admissible call QM(g~;0,1,N) equals h∑j=0N−1g(mj) by [F3]. On the first panel, the substitution y=ht gives ∫0hy−1/2dy=h∫01t−1/2dt=2h by [F1]; this substitution follows by scaling tagged sums on each truncated interval and then taking the improper limit. The midpoint contribution is hg(h/2)=2h. Their difference is (2−2)h.

2.1givenF3F4F5F6F7F8F9step 1.1algebra

For every later panel [jh,(j+1)h], j≥1, the function g is C2 by [F4]. Its second derivative is positive because y−5/2=exp⁡((−5/2)log⁡y)>0 for y>0, using [F4]. The mean value theorem [F5] applied to g′ shows that g′ is increasing there. For 0≤s≤h/2, put D(s):=g(mj−s)+g(mj+s)−2g(mj). By [F9], D′(s)=−g′(mj−s)+g′(mj+s)≥0 in the interior; another application of [F5] on [0,s] gives D(s)≥D(0)=0. Splitting at mj and substituting y=mj−s and y=mj+s gives ∫jh(j+1)hg(y) dy−hg(mj)=∫0h/2D(s) ds: the left substitution reverses the limits, while the right preserves them, and each has Jacobian magnitude 1. Thus the integral identity follows directly from the tagged Riemann sums under these affine maps. The integrals exist by [F6], the split at mj is additive by [F7], and the nonnegative difference integrates to at least zero by [F8]. Thus no later panel cancels the positive first-panel error, and the total midpoint error is at least (2−2)h.

3.1F1F2step 1.1∎

For the product rule, a≡1 and u≡1 give g0≡1. On each panel the two adjacent hat formulas in [F2] sum to 1, so Ing0=1. By [F1] and [F2], Knu(0)=S0(1)=2=Ku(0). Hence this case is exact under product integration although direct midpoint sampling has only the lower-bound rate above.

Sources