Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-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.

Controlled Born amplitude error

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Adopt the hypotheses and notation of Stationary outgoing integral and flux: real V bounded with supp⁡V⊆BR, k>0, d∈S2, the compact operator Kk, and write q:=∥Kk∥. Then:

(a) Neumann control. If q<1 then u=(I+Kk)−1einc satisfies ∥u−einc∥L2(BR)≤q1−q ∥einc∥L2(BR).

(b) First Born amplitude. Under the same condition q<1, with fB(Ω):=−14π∫BReik(d−Ω)⋅yV(y) dy one has, uniformly in Ω∈S2, ∣fk(Ω)−fB(Ω)∣≤∥V∥∞∣BR∣1/24π q1−q ∥einc∥L2(BR).

(c) Scaling form. For Vη=ηV with ∣η∣q<1, put Kk,η=ηKk, uη=(I+ηKk)−1einc, and define the corresponding amplitudes by the same integrals. Then ∥uη−einc∥2≤∣η∣q1−∣η∣q∥einc∥2, sup⁡Ω,d∈S2∣fk,η(Ω;d)−ηfB(Ω;d)∣≤∣η∣2∥V∥∞∣BR∣q4π(1−∣η∣q). This applies to every real η in the original real stationary model. For complex η the same Neumann construction and amplitude integrals give the same algebraic estimate, without asserting the real-potential flux conclusions. No base condition q<1 is needed in (c). These give controlled weak-coupling Born estimates in the actual operator norm, uniformly in both incident and outgoing directions.

Facts & Assumptions

Given: the generic bounded compact real V, R,k>0, d,Ω∈S2, and ed(y)=eikd⋅y with ∥ed∥2=∣BR∣1/2.

Proof

1.1givenF1constructalgebra

The kernel hk(x,y)=1BR(x)1BR(y)eik∣x−y∣V(y)/(4π∣x−y∣) lies in L2(R6): polar integration of ∣x−y∣−2 over ∣x−y∣<2R gives ∥hk∥22≤∥V∥∞2∣BR∣R/(2π). The actual local kernel lemma supplies finite-product approximants with operator-norm error bounded by their kernel-L2 error; zero extension and restriction give a bounded compact Kk on L2(BR) and finite q=∥Kk∥. This is a concrete Euclidean CC construction, with no arbitrary Hilbert–Schmidt basis.

2.1step 1.1F1constructalgebra

Suppose q<1. Define SNf=∑n=0N(−Kk)nf. For M>N, ∥(SM−SN)f∥2≤qN+1∥f∥2/(1−q). Completeness defines the unique linear limit Sf, with ∥S∥≤(1−q)−1 and ∥S−SN∥≤qN+1/(1−q). The finite geometric identity (I+Kk)SN=SN(I+Kk)=I−(−Kk)N+1 passes to the limit, so S is the two-sided inverse. Consequently u−ed=∑n≥1(−Kk)ned and ∥u−ed∥2≤q∥ed∥2/(1−q), proving (a).

3.1step 2.1F1givenalgebra

The amplitude difference is LΩ(u−ed) for LΩ(v)=−(4π)−1∫BRe−ikΩ⋅yV(y)v(y)dy. Cauchy–Schwarz gives ∣LΩ(v)∣≤∥V∥∞∣BR∣1/2∥v∥2/(4π) uniformly in Ω. The absolute integrability follows from the same estimate. Inserting step 2.1 proves (b). Since Kk is independent of d and ∥ed∥2=∣BR∣1/2, this is also uniform in d. No radial specialization occurs.

4.1step 2.1step 3.1algebra∎

Linearity of the kernel gives Kk,η=ηKk and qη=∣η∣q. Repeat step 2.1 with this operator whenever ∣η∣q<1, regardless of the base q. The amplitude functional is Lη,Ω=ηLΩ and fB,η=ηfB. Thus fk,η−ηfB=ηLΩ(uη−ed); step 3.1 gives precisely both factors of ∣η∣ in (c). The cases q=0 or η=0 follow from the same identities with zero error, without division by either. This proves the full claimed scaling and weak-coupling control.

Depends on

Dependency tree · 2 levels

Sources