Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck pass
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 convergence and far-field error for cell-volume product integration

Statement

Assume AC and the data of The three-dimensional volume integral scattering model with 0<∣D∣<∞. Let f∈L2(D;C), let PN,KN=PNKk,fN=PNf and the exact cell-pair matrices be as in Cell-volume product integration for the scattering kernel, and suppose I−Kk is injective. Then there is N0 such that for all N≥N0 the matrix I−A(N) is nonsingular and its reconstruction uN∈VN is the unique solution of (I−KN)uN=fN. If u∈L2(D;C) solves (I−Kk)u=f, then for a constant C<∞ independent of N and f, ∥uN−u∥2≤C(∥(PN−I)Kku∥2+∥(PN−I)f∥2). Writing CF:=∥q∥∞∣D∣/(4π), the exact far-field outputs obey ∥Fk[uN]−Fk[u]∥C(S2)≤CFC(∥(PN−I)Kku∥2+∥(PN−I)f∥2)⟶0. This gives eventual solvability and convergence for the stated cell-volume product rule; it does not assert operator-norm convergence KN→Kk or finite-precision error bounds.

Facts & Assumptions

Given: AC, D,q,k as in the Statement, f∈L2(D;C), the dyadic projections and exact product-cell rule, injectivity of I−Kk, and any u∈L2(D;C) solving (I−Kk)u=f.

[F1]

Dyadic cell-average projections converge strongly in L2 of a bounded set: PN is an orthogonal projection, ∥PN∥≤1, and PNv→v for each v∈L2(D).

[F2]

The volume integral scattering operator is compact: Kk is compact and bounded on L2(D) under AC.

[F3]

Collective compactness gives eventual Fredholm invertibility and solution error bounds: on a nonzero Banach space, for compact K, bounded KN with compact closure of ⋃NKN(BX), pointwise norm convergence KNx→Kx, and injective I−K, all sufficiently late I−KN are invertible with a uniform inverse bound, and the solution error is C(∥(KN−K)u∥+∥fN−f∥).

[F4]

Cell-volume product integration for the scattering kernel: KN=PNKk, fN=PNf, and I−KN on VN has the displayed matrix I−A(N) in the normalized cell-indicator basis.

[F5]

The volume far-field map is bounded and is the uniform far-field limit: ∥Fkv∥∞≤CF∥v∥2.

[F6]

AC supplies Countable Choice and Dependent Choice (The Axiom of Choice, AC supplies the countable and dependent choices used in Banach integration); complex L2(D) is complete under Countable Choice (Complex Lp completeness and almost-everywhere subsequences), and under Countable Choice and Dependent Choice a metric space is compact exactly when it is complete and totally bounded (For a metric space, compact, countably compact, limit point compact, sequentially compact, and complete together with totally bounded are all equivalent, given countable choice and dependent choice).

Proof

Given: The data in the Statement.

1.1F2F3F6given

Let X=L2(D;C). Since ∣D∣>0, X≠{0} (a normalized indicator of any positive-measure cell or subset is nonzero). By [F6] and AC, X is a Banach space. [F2] gives compactness of Kk, and the assumed injectivity makes the Fredholm premise of [F3] applicable once the approximation hypotheses are checked.

1.2F1F2F4

By [F1] and [F4], KN=PNKk is bounded linear and ∥KN∥≤∥Kk∥. For every v∈X, [F1] applied to Kkv gives KNv=PNKkv→Kkv in norm.

2.1F1F2F3F6step 1.1algebra

Let BX be the closed unit ball and C=Kk(BX)‾. Compactness in [F2] makes C compact. Strong convergence PNz→z from [F1] is uniform for z∈C: given ϵ>0, cover C by finitely many ϵ/3 balls with centers z1,…,zs, choose N0 so that ∥PNzj−zj∥<ϵ/3 for every center and N≥N0, then use ∥PN∥≤1 to get sup⁡z∈C∥PNz−z∥<ϵ. To show the tail union is totally bounded, start with any radius δ>0, apply this uniform estimate with ϵ=δ/3, and cover C by finitely many δ/3 balls; each PNz with N≥N0 then lies within 2δ/3 of one of their centers. Thus ⋃N≥N0PN(C) is totally bounded. Each of the finitely many earlier sets PN(C) is compact as a continuous image of C, hence totally bounded. Their union U:=⋃N≥1PN(C) is totally bounded. Its closure is totally bounded too: for any δ>0, take a finite δ/2-net of U; every point of U‾ is within δ/2 of some point of U, which is within δ/2 of a net center. The closure is complete: every Cauchy sequence in U‾ converges in the Banach space X from step 1.1, and closedness of U‾ keeps that limit in U‾. By [F6], U‾ is compact. Since KN(BX)=PNKk(BX)⊂PN(C), the family (KN) is collectively compact in the precise sense required by [F3].

3.1F1F3step 1.1step 1.2step 2.1

Now all hypotheses of [F3] hold by steps 1.1, 1.2, and 2.1. Therefore there are N0 and a uniform C such that I−KN is invertible for N≥N0 and its solutions satisfy ∥uN−u∥2≤C(∥(KN−Kk)u∥2+∥fN−f∥2)=C(∥(PN−I)Kku∥2+∥(PN−I)f∥2). The right side tends to zero by [F1].

4.1F4F5step 3.1algebra∎

For N≥N0, the full-space solution satisfies uN=fN+PNKkuN∈VN. In the normalized cell-indicator basis of [F4], its equation is exactly (I−A(N))c=b(N). If that finite matrix had a nonzero null vector, its corresponding nonzero element of VN would be in the kernel of I−KN, contradicting invertibility; thus the matrix is nonsingular and its reconstruction is the unique operator solution. Finally [F5] gives the stated far-field bound, and step 3.1 makes its right side tend to zero.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

92 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