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.

Vacuum emission Dyson convergence

Statement

Assume the Axiom of Countable Choice and the Axiom of Choice (The Axiom of Countable Choice (ACω), The Axiom of Choice). Adopt the objects and hypotheses of Cutoff dipole relative bound: d≥1, Hermitian matrices Ha,D1,…,DJ on Cd, cutoff Λ>0, transverse vectors gj with supp⁡gj⊆{0<ε≤Λ} and gj/ε∈h, coupling η0∈R, H0:=Ha⊗I+I⊗Hf,B:=η0∑j=1JDj⊗ϕ(gj),H:=H0+B, all with domain Cd⊗D(Hf) so that H0 and H are self-adjoint on that domain. Fix ℏ>0, a unit vector va∈Cd and Ψ0:=va⊗Ω, and define the interaction-picture family V(t):=eitH0/ℏBe−itH0/ℏ(t∈R). For n≥0 and t≥0 let Ψn(t):=(1iℏ) ⁣n∫0<t1<⋯<tn<tV(tn)⋯V(t1)Ψ0 dt1⋯dtn (iterated Bochner integral in Cd⊗D(Hf); Ψ0(t):=Ψ0). Put C:=2∑j=1J∥Dj∥ ∥gj∥/ℏ and C′:=CΛ. Then:

(a) for all n≥0 and t≥0, ∥Ψn(t)∥≤(∣η0∣Ct)nn!;

(b) the vectors Ψn(t) lie in Cd⊗D(Hf), the series ∑n≥0Ψn(t) converges in the graph norm of Hf uniformly for t in compact subsets of [0,∞), and its sum Ψ(t) satisfies iℏ ∂tΨ(t)=V(t)Ψ(t),Ψ(0)=Ψ0;

(c) the Dyson sum solves the actual self-adjoint evolution: e−itH0/ℏΨ(t)=e−itH/ℏΨ0 for every t≥0;

(d) explicit tail bound: for 0≤t≤T and N≥1, ∥e−itH/ℏΨ0−e−itH0/ℏ∑n=0N−1Ψn(t)∥≤∑n≥N(∣η0∣CT)nn!.

The convergence is proved for the actual self-adjoint H on the stated domain; this is not a formal manipulation of divergent series, and no all-time weak-coupling, Markov or exponential-decay statement is made.

Facts & Assumptions

Given: the cutoff data, self-adjoint H0,H on G:=Cd⊗D(Hf), F:=I⊗Hf, B:=η0∑jDj⊗ϕ(gj), U0(t):=eitH0/ℏ, V(t):=U0(t)BU0(−t), and the vacuum initial vector. Put ∥x∥G:=∥x∥+∥Fx∥; let Km be the closed subspace with photon numbers at most m, including the atomic factor, and Gm:=G∩Km. Define the coupling-independent constant γ:=2∑j∥Dj∥ ∥gj∥, so C=γ/ℏ.

[F1]

The cutoff relative-bound theorem gives symmetry of B, its relative bound zero, and self-adjointness of H0,H on G (Cutoff dipole relative bound (a)-(c)). In particular B:G→K is bounded for the graph norm, where K=Cd⊗F(h); since H0−F is bounded, the two graph norms are equivalent.

[F2]

The sector formulas give ∥A±(g)x∥≤m+1∥g∥∥x∥ on Km, and each changes photon number by one; their sum has bound 2m+1∥g∥ (Closed adjoint sector domains (b),(c), Creation contraction bounds (a),(b)). Contraction is conjugate-linear in its vector argument and satisfies Ψg(u⊗z)=⟨u,g⟩z.

[F3]

The free field operator is the positive closed sector sum with multiplier ∑iε(ki), and HfΩ=0. Its sector projections commute with its unitary group (Transverse continuum free Fock Hamiltonian (a)-(c)). The Euclidean product identification, tensor density and permutation formulas are Euclidean L² product unitary: L²(R^a)⊗̂L²(R^b) ≅ L²(R^{a+b}), Hilbert tensor construction: inner product, completion and product bases and Permutation sector projections on the n-fold tensor power. AC supplies any DC prerequisite of the free-field supplier (AC implies DC implies countable choice).

[F4]

A finite Hermitian matrix has an orthonormal eigenbasis (Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely). A self-adjoint operator's unitary group is strongly continuous, preserves its domain and commutes with it, and is differentiable on domain vectors (A self-adjoint operator generates a strongly continuous unitary group).

[F5]

A continuous Banach-valued curve on a compact interval is Bochner integrable; its primitive has the curve as derivative, including one-sided endpoint derivatives, and the integral obeys the norm bound and linearity (Fundamental theorem of calculus for Banach-valued continuous curves, Bochner integrability criterion, Bochner integral norm inequality, Linearity of the Bochner integral). Bounded linear maps commute with such integrals: this holds for simple approximants by linearity and passes to their L1 limits by the map's norm bound.

Proof

technique · direct; prove finite-photon graph vertex bounds, integrate vertices in chronological order, sum in the graph norm and identify the resulting strong solution with the self-adjoint evolution

Given: The data of the statement and [F1]-[F5].

1.1F1F2F3F4algebra

[Free flow and vertex bounds] Diagonalizing the finite Hermitian Ha and using [F3], [F4] gives U0(t)=eitHa/ℏ⊗eitHf/ℏ. Thus U0(t) preserves each Km, commutes with F on G, and is isometric and strongly continuous for the graph norm: both U0(t)x and FU0(t)x=U0(t)Fx are continuous. On Km, the finite-sector extension of B from [F2] satisfies ∥Bx∥≤∣η0∣γm+1∥x∥ and takes values in Km+1. Its free conjugate therefore satisfies ∥V(t)x∥≤∣η0∣γm+1∥x∥. The factor ∣η0∣ is included exactly once in this bound; γ and C contain no coupling.

1.2F2F3algebraconstruct

[Cutoff commutator and graph-domain extension] For g supported in {0<ε≤Λ}, εg∈h and ∥εg∥≤Λ∥g∥. On symmetric elementary tensors with factors in D(ε), the sector multiplier and creation formula give [Hf,A+(g)]=A+(εg). For contraction the removed factor contributes −⟨εu,g⟩=−⟨u,εg⟩, so [Hf,A−(g)]=−A−(εg). These identities extend to every finite-photon graph vector, with no claim that all of F0 lies in D(Hf). Indeed, in sector n first cut each mode to ε≤R; dominated convergence in the Euclidean representation [F3] gives convergence of both the vector and its energy multiplier. On that cutoff subspace, energy is bounded by nR, so finite sums of elementary cutoff tensors, symmetrized, approximate in graph norm by tensor density. This supplies a graph core in each Gm. The field and its candidate commutator are bounded on Km by [F2], with respective bounds 2m+1∥g∥ and 2Λm+1∥g∥. Applying the core identity to a graph-approximating sequence makes the output and its energy image converge; closedness of Hf proves graph-domain preservation and the identity on the limit. Hence for x∈Gm, Bx∈Gm+1 and FBx=BFx+QBx,QB:=η0∑jDj⊗(A+(εgj)−A−(εgj)),∥QBx∥≤∣η0∣γΛm+1∥x∥.

2.1F1F2F4step 1.1step 1.2algebra

[Conjugated commutator and graph continuity] Since F commutes with U0(t), step 1.2 gives on Gm FV(t)x=V(t)Fx+Q(t)x,Q(t):=U0(t)QBU0(−t), with ∥Q(t)x∥≤∣η0∣γΛm+1∥x∥. The conjugations in Q(t) are retained. Equivalently, the sector formulas give Dj(t)=eitHa/ℏDje−itHa/ℏ and gj(t)=eitε/ℏgj, with V(t)=η0∑jDj(t)⊗ϕ(gj(t)),Q(t)=η0∑jDj(t)⊗(A+(εgj(t))−A−(εgj(t))). The same positive phase occurs in the annihilation vector argument because that argument is conjugate-linear, as in [F2]. The resulting graph bound is ∥V(t)x∥G≤∣η0∣γm+1(∥Fx∥+(1+Λ)∥x∥). Thus V(t):Gm→Gm+1 is uniformly bounded in t for these graph norms. Strong graph continuity of U0, the fixed graph-bounded B between these spaces, and the expression U0(t)BU0(−t)x show that t↦V(t)x is graph continuous. On the full G, [F1] and the graph isometry of U0 additionally give ∥V(t)x∥≤K∥x∥G for one finite K independent of t, and strong continuity as a map G→K. No global map V(t):G→G is asserted.

3.1F3step 1.1step 2.1algebrainduction

[Chronological products and their graph bounds] Define Pn(t1,…,tn):=V(tn)⋯V(t1)Ψ0, with P0=Ψ0. At the k-th vertex, the earlier product is in Gk−1, so steps 1.1 and 2.1 give a factor ∣η0∣γk in its Hilbert bound. Consequently Pn∈Gn and ∥Pn∥≤(∣η0∣γ)nn!. The graph commutator gives recursively ∥FPk∥≤∣η0∣γk(∥FPk−1∥+Λ∥Pk−1∥); since FΨ0=0, induction yields ∥FPn∥≤nΛ(∣η0∣γ)nn!. Each product is jointly continuous in its time variables for the graph norm: at each stage use strong graph continuity of the next V on a fixed vector and its uniform graph bound to control the changing previous vector. For n=0 the Hilbert bound is 1 and the energy bound is 0, including when ∣η0∣γ=0.

4.1F3F5step 3.1algebra

[Graph Bochner terms and the genuine recurrence] The graph space G is Banach: a graph-Cauchy sequence has limits of both the vectors and their F images in the Hilbert space, and closedness of F identifies them as a graph limit. Each Gn is closed in it. Step 3.1 and [F5] therefore make every iterated chronological integral a Bochner integral in Gn. Its graph and Hilbert norm bounds follow by integrating the preceding product bounds over the simplex; the volume is tn/n!, obtained recursively from ∫0tsn−1/(n−1)! ds=tn/n!. Each factor of the integral contributes 1/ℏ, giving ∥Ψn(t)∥≤(∣η0∣Ct)nn!,∥FΨn(t)∥≤nΛ(∣η0∣Ct)nn!. For n=0 these bounds mean 1 and 0. Integrating the latest vertex last gives the actual left-vertex recurrence Ψn+1(t)=1iℏ∫0tV(s)Ψn(s) ds. For fixed s, move V(s) through the inner integral as a bounded linear map Gn→Gn+1 by [F5]; the earlier vertices have times below s, with V(s) on the left. This also proves graph continuity of each term, and proves (a) and graph-domain membership in (b).

5.1step 4.1algebra

[Uniform graph convergence] Fix T<∞ and put a:=∣η0∣CT. The graph majorant is ∑n≥0(1+nΛ)an/n!. For a>0 the ratio of consecutive scalar terms tends to zero: it is a(1+(n+1)Λ)/((1+nΛ)n+1). It is eventually at most 1/2, proving convergence by a geometric tail comparison. If a=0, every positive-order term is zero and only the zeroth term remains. Thus the series converges uniformly for 0≤t≤T in the Banach graph space, and its sum Ψ(t) is graph continuous and belongs to D(H)=G.

6.1F5step 2.1step 4.1step 5.1algebra

[Integral equation and Hilbert derivative] The uniform bound ∥V(s)x∥≤K∥x∥G from step 2.1 makes V(s)∑n≤MΨn(s) converge uniformly in Hilbert norm on [0,T] to V(s)Ψ(s). This limiting curve is continuous by graph continuity of Ψ, strong continuity of V:G→K, and the same uniform bound. Sum the recurrences of step 4.1 and use the Bochner norm inequality [F5] to pass to the limit in their Hilbert integrals. The result is Ψ(t)=Ψ0+(iℏ)−1∫0tV(s)Ψ(s) ds. The Banach-valued fundamental theorem now gives Ψ∈C1([0,T];K), with the right derivative at zero, and iℏΨ′(t)=V(t)Ψ(t), Ψ(0)=Ψ0. Along with step 5.1 this proves (b); graph continuity is used for domain control, while the differential equation is a Hilbert-space derivative.

7.1F1F4step 5.1step 6.1algebra

[Identification with the self-adjoint dynamics] Put Y(t):=U0(−t)Ψ(t). It is graph continuous and belongs to D(H). The difference quotient splits into the difference of the free group on the fixed domain vector Ψ(t) and the free group times the difference quotient of Ψ, so [F4] and step 6.1 justify the product derivative in Hilbert norm. Thus iℏY′=H0Y+U0(−t)V(t)Ψ=H0Y+BY=HY and Y(0)=Ψ0. By [F1], [F4], the Stone curve e−itH/ℏΨ0 is another strong domain-valued solution because Ψ0∈G=D(H). For their difference w, symmetry of H gives ddt∥w(t)∥2=2Re⁡⟨w′(t),w(t)⟩=2Re⁡(−iℏ⟨Hw(t),w(t)⟩)=0. Both initial values agree, so w=0, proving (c) for every finite t≥0.

8.1F3F4step 4.1step 7.1algebra∎

[Tail, vacuum and zero branches] By step 7.1 and unitarity, the truncation error at time t equals in norm the interaction-picture tail, so it is at most ∑n≥N(∣η0∣Ct)n/n!; for 0≤t≤T this is at most the stated T tail, proving (d). The vacuum zeroth term has FΨ0=0 and norm one. At t=0 all positive-order integrals vanish. If η0=0, or if γ=0 (all contributing Dj or gj zero), then B=V=0, all positive-order terms vanish, the interaction-picture sum is exactly Ψ0, and the tail is zero for every N≥1. The argument supplies finite-time convergence and the actual self-adjoint evolution, with the original scope limitations retained.

Depends on

Dependency tree · 2 levels

Sources