Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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.

Finite-time Kubo formula with norm remainder

Statement

Let H be a complex Hilbert space of finite dimension d≥1, H=H∗ with energy unit J, ℏ>0 with unit J s, β>0 with unit J−1, and let σ=Zβ−1e−βH be the stationary Gibbs density from Finite unitary dynamics and stationary Gibbs states. Let A=A∗ and B=B∗ be matrices, let T>0 be finite in s, let h:[0,T]→R be continuous, and let ϵ∈R be dimensionless; h(t)B has unit J. Put U0(t)=e−itH/ℏ for time t in s, αt(A)=U0(t)∗AU0(t), and Bt=αt(B). Let Wϵ solve Wϵ′(t)=iϵh(t)ℏBtWϵ(t),Wϵ(0)=I, and set Uϵ(t)=U0(t)Wϵ(t) and ρI(t)=Wϵ(t)σWϵ(t)∗. Then Uϵ solves iℏUϵ′(t)=(H−ϵh(t)B)Uϵ(t), Uϵ(0)=I, and ρϵ(t):=Uϵ(t)σUϵ(t)∗ satisfies Tr⁡(ρϵ(t)A)=Tr⁡(ρI(t)αt(A)). Define RAB(u)=iℏTr⁡ ⁣(σ[αu(A),B]),CT=2ℏ∫0T∣h(s)∣ ∥B∥ ds. Then Wϵ(t) is unitary and, for 0≤t≤T, Tr⁡(ρI(t)αt(A))=Tr⁡(σαt(A))+ϵ∫0th(s)RAB(t−s) ds+rϵ(t),∣rϵ(t)∣≤∥A∥(∣ϵ∣CT)2e∣ϵ∣CT2. The initial Gibbs matrix is fixed as ϵ varies. The result is an exact finite-time first variation with a controlled remainder, not a static derivative of a re-prepared Gibbs family. CT and ϵ are dimensionless, and RAB has units [A][B]/(J s).

Facts & Assumptions

Given: The finite-dimensional Hamiltonian and Gibbs density, bounded self-adjoint matrices A,B, continuous real h, ϵ∈R, and T>0.

[F1]

Finite unitary dynamics and stationary Gibbs states: U0 is a unitary group, σ is a positive trace-one matrix commuting with U0(t), and finite trace expectation is cyclically represented in the Heisenberg picture.

[F2]

Finite matrix spectral and state calculus: finite Hermitian matrices have basis-independent spectral functional calculus and the finite trace is cyclic.

[F3]

Finite matrix trace-norm ideal inequalities: ∥YX∥1,∥XY∥1≤∥Y∥∥X∥1, ∣Tr⁡X∣≤∥X∥1, and the finite trace-norm matrix space is complete.

[F4]

Banach-space Volterra and Dyson series with a norm remainder: a strongly continuous bounded coefficient on a Banach space yields a unique Volterra solution and the explicit quadratic remainder; a strongly continuous skew-adjoint Hilbert-space coefficient yields a unitary solution.

Proof

technique · interaction-picture Volterra series and finite trace cyclicity

Given: [F1]–[F4] and the control/observable hypotheses in the Statement.

1.1givenF1F3algebra

The matrix curve t↦Bt is norm-continuous by the finite matrix exponential in [F1]. On the Hilbert space, Kt(ψ)=ih(t)Btψ/ℏ is a strongly continuous skew-adjoint bounded coefficient. On the trace-norm matrix space, Lt(X)=ih(t)[Bt,X]/ℏ is strongly continuous and satisfies ∥Lt(X)∥1≤2∣h(t)∣∥B∥∥X∥1/ℏ by [F3].

2.1givenF1F3F4step 1.1algebra

Apply [F4] to Kt with initial vector ψ to obtain a unitary Wϵ(t), and apply [F4] to Lt with initial matrix σ. The trace-norm solution has linear term ϵ(i/ℏ)∫0th(s)[Bs,σ]ds and remainder norm at most (∣ϵ∣CT)2e∣ϵ∣CT/2, since ∥σ∥1=1. Differentiating the finite matrix product Wϵ(t)σWϵ(t)∗ shows it solves the same commutator equation; uniqueness in [F4] identifies it with that trace-norm solution.

3.1givenF1F2step 2.1algebra

The product rule and U0(t)Bt=BU0(t) give iℏ(U0Wϵ)′=HU0Wϵ−ϵh(t)BU0Wϵ, so Uϵ solves the displayed controlled Schrödinger equation. Since Uϵ=U0Wϵ, cyclicity of the finite trace gives Tr⁡(UϵσUϵ∗A)=Tr⁡(WϵσWϵ∗αt(A)).

3.2givenF1F2step 2.1algebra

Applying Tr⁡(⋅ αt(A)) to the linear term, cyclicity [F2] gives Tr⁡([Bs,σ]αt(A))=Tr⁡(σ[αt(A),Bs]). Since Bs=αs(B) and αt(A)=αs(αt−s(A)), stationarity of σ from [F1] turns this into Tr⁡(σ[αt−s(A),B]). This is exactly the convolution in the Statement.

4.1F1F2F3step 2.1step 3.2algebra∎

The trace-norm remainder from step 2.1 changes the expectation by at most ∥A∥ times its trace norm, by [F3] and ∥αt(A)∥=∥A∥. This gives the displayed bound. For self-adjoint A,B, Tr⁡(σ[αu(A),B]) is purely imaginary by cyclicity and adjoints, so RAB(u) is real.

Depends on

Dependency tree · 2 levels

Sources