Alphabeta Math
Physics theoremStatement: AI-adaptedProof: AI-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.

Static ULE formulas and principal-value kernel

PDF p. 10: Eqs. (S2.13)–(S2.14)

Statement

Assume the Axiom of Choice and Countable Choice. Work in units ℏ=1 with a nonzero finite-dimensional complex system Hilbert space HS and a complex bath Hilbert space HB. Let HS be a static Hermitian system Hamiltonian, HB a densely defined self-adjoint bath Hamiltonian, and Bα densely defined symmetric bath coupling operators. Take the total Hamiltonian HS+HB+γ∑α=1nXαBα, where n is finite, γ>0, the Xα are Hermitian system operators and ∥Xα∥≤1. Identity tensor factors are understood, and a self-adjoint realization of this total Hamiltonian on the system–bath Hilbert space is part of the model data.

Let ρB be a bounded trace-class bath operator, with ρB∗=ρB, ⟨ρBv,v⟩≥0 for every v∈HB, and Tr⁡BρB=1. Put UB(t)=e−itHB using self-adjoint functional calculus, and assume strong stationarity UB(t)ρBUB(t)∗=ρB for all real t; this is the meaning of the formal notation [HB,ρB]=0 here. Define B~α(t)=UB(t)∗BαUB(t) on its natural domain UB(t)∗D(Bα).

For every finite ordered product W=B~α1(t1)⋯B~αk(tk) used in a bath moment, require that the composition WρB on its natural domain is densely defined and closable and that its closure is a bounded trace-class operator on HB. Impose the same requirement on ρBBα for each α. All traces of these products mean the basis-independent trace of their trace-class closures. Assume a centered stationary Gaussian bath: Tr⁡B(ρBBα)=0, its two-point moments depend only on time differences, and its higher moments obey Wick pairings of the two-point functions. Use the factorized preparation ρSB(t0)=ρS(t0)⊗ρB with a system density operator ρS(t0), in the remote-past formulation t0→−∞, and the weak Markov regime ΓτB≪1 of the ULE contract.

Let Cαβ(t−s)=Tr⁡B(B~α(t)B~β(s)ρB) in this closure convention, and J(ω)=(2π)−1∫RC(t)eiωt dt entrywise. Require integrable entries of C, positive semidefinite Hermitian J(ω), integrable entries of g(ω)=[J(ω)/(2π)]1/2, and finite nonzero zeroth and finite first moments of ∥g(t)∥2,1, where g(t)=∫g(ω)e−iωt dω, ∥A∥2,1=∑b(∑a∣Aab∣2)1/2, Γ=4γ(∫∥g(t)∥2,1dt)2, and τB=∫∣t∣∥g(t)∥2,1dt/∫∥g(t)∥2,1dt. Assume the pointwise Fourier identities at the required Bohr frequencies and the principal values below exist.

Choose an orthonormal eigenbasis HS∣m⟩=Em∣m⟩ and write Xmn(α)=⟨m∣Xα∣n⟩. The static ULE jump and Lamb-shift coefficients are Lλ=2πγ∑m,n,αgλα(En−Em)Xmn(α)∣m⟩⟨n∣ and Λ=∑l,m,n,α,βfαβ(El−Em,En−El)Xml(α)Xln(β)∣m⟩⟨n∣, with f(E1,E2)=−2πγPV⁡∫−∞∞ω−1g(ω−E1)g(ω+E2) dω. The product in the integrand is matrix multiplication. Here PV⁡ is the symmetric Cauchy principal value at zero, with convergence at infinity also required.

Facts & Assumptions

[F1]

The independent ULE contract supplies these static coefficients under the stated system, bath, preparation, weak Markov, Fourier and principal-value hypotheses, including the corrected Lamb kernel. ULE jump construction under independent bath hypotheses

[F2]

The kernel contract defines the positive matrix square root, Fourier convention, mixed norm and symmetric principal value used in the statement. Stationary correlation spectra and ULE kernel regularity

[F3]

The bath space is a complex Hilbert space. Trace class and trace have their Hilbert-space meanings, and the trace is absolutely convergent and basis independent for trace-class operators under Countable Choice. Dense domains, closability and closures have their operator-graph meanings. The required product closures are hypotheses, not conclusions from Gaussianity. Hilbert space Trace class operator Trace of a trace class operator Trace is absolutely convergent and basis independent Densely defined, closed and closable operators, and cores

[F4]

Symmetry and self-adjointness include their domain requirements. Under the assumed Axiom of Choice a self-adjoint bath Hamiltonian defines the unitary group UB(t)=e−itHB. Strong stationarity and the coupling-product domain requirements are separately assumed. Symmetric, self-adjoint and essentially self-adjoint operators A self-adjoint operator generates a strongly continuous unitary group

[F5]

The system preparation uses a non-negative finite-dimensional endomorphism of trace one. Density operator

[F6]

A finite-dimensional endomorphism is Hermitian (self-adjoint) when T∗=T, and is normal when TT∗=T∗T. Every normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis. Self-adjoint and normal endomorphisms of a finite-dimensional real or complex inner product space Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely

[F7]

Under Countable Choice, the system–bath Hilbert space is the completed Hilbert tensor product HS⊗^HB, whose elementary tensors have inner product ⟨u⊗v,u′⊗v′⟩=⟨u,u′⟩⟨v,v′⟩. For bounded operators S,T, the operator S⊗T is the unique bounded extension of u⊗v↦Su⊗Tv to the completed tensor product. This gives the operator tensor product in the factorized preparation and the bounded identity tensor factors. The self-adjoint realization of the unbounded total Hamiltonian remains an explicit model assumption. Hilbert tensor construction: inner product, completion and product bases Bounded tensor maps: extension, norm estimate, adjoint and commutation

[A1]

Assume the Axiom of Choice and Countable Choice for the inherited supplier interfaces. The Axiom of Choice The Axiom of Countable Choice (AC_ω)

Proof

Given: The system, bath, preparation, regularity, Fourier and choice assumptions in the statement.

Goal: Identify the static ULE coefficients with the displayed expressions.

1.1givenA1F1F2F3F4F6F7

By [F7], the composite Hilbert space and the bounded operator tensor product in the factorized preparation have the stated mathematical meanings under Countable Choice. Since HS∗=HS, we have HSHS∗=HS2=HS∗HS; thus HS is normal, and [F6] supplies the orthonormal energy eigenbasis used in the statement. By [F3] and the assumed product closures, every bath trace used here is the trace of a bounded trace-class operator. By [F4], the self-adjoint HB defines the bath evolution; stationarity, Gaussianity and preparation remain explicit model assumptions. The resulting hypotheses match the static case of [F1]. Its kernel h is the positive square root of J/(2π) with the Fourier convention of [F2], hence it is the g specified here. Its transition matrix element (Xα)mn is Xmn(α).

2.1F1F2step 1.1∎

Substitute h=g and the matrix-element notation into the static jump and corrected Lamb-shift formulas of [F1]. Their energy arguments, factor −2πγ, matrix product and principal-value convention give exactly the coefficients in the statement. These are approximation coefficients under the stated hypotheses.

Source notes

The article’s Eq. (S2.13) gives the jump formula. Its Eq. (S2.14) instead states the first Lamb-kernel argument as Em−El and defines the kernel with prefactor 2π; this original formulation is preserved here for attribution. The displayed conditional deduction follows the independent ULE supplier’s erratum-corrected formula, not the article as proof.

Depends on

Used by · 3

Dependency tree · 2 levels

Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.

Sources