Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)
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.

Scattering isometries do not establish asymptotic completeness

Statement

Let Has=Dσ‾ and let Ω±:=W±1:Has→H be the two isometric extensions supplied by the preceding Cook theorem after its pairwise Fock-inner-product hypothesis is proved. Define the comparison operator S=Ω+∗Ω−. Here the Hilbert adjoint T∗ of a bounded map T:H1→H2 is characterized by (Tx,y)H2=(x,T∗y)H1, a contraction satisfies ∥Sx∥≤∥x∥ for all x, an isometry is a linear inner-product-preserving map, and unitary means a surjective isometry. Then S is a contraction. It is unitary if and only if Ran⁡Ω+=Ran⁡Ω−. Full asymptotic completeness is the stronger condition Ran⁡Ω+=Ran⁡Ω−=H; this stronger condition is not part of the unitary-on-common-range criterion.

Facts & Assumptions

Given: The completed packet space Has=Dσ‾, the physical Hilbert space H, the isometric Cook maps Ω±=W±1:Has→H.

[F1]

Integrable derivatives yield scattering vectors: after the packet inner products are shown to converge to the Fock inner product, the norm limits extend to isometries on the completed packet domain. Cook convergence alone supplies no surjectivity statement.

[F2]

Cauchy–Schwarz: ∣⟨u,v⟩∣≤∥u∥∥v∥, with equality exactly for linearly dependent vectors: ∣(x,y)∣≤∥x∥ ∥y∥ in every complex Hilbert space.

[F3]

Hilbert-adjoint identities: under Countable Choice, every bounded linear map between real or complex Hilbert spaces has a unique bounded Hilbert adjoint satisfying the adjoint identity; adjoints of compositions obey (TS)∗=S∗T∗. Its prerequisite chain supplies the Hilbert-adjoint definition (def-hilbert-space-adjoint) and the Riesz representation result (thm-riesz-representation-for-hilbert-space). The Countable Choice hypothesis is already supplied by the scattering contract in [F1]. Since Ω± are linear isometries, they are bounded, so their bounded adjoints exist; after step 1.1, the same result applies to the bounded comparison operator S.

Proof

1.1F1F2F3givenalgebra

By [F3], the bounded linear isometry Ω+ has a bounded Hilbert adjoint. For any z in a Hilbert space, ∥z∥=sup⁡∥x∥≤1∣(z,x)∣: Cauchy–Schwarz gives the upper bound, and if z≠0 the choice x=z/∥z∥ attains it. For y∈H, the adjoint identity and [F2] therefore give ∥Ω+∗y∥=sup⁡∥x∥≤1∣(Ω+∗y,x)∣=sup⁡∥x∥≤1∣(y,Ω+x)∣≤∥y∥, since ∥Ω+x∥=∥x∥. Therefore ∥Sx∥=∥Ω+∗Ω−x∥≤∥Ω−x∥=∥x∥ for every x∈Has, so S is a contraction.

1.2F1F3givenalgebra

By [F3], the bounded maps Ω± and S have bounded Hilbert adjoints with the stated adjoint identities. For either isometry Ω, the adjoint identity gives (x,Ω∗Ωy)=(Ωx,Ωy)=(x,y) for all x,y; nondegeneracy therefore gives Ω∗Ω=I. For P=ΩΩ∗ the same identity gives (Px,y)=(Ω∗x,Ω∗y)=(x,Py), so P∗=P, and Ω∗Ω=I gives P2=P. Also P fixes each Ωx and its image is contained in Ran⁡Ω, so P is the orthogonal projection onto the closed range. If Ran⁡Ω+=Ran⁡Ω−=:R, both products are the same projection PR. For all x,z∈Has, (Sx,z)as=(Ω−x,Ω+z)H=(x,Ω−∗Ω+z)as, so uniqueness of the adjoint gives S∗=Ω−∗Ω+. It follows that S∗S=Ω−∗PRΩ−=Ω−∗Ω−=I and SS∗=Ω+∗PRΩ+=Ω+∗Ω+=I, so S is unitary.

2.1F1F3givenstep 1.2algebra∎

Conversely, suppose S is unitary and put P+=Ω+Ω+∗. By [F3] and step 1.2 this is a bounded orthogonal projection. For each x, ∥P+Ω−x∥=∥Ω+∗Ω−x∥=∥Sx∥=∥x∥=∥Ω−x∥. For an orthogonal projection P, the identity ∥Py∥=∥y∥ implies ∥y∥2=∥Py∥2+∥(I−P)y∥2 and hence (I−P)y=0; therefore Ω−x∈Ran⁡Ω+ for every x, proving Ran⁡Ω−⊆Ran⁡Ω+. Since S is onto, for every z∈Has choose x with Sx=z. Then Ω+z=Ω+Sx=P+Ω−x=Ω−x, which gives the reverse range inclusion. Thus the ranges coincide.

Depends on

Dependency tree · 2 levels

Sources