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.

✓ 11 results · all verified · 10 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

1 · Prerequisites

2 · Summary

This page sets up finite-rank Nyström operators and proves their equivalence with the sampled grid equations. It treats two stability routes separately: an operator-norm perturbation estimate and an AC-dependent collectively compact Fredholm argument. For composite midpoint sampling, it proves pointwise consistency, the solution error bound under smoothness of the actual integrand, and the limitation of operator-norm convergence on the full space of continuous functions. A second section develops piecewise-linear product integration for the kernel ∣x−y∣−1/2, including the improper weights, their exact closed forms, the kernel's improper L1 translation modulus, collective compactness, consistency, and a Fredholm error bound. The page keeps the choice assumptions explicit and makes no operator-norm convergence claim for point sampling on C([0,1]).

Affine normalization to a general interval

The item formulas below use [0,1] as a normalized coordinate. They give the approved results on every nondegenerate compact interval I=[α,β] as follows. Put L:=β−α>0 and define the isometry U:C(I)→C([0,1]),(Uu)(t):=u(α+Lt). Its inverse is (U−1v)(x)=v((x−α)/L). Here C(I) and C([0,1]) denote real continuous functions. The intervals I and [0,1] are nonempty compact metric spaces by 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. Pointwise addition and real scalar multiplication preserve continuity, and the absolute-value triangle inequality, homogeneity and separation give the supremum norm on each space (A norm on a real vector space, the induced metric, and the dictionary with the metric axioms). Their induced supremum metrics are complete by C(K,R) is complete in the supremum metric for every nonempty compact metric space K, so both spaces are Banach (Banach space). The affine coordinate map is a bijection, and pointwise evaluation makes U linear; for every u∈C(I), ∥Uu∥∞=sup⁡t∈[0,1]∣u(α+Lt)∣=sup⁡x∈I∣u(x)∣=∥u∥∞, so U is an isometry for these norms. For a continuous kernel kI:I2→R, set k~(t,s):=L kI(α+Lt,α+Ls). For the affine integral substitution used here, a tagged partition of [0,1] maps to the partition of I obtained by s↦α+Ls; its mesh is multiplied by L, and each corresponding Riemann-sum term is multiplied by L. Taking the defining limits therefore gives ∫αβg(y) dy=L∫01g(α+Ls) ds for continuous g. For the half-order improper integrals the same identity holds first on each truncated interval, and then in the limit as the cutoff tends to zero. Thus, for every u∈C(I), UKIU−1=K~,(KIu)(x):=∫αβkI(x,y)u(y) dy, where K~ is the unit-interval integral operator with kernel k~. More generally, if a finite quadrature on I has nodes zj∈I and weights ωj, write sj=(zj−α)/L and ω~j=ωj/L. Then the conjugated Nyström operator is exactly (UKQ,IU−1v)(t)=∑jω~jk~(t,sj)v(sj),(KQ,Iu)(x)=∑jωjkI(x,zj)u(zj). Thus the transformed finite grid matrix is the same matrix, the right-hand sides and solution errors have the same supremum norms, and operator norms, inverse norms, compactness, collective compactness, injectivity, and invertibility are preserved by U: the operator-norm equality follows since U maps the unit ball onto the unit ball isometrically, and compact closures are preserved by this isometric bijection. The operator-norm perturbation route and the collectively compact route therefore apply on C(I) with exactly their stated hypotheses after this normalization. For the composite midpoint rule, the physical panel width is Δ=L/N and its normalized width is 1/N; if gx(y)=kI(x,y)u(y) has the stated uniform second-derivative bound M2:=sup⁡x,y∈I∣∂y2gx(y)∣, the midpoint residual from Composite midpoint error bound for a twice continuously differentiable function becomes ∥KN,Iu−KIu∥∞≤LΔ224M2. Equivalently, the transformed integrand Lgx(α+L ⋅) has second derivative bounded by L3M2, and (1/N)2=Δ2/L2.

For the half-order kernel kI(x,y)=∣x−y∣−1/2aI(x,y), the transformed regular factor is a~(t,s)=L1/2aI(α+Lt,α+Ls), because dy=L ds and ∣x−y∣−1/2=L−1/2∣t−s∣−1/2. The physical product weights use the hats ϕN,jI(y):=ϕN,j((y−α)/L) on nodes xj=α+jΔ and satisfy WN,j(x):=∫αβ∣x−y∣−1/2ϕN,jI(y) dy=L1/2wN,j ⁣(x−αL). The improper singular functional has ∥SxI∥=SxI(1)=2x−α+2β−x≤22L. Consequently the product weights are nonnegative and their exact sum and stability bound are ∑jWN,j(x)=2x−α+2β−x≤22L; the closed forms in Closed forms for the half-order piecewise-linear product weights apply in normalized coordinates and are multiplied by L1/2. The half-order kernel translation modulus scales as τI(d)=L1/2τ(d/L), by the same change of variables, so it still tends to zero as d↓0. Suppose each gx(y):=aI(x,y)u(y) extends to a C2 function on a neighborhood of I and put M2,I:=sup⁡x,y∈I∣∂y2gx(y)∣<∞. In normalized coordinates the regular factor is g~t(s)=L1/2gα+Lt(α+Ls), so sup⁡t,s∣∂s2g~t(s)∣=L5/2M2,I and the normalized panel width is 1/N=Δ/L. Applying the unit-interval interpolation bound from Pointwise linear interpolation error from a second-derivative bound and the collective compact solution estimate gives the physical product-interpolation residual and Fredholm solution bound ∥KN,Iu−KIu∥∞≤24L1/2M2,IΔ2, ∥uN,I−u∥∞≤C(∥fN,I−f∥∞+24L1/2M2,IΔ2), with the same uniform inverse bound C as for the conjugated unit-interval problem. Setting L=1 recovers every formula in the assigned items; the unit-interval examples are the canonical normalized cases.

3 · Logical flowchart

4 · Definitions, theorems and proofs

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

Nyström quadrature operators and their reconstructed equations

Definition

Let X:=C([0,1],R) be the real continuous functions on [0,1] (The space C(K,R) of continuous real-valued functions on a nonempty compact metric space) with the supremum norm ∥u∥∞:=sup⁡0≤x≤1∣u(x)∣. The interval [0,1] is a nonempty compact metric space by 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. 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). Fix a continuous real kernel k:[0,1]2→R. The integral ∫01 below is the ordinary Riemann integral, equivalently the Riemann–Stieltjes integral with integrator y↦y (Riemann–Stieltjes sums, upper and lower sums, and the Riemann–Stieltjes integral). For u∈X, define (Ku)(x):=∫01k(x,y)u(y) dy,0≤x≤1. The integrand is continuous in y, so this integral exists by A continuous function on [a,b] is Riemann integrable, by Heine-Cantor and Riemann's criterion.

A finite quadrature rule on [0,1] consists of an integer m≥1, nodes y1,…,ym∈[0,1], and real weights w1,…,wm. It acts on a function g defined at the nodes by Q(g):=∑j=1mwjg(yj). Its Nyström operator is the finite-sum rule (KQu)(x):=Q(k(x,⋅)u(⋅))=∑j=1mwjk(x,yj)u(yj). In particular, for the composite midpoint rule with N≥1 panels, h:=1/N, yj:=(j+12)h for 0≤j<N, and wj=h, the operator is denoted KN. The nodes and weights are those of Composite midpoint rule on a uniform grid.

For a right-hand side f∈X, the Nyström equation is uQ−KQuQ=f. This definition asserts neither consistency nor convergence of KQ to K.

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

Finite-node Nyström equations are equivalent to their reconstructed equations

Statement

Let X:=C([0,1],R) (The space C(K,R) of continuous real-valued functions on a nonempty compact metric space), let m≥1, let y1,…,ym∈[0,1], and let ψ1,…,ψm∈X. Define the finite-rank linear map (Fu)(x):=∑j=1mψj(x)u(yj) and, for f∈X, define the square matrix and vector Mij:=δij−ψj(yi),bi:=f(yi),1≤i,j≤m. Then the solutions of (I−F)u=f are in bijection with the solutions c∈Rm of Mc=b, via u(x)=f(x)+∑j=1mψj(x)cj,ci=u(yi). The nullspaces of I−F and M are linearly isomorphic by c↦∑jψjcj. In particular, I−F is bijective if and only if M is nonsingular.

Facts & Assumptions

Given: The space X, nodes yi, continuous coefficient functions ψi, and f∈X as in the Statement.

[F1]

The space C(K,R) of continuous real-valued functions on a nonempty compact metric space: members of X are continuous real-valued functions on [0,1], so finite linear combinations of the ψj and f lie in X.

[F2]

Rank-nullity: dim⁡FV=nullity⁡T+rank⁡T: a linear map on the finite-dimensional space Rm is injective if and only if it is surjective, hence a square matrix is nonsingular exactly when its kernel is zero.

Proof

Given: The data in the Statement, the operator F, the matrix M, and the vector b.

1.1givenF1algebra

If u solves (I−F)u=f, put ci:=u(yi). Evaluating u(x)−∑jψj(x)u(yj)=f(x) at x=yi gives ci−∑jψj(yi)cj=f(yi) for every i, which is exactly Mc=b.

2.1givenF1step 1.1algebraconstruct

Conversely, if Mc=b, define u(x):=f(x)+∑jψj(x)cj. By [F1] this lies in X. The matrix equation gives u(yi)=f(yi)+∑jψj(yi)cj=ci for each i, so u=f+Fu and it solves (I−F)u=f. These constructions are inverse because each reconstructed function has the prescribed grid values.

3.1givenF2step 2.1algebra∎

If Mc=0 and c≠0, set v(x):=∑jψj(x)cj. The homogeneous matrix equations imply v(yi)=ci; hence v≠0 and Fv=v. Thus a nonzero matrix kernel gives a nonzero kernel of I−F. Conversely, if (I−F)v=0 and v≠0, then ci:=v(yi) satisfies Mc=0; if c=0, the formula v=Fv=∑jψjv(yj) would give v=0, a contradiction. Therefore the two kernels are simultaneously trivial. By [F2] this is equivalent to M being nonsingular; [step 2.1] then gives bijective solvability of the reconstructed equation exactly when the matrix is nonsingular.

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

A continuous kernel defines a compact integral operator on C of an interval

Statement

Assume Countable Choice and Dependent Choice. Let X:=C([0,1],R) with ∥u∥∞:=sup⁡x∈[0,1]∣u(x)∣ (The space C(K,R) of continuous real-valued functions on a nonempty compact metric space, C(K,R) is complete in the supremum metric for every nonempty compact metric space K) and let k:[0,1]2→R be continuous. The map (Ku)(x):=∫01k(x,y)u(y) dy uses the ordinary Riemann integral of Riemann–Stieltjes sums, upper and lower sums, and the Riemann–Stieltjes integral and defines a bounded linear operator K:X→X, and it is compact (Compact linear operator).

Facts & Assumptions

Given: Countable Choice, Dependent Choice, X=C([0,1],R), and a continuous kernel k on the compact square [0,1]2.

[F1]

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

[F2]

Integrable functions on [a,b] form a set closed under sums and scalar multiples, and ∫ab(λf+μg)=λ∫abf+μ∫abg: finite sums and scalar multiples of Riemann-integrable functions are integrable and their integrals are the corresponding finite sums and scalar multiples.

[F3]

Uniformly close integrable functions have integrals differing by at most the interval length times their uniform error: if two integrable functions differ everywhere by at most η, then their integrals on an interval of length L differ by at most Lη.

[F4]

Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous: a continuous function on a compact metric space is uniformly continuous.

[F5]

Arzelà--Ascoli for real C(K) under Countable Choice and Dependent Choice: compact closure iff equicontinuous and pointwise bounded: under Countable Choice and Dependent Choice, an equicontinuous pointwise bounded family in C(K,R) on a compact metric space has compact closure in the supremum metric.

[F6]

C(K,R) is complete in the supremum metric for every nonempty compact metric space K: every continuous real-valued function on a compact metric space is bounded, so M is finite.

[F7]

Compact linear operator: a bounded linear operator is compact when the image of its closed unit ball has compact closure.

[F9]

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).

[F10]

A linear map between normed spaces is bounded when its values satisfy a uniform norm bound (A bounded linear operator between normed spaces).

Proof

Given: The data in the Statement, M:=sup⁡(x,y)∈[0,1]2∣k(x,y)∣, and the modulus ω(δ):=sup⁡{∣k(x,y)−k(x′,y)∣:∣x−x′∣≤δ, y∈[0,1]}.

1.1givenF1F2F3F6F8F10

By [F8], the domain of k is a compact metric space, so [F6] makes M finite. For each u∈X and x∈[0,1], the function y↦k(x,y)u(y) is continuous, so its Riemann integral exists by [F1]. Linearity [F2] makes K linear. Since ∣k(x,y)u(y)∣≤M∥u∥∞, [F3] applied against the zero function gives ∣Ku(x)∣≤M∥u∥∞, so [F10] makes K bounded.

2.1givenF3F4F8step 1.1

For x,x′∈[0,1], [F3] applied to the two continuous integrands gives ∣Ku(x)−Ku(x′)∣≤sup⁡y∈[0,1]∣k(x,y)−k(x′,y)∣ ∥u∥∞≤ω(∣x−x′∣)∥u∥∞. By [F4] on the compact square from [F8], ω(δ)→0 as δ↓0, so Ku is continuous and K maps X into X.

3.1step 1.1step 2.1

For every u in the closed unit ball, step 1.1 gives ∥Ku∥∞≤M, while step 2.1 gives the common equicontinuity modulus ω. Thus the image of the unit ball is pointwise bounded and equicontinuous.

4.1A1F5F7F8F9step 3.1∎

By [A1] and [F5], applied on the compact interval from [F8], the image of the unit ball has compact closure in the supremum metric. [F9] supplies the Banach norm structure on X with this same metric, so [F7] makes K compact.

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

Collective compactness gives eventual Fredholm invertibility and solution error bounds

Statement

Assume the Axiom of Choice. Let X≠{0} be a Banach space (Banach space), let K:X→X be compact, and let (Kn)n≥1 be bounded linear operators such that ⋃n≥1Kn(BX)‾ is compact for the closed unit ball BX:={x∈X:∥x∥≤1} and Knx→Kx in norm for every x∈X. Suppose I−K is injective. Then there are n0≥1 and C<∞ such that I−Kn is boundedly invertible for every n≥n0 and sup⁡n≥n0∥(I−Kn)−1∥≤C. For any f,fn∈X, if u and un solve (I−K)u=f and (I−Kn)un=fn, then for n≥n0, ∥un−u∥≤C(∥(Kn−K)u∥+∥fn−f∥). The theorem does not assert that ∥Kn−K∥→0.

Facts & Assumptions

Given: AC, the Banach space X≠{0}, compact K, bounded linear Kn, compact closure of the union of their unit-ball images, pointwise norm convergence Knx→Kx, and injectivity of I−K.

[A1]

The Axiom of Choice and AC supplies the countable and dependent choices used in Banach integration: AC supplies Countable Choice and Dependent Choice, including the prescribed countable selections used below.

[F1]

Fredholm alternative for identity minus compact: under AC, for a compact operator on a Banach space, injectivity of I−T implies surjectivity and a bounded inverse.

[F3]

A compact subset of a metric space is closed and bounded: a compact subset of a normed space is bounded and closed.

[F4]

Compact linear operator: compactness means that every bounded set has image with compact closure; in particular each Kn is compact when its unit-ball image has compact closure.

[F5]

The operator norm as the least bound and as the unit-sphere or unit-ball supremum: for a bounded linear operator, its norm is the supremum of the norms of its image on the closed unit ball.

Proof

Given: The data in the Statement.

1.1givenF1

Since K is compact and I−K is injective, [F1] gives a bounded inverse (I−K)−1.

1.2givenA1F2choose

We claim there are n0 and c>0 such that ∥(I−Kn)x∥≥c∥x∥ for all x∈X and n≥n0. Otherwise, for each integer m≥1, failure of the bound c=1/m for all n≥m gives an index nm≥m and a unit vector xm with ∥(I−Knm)xm∥<1/m; [A1] permits choosing such a sequence. Then xm=(I−Knm)xm+Knmxm. The sequence (Knmxm) lies in the compact closure of the union in the Statement, so [F2] gives a convergent subsequence, say Knmjxmj→y. The displayed identity and ∥(I−Knmj)xmj∥→0 imply xmj→y, hence ∥y∥=1.

2.1givenF3F5step 1.2algebra

By [F3], choose M<∞ bounding the norms of all vectors in the compact union closure. Every Kn maps the unit ball into this closure, so [F5] gives ∥Kn∥≤M for all n. Along the subsequence in step 1.2, ∥Knmjxmj−Knmjy∥≤M∥xmj−y∥→0, while pointwise convergence for the fixed vector y gives Knmjy→Ky. Therefore the same sequence converges to both y and Ky, so Ky=y. This contradicts injectivity of I−K because ∥y∥=1.

3.1givenF1F4step 1.2step 2.1

The contradiction in step 2.1 establishes the eventual lower bound claimed in step 1.2, so each I−Kn is injective for n≥n0. Its unit-ball image is contained in the compact closure from the Statement, so Kn is compact by [F4]; applying [F1] to each Kn makes I−Kn surjective with bounded inverse. For z=(I−Kn)x, the same lower bound gives ∥(I−Kn)−1z∥=∥x∥≤c−1∥z∥, hence the inverse norms are uniformly at most C:=c−1.

4.1givenstep 3.1algebra∎

Subtracting the equations gives (I−Kn)(un−u)=fn−f+(Kn−K)u. Applying the inverse from step 3.1 and the triangle inequality yields the stated error estimate.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

The half-order diagonal singularity defines a bounded improper integral

Statement

For x∈[0,1], g∈C([0,1],R), and 0<ε<1, let Sx,ε(g):=∫[0,1]∖(x−ε,x+ε)∣x−y∣−1/2g(y) dy, where the integral is the sum of the ordinary Riemann integrals on the at most two remaining closed intervals, and an empty interval contributes zero. The limit Sx(g):=lim⁡ε↓0Sx,ε(g) exists. The map Sx:C([0,1],R)→R is linear and positive, and its operator norm (The operator norm as the least bound and as the unit-sphere or unit-ball supremum) is ∥Sx∥=Sx(1)=2x+21−x≤22.

Facts & Assumptions

Given: x∈[0,1], g∈C([0,1],R), and the truncated Riemann integrals Sx,ε(g) from the Statement.

[F1]

Riemann–Stieltjes sums, upper and lower sums, and the Riemann–Stieltjes integral: ∫ab denotes the ordinary Riemann integral, realized as the Riemann–Stieltjes integral with the identity integrator.

[F2]

A continuous function on [a,b] is Riemann integrable, by Heine-Cantor and Riemann's criterion: a continuous real-valued function on each remaining closed interval has an ordinary Riemann integral.

[F4]

The two FTC forms for a Riemann–Stieltjes integral with a C1 integrator: for the identity integrator, an antiderivative evaluates the integral; since (2r)′=r−1/2 on r>0, ∫δεr−1/2dr=2(ε−δ) for 0<δ<ε.

[F5]

The reals are complete: every Cauchy sequence of real numbers converges.

[F7]

C(K,R) is complete in the supremum metric for every nonempty compact metric space K: every continuous real-valued function on [0,1] is bounded, so M:=∥g∥∞ is finite.

[F10]

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).

[F11]

The operator norm of a bounded linear map is the supremum of its values on the closed unit ball (The operator norm as the least bound and as the unit-sphere or unit-ball supremum).

Proof

Given: The data in the Statement, M:=∥g∥∞, and 0<δ<ε<1.

1.1givenF1F2F7F9

By [F9], [F7] applies and M=∥g∥∞ is finite. The integrand y↦∣x−y∣−1/2g(y) is continuous on each closed interval in [0,1]∖(x−ε,x+ε), because that set stays away from x. Thus the truncated integrals are finite and defined by [F1].

1.2givenF2F3F4F5F8algebra

For m≥2, put am:=Sx,1/m(g). By [F8], the difference am−aℓ integrates only over the two annuli between the cutoffs 1/m and 1/ℓ. On each annulus, ∣g(y)∣≤M; by [F2] and [F3], its absolute integral is bounded by M∫min⁡(1/m,1/ℓ)max⁡(1/m,1/ℓ)r−1/2dr. Adding at most two sides gives ∣am−aℓ∣≤4M∣m−1/2−ℓ−1/2∣, so (am) is Cauchy and has a limit L by [F5]. For any ε>0, choose m with 1/m<ε; comparing the two cutoffs gives ∣Sx,ε(g)−am∣≤4Mε. Letting m→∞ along such choices yields ∣Sx,ε(g)−L∣≤4Mε, so Sx,ε(g)→L as ε↓0.

2.1givenF3F4F8step 1.2algebra

For every ε, comparison on the left and right of x with the positive function r−1/2 gives ∣Sx,ε(g)∣≤M(2x+21−x). Taking the limit from step 1.2 proves the same bound for Sx(g). For g=1, the truncated integrals increase to the sum of the two endpoint integrals by [F8], so Sx(1)=2x+21−x. Since (2x−1)2≥0, we have 2x(1−x)≤1, and therefore Sx(1)2=4(1+2x(1−x))≤8. Thus Sx(1)≤22.

3.1F3F6F9F10F11step 2.1algebra∎

Each truncated functional is linear and nonnegative on nonnegative g; limits preserve those equalities and inequalities, so Sx is linear and positive. By [F10] it is a linear functional on a normed space. Step 2.1 gives ∣Sx(g)∣≤Sx(1)∥g∥∞, and the input g=1 attains equality; [F11] therefore gives ∥Sx∥=Sx(1).

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

Translations of the half-order kernel are continuous in the improper L1 norm

Statement

Put s(t):=∣t∣−1/2 for t∈[−1,1]∖{0}. For x,x′∈[0,1], define T(x,x′):=∫01∣s(x−y)−s(x′−y)∣ dy as an improper Riemann integral split at the distinct points among x and x′; an endpoint value at a singular point is omitted. If x=x′, set T(x,x)=0. These improper integrals exist and are finite. The modulus τ(d):=sup⁡{T(x,x′):x,x′∈[0,1], ∣x−x′∣≤d} is finite and satisfies τ(d)→0 as d↓0.

Facts & Assumptions

Given: x,x′∈[0,1], the singular function s(t)=∣t∣−1/2 for t≠0, and the improper Riemann integral convention in the Statement.

[F1]

Riemann–Stieltjes sums, upper and lower sums, and the Riemann–Stieltjes integral defines the ordinary integrals on nonsingular closed intervals, with the identity as integrator. Here an improper integral means the limit of the truncated integrals, by the convention in the Statement; existence of that limit is proved below.

[F2]

The two FTC forms for a Riemann–Stieltjes integral with a C1 integrator: for 0<δ<η, ∫δηr−1/2 dr=2(η−δ).

[F3]

The reals are complete: every Cauchy sequence of real numbers has a real limit.

[F4]

A continuous function on [a,b] is Riemann integrable, by Heine-Cantor and Riemann's criterion: a continuous function on a closed interval has an ordinary Riemann integral.

[F6]

Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous: a continuous function on the compact interval [−1,1] is uniformly continuous.

[F7]

The Cauchy-sequence reals have the least-upper-bound property: every nonempty bounded set of reals has a finite supremum.

Proof

Given: The data in the Statement, d:=∣x−x′∣, and 0<η<1.

1.1givenF2F3F4F5algebra

If x=x′, then the integrand is zero away from the omitted singular point and T(x,x′)=0. Suppose x≠x′. Split [0,1] at x and x′. On the interior of each resulting interval the integrand is continuous by [F4]. Near a singular endpoint c∈{x,x′}, take a cutoff ρ<∣x−x′∣/3. The other singular term is bounded there by (2∣x−x′∣/3)−1/2, while the term singular at c has tail integral at most 2ρ by [F2] after the lower cutoff tends to zero. Thus each omitted endpoint tail is at most 2ρ+2ρ(2∣x−x′∣/3)−1/2, which tends to zero. Taking cutoffs ρm=∣x−x′∣/(4(m+1)) for integers m≥0 gives a Cauchy sequence of truncated sums by additivity and comparison [F5]; [F3] gives a finite limit. The same tail bound compares any sufficiently small cutoff with this cofinal sequence, so the improper limit exists. The argument also applies when a singular point is 0 or 1, with only one adjacent interval.

1.2givenF1F2F4algebra

For t∈[−1,1], define sη(t):=min⁡{η−1/2,∣t∣−1/2} when t≠0 and sη(0):=η−1/2. This is continuous. Direct integration using [F2] gives ∫−11∣s(t)−sη(t)∣ dt=2∫0η(t−1/2−η−1/2) dt=2η. The two translated tails on y∈[0,1] are each bounded by this full tail.

2.1givenF1F5F6F7F8step 1.1step 1.2algebra∎

For every y outside the finitely many singular points, the triangle inequality gives ∣s(x−y)−s(x′−y)∣≤∣s(x−y)−sη(x−y)∣+∣sη(x−y)−sη(x′−y)∣+∣sη(x′−y)−s(x′−y)∣. Integrating truncated intervals and taking the limits from step 1.1, the first and third terms each contribute at most 2η by step 1.2. The middle term is at most ωη(d):=sup⁡∣t−t′∣≤d∣sη(t)−sη(t′)∣, since the interval has length one. Thus T(x,x′)≤4η+ωη(d). By [F8], the domain [−1,1] is compact, so [F6] gives ωη(d)→0 as d↓0 for fixed η; also ωη(d)≤2η−1/2, so the preceding bound bounds every T(x,x′). The set in the definition of τ(d) is nonempty because it contains T(x,x)=0, so [F7] gives its finite supremum. Given ϵ>0, first choose η with 4η<ϵ/2, then choose d0>0 with ωη(d0)<ϵ/2. For every d≤d0, the same bound gives τ(d)≤ϵ, proving τ(d)→0.

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

The operator-norm Nyström perturbation bound

Statement

Use X, K, and the finite quadrature Nyström operator KQ from Nyström quadrature operators and their reconstructed equations. Suppose A:=I−K has a bounded inverse, put R:=∥A−1∥, and let ε:=∥KQ−K∥ as an operator on X. If q:=Rε<1, then I−KQ has a bounded inverse and ∥(I−KQ)−1∥≤R1−q. For f,fQ∈X, let u and uQ solve (I−K)u=f and (I−KQ)uQ=fQ. Then ∥uQ−u∥∞≤R1−q(∥(KQ−K)u∥∞+∥fQ−f∥∞). When Q is point sampling on all of C([0,1],R), this theorem is conditional: its hypothesis is an actual operator-norm bound, not merely convergence of the quadrature on each fixed continuous integrand.

Facts & Assumptions

Given: The Nyström operators in the Statement, a bounded inverse A−1, and q=∥A−1∥∥KQ−K∥<1.

[F1]

Nyström quadrature operators and their reconstructed equations: KQ is the finite-sum map u↦∑jwjk(⋅,yj)u(yj), with continuous coefficient functions x↦wjk(x,yj).

[F2]

Finite-node Nyström equations are equivalent to their reconstructed equations: the finite system is nonsingular exactly when the reconstructed operator I−KQ is bijective.

[F3]

Neumann series and small perturbations of bounded inverses: if ∥R∥<1, then I−R is invertible with inverse norm at most (1−∥R∥)−1; if A and E are bounded and A−1 is bounded with ∥A−1E∥<1, then A+E=A(I+A−1E) is invertible.

[F4]

The operator norm as the least bound and as the unit-sphere or unit-ball supremum: ∥T∥ is defined for a bounded linear operator by its supremum on the unit ball.

[F5]

Composition satisfies |ST|\le|S|,|T|: for bounded linear operators S,T, ∥ST∥≤∥S∥∥T∥.

[F6]

A bounded linear operator between normed spaces: a linear map is bounded when one constant bounds its output norm by that constant times the input norm.

[F7]

The square [0,1]2 is compact (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), so k is bounded by C(K,R) is complete in the supremum metric for every nonempty compact metric space K. If M:=sup⁡(x,y)∈[0,1]2∣k(x,y)∣, the integral formula and Uniformly close integrable functions have integrals differing by at most the interval length times their uniform error give ∥Ku∥∞≤M∥u∥∞, and Integrable functions on [a,b] form a set closed under sums and scalar multiples, and ∫ab(λf+μg)=λ∫abf+μ∫abg makes K linear. The finite-sum formula and Triangle inequality for finite sums, Finite sums and finite products, by recursion, Laws of finite sums and finite products give ∥KQu∥∞≤M∥u∥∞∑j∣wj∣ and make KQ linear. Hence ∥(KQ−K)u∥∞≤M(1+∑j∣wj∣)∥u∥∞ and ∥(I−K)u∥∞≤(1+M)∥u∥∞; thus K, KQ, KQ−K, and A=I−K are bounded linear maps in the sense of [F6].

Proof

Given: The operators and right-hand sides in the Statement, E:=K−KQ, and A:=I−K.

1.1givenF1F2F3F4F5F6F7algebra

By [F7] and [F6], KQ−K is bounded, so its norm ε is defined by [F4]. Put E:=K−KQ; then I−KQ=A+E=A(I+A−1E) and ∥A−1E∥≤∥A−1∥∥E∥=Rε=q<1 by [F5]. Applying both parts of [F3], with R0:=−A−1E, gives invertibility and ∥(I−KQ)−1∥=∥(I+A−1E)−1A−1∥≤R1−∥A−1E∥≤R1−q. The coefficient functions x↦wjk(x,yj) are continuous because k is continuous, so [F2] applies and the associated finite system has the same unique solvability.

2.1givenF1F4step 1.1algebra

Subtracting (I−K)u=f from (I−KQ)uQ=fQ in the form (I−KQ)(uQ−u)=fQ−f+(KQ−K)u and applying the inverse from step 1.1 yields the stated error estimate by the triangle inequality.

3.1step 1.1step 2.1∎

The two displayed conclusions are exactly the inverse and solution bounds obtained in steps 1.1 and 2.1. This proof uses the norm hypothesis ε itself and asserts no norm convergence of the point-sampling operators.

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

Composite midpoint Nyström operators are collectively compact and consistent

Statement

Assume AC. Let k:[0,1]2→R be continuous and let K be its integral operator from Nyström quadrature operators and their reconstructed equations. For each N≥1, let KN use the composite midpoint rule with h=1/N. Then each KN is a bounded linear map X→X, K is compact, the family (KN)N≥1 is collectively compact (the union of the images of the unit ball has compact closure in X), and ∥KNu−Ku∥∞⟶0for every u∈X.

Facts & Assumptions

Given: AC, the continuous kernel k, its integral operator K, and the composite midpoint operators KN on X=C([0,1],R).

[A1]

The Axiom of Choice and AC supplies the countable and dependent choices used in Banach integration: AC supplies both Countable Choice and Dependent Choice, as required by the local compactness and Arzelà–Ascoli suppliers.

[F1]

Nyström quadrature operators and their reconstructed equations: KNu(x)=h∑j=0N−1k(x,(j+12)h)u((j+12)h).

[F2]

A continuous kernel defines a compact integral operator on C of an interval: under Countable Choice and Dependent Choice, the continuous-kernel integral operator K:X→X is bounded and compact.

[F3]

Composite midpoint rule on a uniform grid: the midpoint rule on N uniform panels uses h=1/N, one midpoint per panel, and weight h.

[F4]

Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous: the kernel k and, for each fixed u∈X, the function (x,y)↦k(x,y)u(y) are uniformly continuous on the compact square.

[F5]

Arzelà--Ascoli for real C(K) under Countable Choice and Dependent Choice: compact closure iff equicontinuous and pointwise bounded: under Countable Choice and Dependent Choice, a pointwise bounded equicontinuous family in C([0,1],R) has compact closure.

[F7]

C(K,R) is complete in the supremum metric for every nonempty compact metric space K: the continuous kernel is bounded on the compact square, so M:=∥k∥∞<∞.

[F9]

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).

[F10]

A linear map between normed spaces is bounded when one constant bounds its output norm by that constant times the input norm (A bounded linear operator between normed spaces).

[F11]

Additivity and scalar homogeneity of finite sums make the midpoint finite-sum formula linear in u (Finite sums and finite products, by recursion, Laws of finite sums and finite products).

Proof

Given: AC, N≥1, h=1/N, M:=∥k∥∞, and the operators in the Statement.

1.1A1F2

Compactness of K is [F2], whose Countable Choice and Dependent Choice hypotheses follow from [A1].

1.2givenF1F3F4F7F8F9F10F11algebra

By [F8], the square is compact, so [F7] makes M=∥k∥∞ finite. Each finite sum in [F1] is continuous in x, so KNu∈X. The formula is linear in u by [F11], and for arbitrary u∈X it gives ∣KNu(x)∣≤hNM∥u∥∞=M∥u∥∞, so KN is bounded in the Banach norm of [F9] by [F10]. For ∥u∥∞≤1, [F1] and [F3] give ∣KNu(x)∣≤M for every x. For x,x′∈[0,1] they also give ∣KNu(x)−KNu(x′)∣≤sup⁡y∈[0,1]∣k(x,y)−k(x′,y)∣. Uniform continuity of k on the square makes the right side a common modulus tending to zero as ∣x−x′∣→0. Thus the union of all unit-ball images is pointwise bounded and equicontinuous.

2.1A1F5F8F9step 1.2

By [F5] on the compact interval supplied by [F8] and [A1], the closure of that union is compact, so (KN) is collectively compact. The Banach space X is normed by [F9], and its metric is the supremum metric used here.

3.1givenF1F3F4F6F8algebra∎

Fix u∈X and put Gu(x,y):=k(x,y)u(y). By [F4] on the compact square from [F8], its uniform modulus in the y variable, ωu(ρ):=sup⁡{∣Gu(x,y)−Gu(x,y′)∣:x∈[0,1], ∣y−y′∣≤ρ}, tends to zero as ρ↓0. On each midpoint panel Ij=[jh,(j+1)h] with midpoint mj, [F6] gives ∣hGu(x,mj)−∫IjGu(x,y) dy∣≤h ωu(h/2). Adding the N panel bounds and using Nh=1 yields ∥KNu−Ku∥∞≤ωu(h/2)→0.

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

Piecewise-linear product integration for a half-order diagonal singularity

Definition

Let X:=C([0,1],R) and let a:[0,1]2→R be continuous. Use Sx from The half-order diagonal singularity defines a bounded improper integral to define (Ku)(x):=Sx(y↦a(x,y)u(y)). For an integer n≥1, set h:=1/n and yj:=jh for j=0,…,n. Define the nonnegative piecewise-linear hat functions by ϕn,0(y):=max⁡(1−y/h,0),ϕn,n(y):=max⁡(1−(1−y)/h,0), and, for 1≤j<n, ϕn,j(y):=max⁡(1−∣y−yj∣/h,0). Their piecewise-linear interpolant is Ing:=∑j=0ng(yj)ϕn,j. The product weights and product-integration operator are wn,j(x):=Sx(ϕn,j),(Knu)(x):=∑j=0nwn,j(x)a(x,yj)u(yj)=Sx(In(y↦a(x,y)u(y))). The kernel factor s(x,y)=∣x−y∣−1/2 is integrated in the weights; the smooth factor a(x,y)u(y) is interpolated. This item defines the pointwise formulas; the subsequent results on this page establish their mapping properties, stability, and error estimates.

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

Closed forms for the half-order piecewise-linear product weights

Statement

Use the nodes, hats, and weights wn,j(x)=Sx(ϕn,j) of Piecewise-linear product integration for a half-order diagonal singularity. For x∈[0,1], 0≤α≤β≤1, and u,v∈R, put C:=u+vx and, for r≥0, define Px,u,v(r):=2Cr+23vrr,Qx,u,v(r):=2Cr−23vrr. Write r+:=max⁡(r,0) and set Jx[α,β;u,v]:=Qx,u,v((x−α)+)−Qx,u,v((x−β)+)+Px,u,v((β−x)+)−Px,u,v((α−x)+). Then this is the exact improper Riemann integral Jx[α,β;u,v]=∫αβ∣x−y∣−1/2(u+vy) dy, with the integral split at x if x∈[α,β]. In particular, for h=1/n and yj=jh, wn,0(x)=Jx[0,h;1,−h−1], wn,j(x)=Jx[yj−1,yj;−yj−1/h,h−1]+Jx[yj,yj+1;yj+1/h,−h−1],1≤j<n, and wn,n(x)=Jx[yn−1,1;−yn−1/h,h−1]. The formulas include x at a panel endpoint and the one-panel case n=1.

Facts & Assumptions

Given: x∈[0,1], 0≤α≤β≤1, u,v∈R, and the hat functions and weights from the product-integration definition.

[F1]

Piecewise-linear product integration for a half-order diagonal singularity: each hat is affine on each adjacent panel, the product weight is wn,j(x)=Sx(ϕn,j), and the hat formulas are specified at both endpoints.

[F2]

The half-order diagonal singularity defines a bounded improper integral: for every continuous g on [0,1], Sx(g) exists as the improper Riemann integral of ∣x−y∣−1/2g(y).

[F3]

Existence and uniqueness of n-th roots: a unique a1/n≥0 with (a1/n)n=a: for r≥0, r is the unique nonnegative real whose square is r (the case n=2).

[F5]

The two FTC forms for a Riemann–Stieltjes integral with a C1 integrator: a continuous integrand with an antiderivative on a closed interval has integral equal to the endpoint difference; the identity integrator gives the ordinary Riemann integral.

[F6]

A continuous function on [a,b] is Riemann integrable, by Heine-Cantor and Riemann's criterion: a continuous function on a closed interval has an ordinary Riemann integral.

Proof

Given: The data in the Statement, C=u+vx, and the functions Px,u,v and Qx,u,v.

1.1givenF3F4F8algebra

Fix r>0 and put q:=r, which is positive by [F3] because q2=r>0. For s>0, rationalizing gives ∣s−q∣=∣s−r∣/(s+q)≤∣s−r∣/q, so s→q as s→r. For s≠r the difference quotient is (s−q)/(s−r)=1/(s+q), and ∣1/(s+q)−1/(2q)∣=∣q−s∣/(2q(s+q))≤∣s−r∣/(2q3), so (r)′=1/(2r). By the product rule [F4], Px,u,v′(r)=Cr−1/2+vr=r−1/2(C+vr) and Qx,u,v′(r)=Cr−1/2−vr=r−1/2(C−vr). Since u+vy=C+v(y−x), [F8] makes Px,u,v(y−x) an antiderivative of (y−x)−1/2(u+vy) for y>x. Since u+vy=C−v(x−y), [F8] makes −Qx,u,v(x−y) an antiderivative of (x−y)−1/2(u+vy) for y<x.

2.1givenF2F3F5F6F7step 1.1algebra

By [F3], for every ϵ>0, 0≤δ<ϵ2 implies 0≤δ<ϵ; hence δ→0 and both Px,u,v(δ) and Qx,u,v(δ) tend to zero as δ↓0. If x>α, evaluate the left integral on [α,min⁡(β,x−δ)] for sufficiently small δ>0 using [F6], [F5], and step 1.1. As δ↓0, its value tends to Qx,u,v((x−α)+)−Qx,u,v((x−β)+). If x≤α, the left contribution and this expression are zero. Likewise, if x<β, evaluate the right integral on [max⁡(α,x+δ),β] for sufficiently small δ>0; its limit is Px,u,v((β−x)+)−Px,u,v((α−x)+). If x≥β, the right contribution and this expression are zero. Thus both one-sided integrals exist and have the displayed values. Splitting truncated intervals by [F7] and passing to their finite limits gives exactly Jx[α,β;u,v].

3.1givenF1step 2.1algebra∎

On [0,h], ϕn,0(y)=1−y/h; for an interior index j, its left and right affine pieces are (y−yj−1)/h and (yj+1−y)/h; on [yn−1,1], ϕn,n(y)=(y−yn−1)/h. Substituting these coefficients into the integral formula of step 2.1 gives the three displayed formulas for wn,j. The endpoint cases use positive parts in J, so a singularity at a split point contributes a zero primitive value, and when n=1 the interior-index range is empty while both endpoint formulas remain valid.

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

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.

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

Stability, collective compactness, and consistency of half-order product integration

Statement

Assume AC and let a:[0,1]2→R be continuous. For K and Kn from Piecewise-linear product integration for a half-order diagonal singularity, put A:=∥a∥∞ and h:=1/n. Then both operators are bounded linear maps from X=C([0,1],R) to itself, K is compact, and (Kn) is collectively compact and converges pointwise in norm to K. Their product weights satisfy wn,j(x)≥0,∑j=0n∣wn,j(x)∣=2x+21−x≤22 for every x∈[0,1]. If each gx(y):=a(x,y)u(y) extends to a C2 function on a neighborhood of [0,1] and M2:=sup⁡x,y∣∂y2gx(y)∣<∞, then ∥Knu−Ku∥∞≤24M2h2.

Facts & Assumptions

Given: AC, continuous a, the scalar functionals Sx, hat functions ϕn,j, and operators K,Kn defined in the preceding item.

[A1]

The Axiom of Choice and AC supplies the countable and dependent choices used in Banach integration: AC supplies the two choice hypotheses of real Arzelà–Ascoli.

[F1]

Piecewise-linear product integration for a half-order diagonal singularity: Knu(x)=Sx(Ingx) for gx(y)=a(x,y)u(y), and wn,j(x)=Sx(ϕn,j).

[F2]

The half-order diagonal singularity defines a bounded improper integral: Sx is positive, linear, and ∣Sx(g)∣≤22∥g∥∞; it is integration against ∣x−y∣−1/2 in the improper-Riemann sense.

[F3]

Translations of the half-order kernel are continuous in the improper L1 norm: the finite modulus τ(d):=sup⁡∣x−x′∣≤d∫01∣s(x−y)−s(x′−y)∣dy tends to zero as d↓0.

[F4]

Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous: continuous a and gu(x,y)=a(x,y)u(y) on the compact square are uniformly continuous.

[F5]

Arzelà--Ascoli for real C(K) under Countable Choice and Dependent Choice: compact closure iff equicontinuous and pointwise bounded: under Countable Choice and Dependent Choice, an equicontinuous pointwise bounded family on [0,1] has compact closure in X.

[F6]

Higher derivatives and the classes Ck and C∞ and Pointwise linear interpolation error from a second-derivative bound: for g∈C2 on a neighborhood of a panel of width h, the linear interpolant error is at most 12∥g′′∥∞(y−yj)(yj+1−y)≤h2∥g′′∥∞/8.

[F7]

C(K,R) is complete in the supremum metric for every nonempty compact metric space K: every continuous a on the compact square is bounded, so A:=∥a∥∞<∞.

[F9]

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).

[F10]

A linear map between normed spaces is bounded when a constant bounds its output norm by that constant times the input norm (A bounded linear operator between normed spaces).

[F11]

Additivity and scalar homogeneity of finite sums make the finite-sum interpolation formula linear in its input (Finite sums and finite products, by recursion, Laws of finite sums and finite products).

[F12]

A bounded linear operator is compact if the image of its closed unit ball has compact closure (Compact linear operator).

Proof

Given: AC, the definitions in [F1], A=∥a∥∞, h=1/n, and s(t):=∣t∣−1/2 for 0<∣t∣≤1.

1.1givenF1F2F7F8F9algebra

By [F8], the square is compact, so [F7] makes A=∥a∥∞ finite. In the Banach normed space [F9], the hat functions in [F1] are nonnegative and on each panel the two adjacent hats add to 1, while all other hats vanish. Hence ∑j=0nϕn,j=1 pointwise. Positivity and linearity in [F2] give wn,j(x)≥0 and ∑j∣wn,j(x)∣=∑jwn,j(x)=Sx(1)=2x+21−x≤22. For every u∈X, the same bound shows ∥Knu∥∞≤22A∥u∥∞.

1.2F3

For d:=∣x−x′∣, [F3] gives an upper bound τ(d) for the improper kernel translation integral, with τ(d)→0 as d↓0.

2.1F1F2F4step 1.1

For fixed u, [F4] makes (x,y)↦gx(y) uniformly continuous. By step 1.1 the hats are nonnegative and sum to 1, so on a panel [yj,yj+1], Ingx(y) is a convex combination of the two endpoint values. Hence ∥Ingx−gx∥∞→0 uniformly in x, and the operator bound in [F2] yields ∥Knu−Ku∥∞≤22∥Ingx−gx∥∞→0.

2.2F1F2F3F4F5F8F9F10F11F12A1step 1.1step 1.2

Write gx(y)=a(x,y)u(y). The identities in [F1], the translation bound in [F3], and the operator bound in [F2] show ∣Ku(x)−Ku(x′)∣≤A∥u∥∞τ(d)+22∥u∥∞ωa(d), where τ(d) is the translation bound from step 1.2 and ωa(d):=sup⁡∣x−x′∣≤d,y∣a(x,y)−a(x′,y)∣→0 by [F4] on the compact square from [F8]. Replacing gx by Ingx gives the same bound for Knu: by step 1.1 the interpolant is a convex combination of nodal values, so ∥Ingx∥∞≤∥gx∥∞ and ∥In(gx−gx′)∥∞≤∥gx−gx′∥∞. Thus K and all Kn map into X and have a common equicontinuity modulus. The formula [F1] and linearity of Sx in [F2] make K linear; its operator bound follows from [F2]. Each Kn is linear by [F11], and step 1.1 bounds it. By [F9] and [F10], both are bounded linear maps. Their images of the unit ball are uniformly bounded and equicontinuous. By [F5] and [A1], K is compact by [F12], and (Kn) is collectively compact.

3.1F1step 2.2

For each fixed n,j, take a≡1 and u=ϕn,j in the preceding continuity argument; then Knu(x)=wn,j(x), so each weight function is continuous. Consequently the coefficient functions x↦wn,j(x)a(x,yj) in the finite-node representation are continuous.

4.1F2F6∎

Under the C2 extension hypothesis, [F6] bounds ∥Ingx−gx∥∞≤M2h2/8 uniformly in x. Applying [F2] gives ∥Knu−Ku∥∞≤22M2h2/8=2M2h2/4.

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

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.

5 · Examples, counterexamples and false statements

None yet.

Sources