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.

Fredholm error bound for half-order product integration

Statement

Assume AC. Let a:[0,1]2→R be continuous, let K,Kn be the half-order product-integration operators of Piecewise-linear product integration for a half-order diagonal singularity, and suppose I−K is injective. Let u solve (I−K)u=f, and assume each gx(y):=a(x,y)u(y) extends to a C2 function on a neighborhood of [0,1], with M2:=sup⁡x,y∈[0,1]∣∂y2(a(x,y)u(y))∣<∞. Then there are n0 and C<∞ such that for every n≥n0, the finite Nyström grid matrix is nonsingular, its reconstructed solution un exists, and ∥un−u∥∞≤C(∥fn−f∥∞+24M2h2),h=1/n, whenever (I−Kn)un=fn. In particular, for the exact right-hand side fn=f, the solution error is O(h2) under the stated smoothness of the regular factor times the exact solution.

Facts & Assumptions

Given: AC, the continuous a, the operators K,Kn, an exact solution u, and the uniform second-derivative bound in the Statement.

[A1]

The Axiom of Choice and AC supplies the countable and dependent choices used in Banach integration: AC supplies the Countable Choice and Dependent Choice needed by the local Arzelà–Ascoli result.

[F1]

Piecewise-linear product integration for a half-order diagonal singularity: K and Kn are the improper-integral and weighted-hat interpolation operators, and Kn has the finite-node form ∑jψj(x)u(yj) with coefficient functions ψj(x)=wn,j(x)a(x,yj).

[F2]

Stability, collective compactness, and consistency of half-order product integration: K and each Kn are bounded linear maps, K is compact, Kn is collectively compact and pointwise norm convergent to K, each coefficient function ψj is continuous, and ∥Knu−Ku∥∞≤2M2h2/4.

[F3]

Collective compactness gives eventual Fredholm invertibility and solution error bounds: under AC and injectivity of I−K, the operators I−Kn are boundedly invertible for all sufficiently large n with one uniform inverse bound, and their solution errors satisfy the residual estimate.

[F4]

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

[F5]

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). The constant function 1 is a nonzero member of X because the interval is nonempty (The space C(K,R) of continuous real-valued functions on a nonempty compact metric space).

Proof

Given: The hypotheses in the Statement and h=1/n.

1.1givenA1F2F3F5

By [F5], X is a nonzero Banach space. By [F2], K is compact and (Kn) consists of bounded linear maps that are collectively compact and pointwise norm convergent to K. With AC and the assumed injectivity of I−K, [F3] gives n0 and C such that I−Kn is invertible and ∥(I−Kn)−1∥≤C for all n≥n0.

2.1step 1.1F1F2F4

The inverse in step 1.1 gives a unique solution to (I−Kn)un=fn. By [F2] each coefficient function in [F1] is continuous, so [F4] applies: the finite grid matrix is nonsingular and its solution reconstructs exactly this un.

3.1givenF2F3step 1.1algebra∎

Subtracting (I−K)u=f from (I−Kn)un=fn gives (I−Kn)(un−u)=fn−f+(Kn−K)u. Apply the inverse bound in [F3] and then the consistency bound in [F2]: ∥un−u∥∞≤C(∥fn−f∥∞+∥Knu−Ku∥∞)≤C(∥fn−f∥∞+24M2h2). This is the claimed error estimate.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

72 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