Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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.

Smooth-solution error bound for composite midpoint Nyström discretization

Statement

Assume AC. Let k:[0,1]2→R be continuous, K its integral operator, and KN its composite midpoint Nyström operator with panel width h=1/N. Suppose I−K is injective and u solves (I−K)u=f. Assume that gx(y):=k(x,y)u(y) is twice continuously differentiable in y for every x, with the uniform bound M2:=sup⁡x,y∈[0,1]∣∂y2gx(y)∣<∞. Then there are N0 and C<∞ such that for every N≥N0 the Nyström matrix is nonsingular, its reconstruction uN solving (I−KN)uN=fN exists for each fN∈X, and ∥uN−u∥∞≤C(∥fN−f∥∞+h224M2). In the standard Nyström method fN=f. The regularity assumption is on the actual function k(x,⋅)u(⋅), not on every function in the unit ball of C([0,1],R).

Facts & Assumptions

Given: AC, k, K, KN, u, f, fN, and M2 as in the Statement.

[F1]

Nyström quadrature operators and their reconstructed equations: the Nyström equation is (I−KN)uN=fN.

[F2]

Finite-node Nyström equations are equivalent to their reconstructed equations: nonsingularity of the finite grid matrix is equivalent to bijective solvability of the reconstructed equation.

[F3]

A continuous kernel defines a compact integral operator on C of an interval: the continuous-kernel operator K is compact; AC supplies its Countable Choice and Dependent Choice hypotheses by AC supplies the countable and dependent choices used in Banach integration.

[F4]

Composite midpoint Nyström operators are collectively compact and consistent: each composite midpoint operator is bounded linear, the family is collectively compact, and KNx→Kx in norm for every x∈X.

[F5]

Collective compactness gives eventual Fredholm invertibility and solution error bounds: under AC, compactness of K, collective compactness and pointwise convergence of KN, and injectivity of I−K give eventual bounded inverses with a uniform bound and the residual solution estimate.

[F6]

Composite midpoint error bound for a twice continuously differentiable function: for a C2 real integrand g on [0,1], the composite midpoint rule satisfies ∣∫01g−QNg∣≤h2∥g′′∥∞/24.

[F7]

On the nonempty compact interval [0,1] (Heine-Borel in Rn: with the Euclidean metric a subset of Rn is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line), let X=C([0,1],R) with its supremum norm. Pointwise addition and real scalar multiplication preserve continuity. The supremum is finite by C(K,R) is complete in the supremum metric for every nonempty compact metric space K; the pointwise absolute-value inequalities give ∥u+v∥∞≤∥u∥∞+∥v∥∞ and ∥cu∥∞=∣c∣∥u∥∞, and ∥u∥∞=0 holds exactly when u=0. Thus this is a real norm (A norm on a real vector space, the induced metric, and the dictionary with the metric axioms). Its induced metric is the complete supremum metric of C(K,R) is complete in the supremum metric for every nonempty compact metric space K, so X is Banach (Banach space).

[F8]

The constant function 1 belongs to X and is nonzero by the definition of continuous real-valued functions (The space C(K,R) of continuous real-valued functions on a nonempty compact metric space), so X≠{0}.

Proof

Given: AC, the continuous kernel and exact solution in the Statement, and h=1/N.

1.1givenF3F4F5F7F8

By [F7] and [F8], the space X satisfies the Banach and nonzero hypotheses of [F5]. By [F3], K is compact; [F4] gives bounded linear KN with the required collective compactness and pointwise convergence; the Statement assumes I−K injective. Thus [F5] supplies N0 and a common bound C for (I−KN)−1 for all N≥N0.

1.2givenF6

For each fixed x, apply [F6] to the C2 function gx(y)=k(x,y)u(y). The common derivative bound gives ∣KNu(x)−Ku(x)∣≤h2M2/24 for every x, hence ∥KNu−Ku∥∞≤h2M2/24.

2.1F1F2step 1.1step 1.2algebra∎

The function-equation inverse from step 1.1 and [F2] make the finite matrix nonsingular and define its unique reconstruction uN. Subtracting the exact and discrete equations gives (I−KN)(uN−u)=fN−f+(KN−K)u. Applying the inverse bound C from step 1.1, then the triangle inequality and step 1.2, proves the stated estimate.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

79 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