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

Rank-one resolvent formula for the delta interface operator

Statement

Assume the Axiom of Choice and Countable Choice (The Axiom of Choice, The Axiom of Countable Choice (ACω)). Let α∈R and let Aα be the self-adjoint delta interface operator of The one-dimensional delta interface operator; write A0 for the operator with α=0, so that D(A0)=H2(R) and A0u=−D2u. For z∈C∖R let k with k2=−z, Re⁡k>0, let Gz(t)=(2k)−1e−k∣t∣, and define the bounded linear functional ℓz(f):=∫RGz(y)f(y) dy(f∈L2(R)). Then for every z∈C∖R:

(a) 1+αGz(0)=1+α/(2k)≠0, and (Aα−z)−1f=(A0−z)−1f−α ℓz(f)1+αGz(0) Gz(f∈L2(R));

(b) the difference Kz:=(Aα−z)−1−(A0−z)−1 is a bounded operator of rank at most one (rank one if α≠0, and zero if α=0), Kzf=−α1+αGz(0) ℓz(f) Gz, its range is contained in CGz, and ∥Kz∥≤∣α∣ ∥Gz∥L22∣1+αGz(0)∣=∣α∣4∣k∣2Re⁡k ∣1+α/(2k)∣ ; consequently ∥(Aα−z)−1∥≤∥(A0−z)−1∥+∥Kz∥.

Facts & Assumptions

Given: α∈R; the operators Aα, A0 of The one-dimensional delta interface operator; z∈C∖R; k2=−z, Re⁡k>0; the kernel Gz.

[F1]

Aα is self-adjoint, so ran⁡(Aα−z)=L2(R) and Aα−z is injective; (Aα−z)−1 is bounded (The one-dimensional delta interface operator). The free operator Afree=−D2 on H2(R) has resolvent (Afree−z)−1f=Gz∗f with range H2(R); Gz′(0+)−Gz′(0−)=−1 and Gz(0)=(2k)−1 (The free-line resolvent kernel and its inverse operator). Step 1.1 proves that Afree equals the member Aα=0 of the interface family, justifying the notation A0 in the Statement.

[F2]

Cauchy-Schwarz: ∣ℓz(f)∣≤∥Gz∥L2∥f∥L2, with ∥Gz∥L2=(2∣k∣Re⁡k)−1 (Cauchy–Schwarz: ∣⟨u,v⟩∣≤∥u∥∥v∥, with equality exactly for linearly dependent vectors, The free-line resolvent kernel and its inverse operator); a map f↦ℓ(f)w with ℓ bounded linear and fixed w≠0 is bounded of norm ∥ℓ∥ ∥w∥ (A bounded linear operator between normed spaces).

Proof

1.1F1givenalgebra

[Zero-coupling identification and nonvanishing denominator] Let A0int be the interface operator with parameter α=0. If u∈D(A0int), its piecewise second derivative q is in L2(R) and the two one-sided derivative traces agree. For every φ∈Cc∞(R), integration by parts on the two half-lines gives ∫Ru′φ′=(u′∗(0−)−u′∗(0+))φ(0)−∫Rqφ=−∫Rqφ; hence D2u=q globally and u∈H2(R). Conversely, if u∈H2(R), then u′∈H1(R) has a single continuous representative, so its one-sided traces at zero agree; the restrictions of u lie in H2 on each half-line and satisfy the zero-jump condition. Thus D(A0int)=H2(R) and both A0int and Afree act as −D2 there, proving the identification asserted in the Statement. Now, if 1+α/(2k)=0, then 2k=−α∈R; but k2=−z is nonreal because z is nonreal, so k itself is nonreal. Hence 1+αGz(0)=1+α/(2k)≠0.

2.1step 1.1F1givenalgebra

[Construction of the preimage] Fix f∈L2(R) and put r:=(A0−z)−1f, with A0=Afree by step 1.1. Exactly as in the range construction of The one-dimensional delta interface operator, the vector u:=r+cGz,c:=−α r(0)1+αGz(0), lies in D(Aα) and satisfies (Aα−z)u=f; here r(0)=∫RGz(y)f(y)dy=ℓz(f) because r(x)=∫Gz(x−y)f(y)dy evaluated at x=0.

3.1step 2.1F1

[The resolvent formula] Since Aα−z is injective by [F1], the vector u of step 2.1 is the unique preimage of f, hence (Aα−z)−1f=u=r+cGz=(A0−z)−1f−α ℓz(f)1+αGz(0)Gz, which is (a).

4.1step 3.1F2algebra∎

[Rank one and bounds] The map Kz displayed in (b) equals f↦ℓz(f)w with w:=−αGz/(1+αGz(0)); its range is contained in CGz. If α≠0, then w≠0, and f=Gz‾∈L2 satisfies ℓz(f)=∫R∣Gz(y)∣2dy=∥Gz∥L22>0. Hence the range contains a nonzero multiple of Gz, so Kz has rank exactly one; if α=0, then w=0 and Kz=0. By [F2], ∥ℓz∥≤∥Gz∥L2, and therefore [step 3.1, F2, algebra] ∥Kz∥≤∥ℓz∥ ∥w∥≤∥Gz∥L2∣α∣ ∥Gz∥L2∣1+αGz(0)∣=∣α∣ ∥Gz∥L22∣1+αGz(0)∣. Substituting ∥Gz∥L22=(4∣k∣2Re⁡k)−1 from [F2] gives the displayed value, and the triangle inequality for operator norms gives ∥(Aα−z)−1∥≤∥(A0−z)−1∥+∥Kz∥. This is (b).

Depends on

Dependency tree · 2 levels

Sources