Alphabeta Math
LemmaStatement: 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.

Dyson truncation bound

Statement

Assume Countable Choice (The Axiom of Countable Choice (ACω)) and adopt the hypotheses and corrected latest-time-left notation of Norm Dyson series and uniqueness: H is an arbitrary complex Hilbert space, I=[a,b] a nonempty compact interval, ℏ>0, and H:I→B(H) is norm-continuous with bounded self-adjoint values. Write A(r)=−iH(r)/ℏ, K=sup⁡r∈I∥A(r)∥, U0=IH, and Un+1(t,s)=∫stA(r)Un(r,s)dr with oriented integrals. The norm-convergent sum U=∑n≥0Un is the unitary propagator of that supplier. For N∈N0, put RN(t,s)=U(t,s)−∑n=0NUn(t,s). Then for all s,t∈I:

(a) Exact oriented remainder. RN(t,s)=∫stdr1∫sr1dr2⋯∫srNdrN+1 A(r1)⋯A(rN+1)U(rN+1,s). For N=0 this means the single integral ∫stA(r1)U(r1,s)dr1. For s≤t, relabeling tj=rN+2−j gives the corrected ordered-simplex identity RN(t,s)=(−iℏ)N+1∫s<t1<⋯<tN+1<tH(tN+1)⋯H(t1)U(t1,s) dt1⋯dtN+1, where tN+1 is outermost, t1 innermost, and the residual propagator is evaluated at the earliest integration time on the right. The universal nested formula specifies signs and operator order for t<s as well.

(b) Truncation bound. With τ=∣t−s∣, ∥RN(t,s)∥≤eKτ(Kτ)N+1(N+1)!. In fact unitarity under the actual stated self-adjoint hypotheses also gives the stronger bound ∥RN(t,s)∥≤(Kτ)N+1/(N+1)!. The original exponential estimate is retained for every s≤t.

In particular ∥U(t,s)−IH−U1(t,s)∥≤eKτ(Kτ)2/2. If the family is scaled to λH(t) with a real coupling λ, the same conclusion holds with K replaced by ∣λ∣K, so the first-order error is O(∣λ∣2τ2) uniformly when ∣λ∣Kτ remains bounded, with explicit multiplier e∣λ∣Kτ/2. The stronger bound has multiplier 1/2. Both time orientations, negative absolute times, t=s, K=0, the zero Hilbert space and a singleton I are included.

Facts & Assumptions

Given: CC, the arbitrary Hilbert space and bounded norm-continuous self-adjoint family of the Statement, A=−iH/ℏ, its finite bound K, N∈N0, and s,t∈I.

[F1]

The actual corrected supplier Norm Dyson series and uniqueness supplies Un(t,s) for every s,t∈I, its oriented recursion, ∥Un(t,s)∥≤(K∣t−s∣)n/n!, uniformly norm-convergent U, joint norm continuity, and U(t,s)=IH+∫stA(r)U(r,s)dr. It proves unitarity for this self-adjoint family on arbitrary H under CC, without a Stone or spectral theorem premise. In particular ∥U(r,s)∥≤1 (equality when H≠{0}) and also ∥U(r,s)∥≤eK∣r−s∣.

[F2]

The Bochner integrability criterion and norm inequality are Bochner integrability criterion, Bochner integral norm inequality, and integral linearity is Linearity of the Bochner integral. Continuous operator-valued curves on compact intervals have explicit uniform grid-step approximants and are integrable even if H is nonseparable. Bounded left/right multiplication commutes with their integral by the simple-approximation definition.

[F3]

∥BC∥≤∥B∥∥C∥, the operator triangle inequality, and ∥A(r)∥≤K are A bounded linear operator between normed spaces, The operator norm as the least bound and as the unit-sphere or unit-ball supremum.

Proof

1.1F1F2F3givenalgebra

[The first remainder and recursive reduction] The supplier's Volterra identity gives R0(t,s)=U(t,s)−IH=∫stA(r)U(r,s)dr. For N≥1, subtract the finite sum of recursions ∑n=1NUn(t,s)=∫stA(r)∑n=0N−1Un(r,s)dr from that identity. Integral linearity yields RN(t,s)=∫stA(r)RN−1(r,s)dr, for both t≥s and t<s. This does not interchange an infinite sum with an integral. Each integrand is norm-continuous by [F1] and [F3], so the integrals exist by [F2].

2.1step 1.1F2F3givenconstructalgebra

[Exact nesting and the residual endpoint] Apply the recursive identity in step 1.1 successively N times and then insert its formula for R0. Bounded left multiplication passes through each integral by [F2], giving the universal nested expression in (a). At its last variable rN+1, the remaining factor is exactly U(rN+1,s), because the inserted equation is R0(rN,s)=∫srNA(rN+1)U(rN+1,s)drN+1. For s≤t, s≤rN+1≤⋯≤r1≤t, so renaming tj=rN+2−j puts the product in latest-time-left order and the residual factor at t1. The asserted simplex means precisely these nested integrals, so no unproved Banach-valued product-measure Fubini theorem is needed. This proves the whole identity (a), including N=0.

3.1step 2.1F1F2F3givenconstructalgebra

[Sign and factorial volume for either time direction] Put m=N+1 and D=t−s. In step 2.1 substitute rj=s+Dξj successively. The remainder becomes Dm∫01dξ1∫0ξ1dξ2⋯∫0ξm−1dξm A(s+Dξ1)⋯A(s+Dξm)U(s+Dξm,s). This is valid for D<0: every integral is oriented and contributes its signed D, so the overall sign is Dm. For D>0 the outermost r1 is the latest physical time and the innermost rm is earliest; for D<0 these physical inequalities reverse, while the recursive operator order stays unchanged. Norm estimates take ∣D∣m. The repeated integral of the constant 1 over 0≤ξm≤⋯≤ξ1≤1 is 1/m!, by integrating one power at each step. At D=0 every nested integral and every RN vanish.

4.1step 3.1F1F2F3givenalgebra

[Both explicit remainder estimates] For every variable in step 3.1, rm lies between s and t, so ∣rm−s∣≤τ. Using [F1], [F2], [F3] and the volume calculation there gives ∥RN(t,s)∥≤τmKmeKτ/m!. This is (b)'s retained exponential estimate. Using instead the actual supplier's unitarity bound ∥U(rm,s)∥≤1 gives ∥RN(t,s)∥≤(Kτ)m/m!. Self-adjointness and unitarity are not new assumptions: they are exactly the family and conclusion in [F1]. The first estimate can also be derived from its factorial series bounds alone, so no sharper norm hypothesis is needed to retain the original bound.

5.1step 1.1step 2.1step 3.1step 4.1F1F2F3givenalgebra∎

[Scaling and boundary cases] Choose N=1 in step 4.1 for the first-order error estimate. A real multiple λH has the same self-adjoint/norm-continuous class, and its norm bound is Kλ=∣λ∣K. Substituting that bound gives the displayed scaling estimates; when ∣λ∣Kτ≤M, the original estimate is at most eM∣λ∣2K2τ2/2, proving the qualified quadratic assertion with its explicit constant. The t=s case was proved in step 3.1; if K=0 the coefficient vanishes identically and all positive-order terms and remainders vanish; if H={0} all operators are zero; and if a=b the sole time pair is diagonal. No construction distinguished positive from negative absolute time. The proof uses only the actual CC bounded Dyson supplier, finite nesting and the Bochner interfaces, with no choice of a Hilbert basis or new AC/spectral/Stone assumption. This completes all the stated claims.

Depends on

Dependency tree · 2 levels

Sources