Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

99 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