Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Whole-cycle quantum time reversal

Open
QAlgorithms.Papers.Independent.Intakethird100.P15.wholeCycle_timeReversal

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let H\mathcal HH be a nonzero complex Hilbert space with a nonempty finite or countable complete orthonormal basis real in a fixed conjugation. The self-adjoint Hamiltonian H(t)H(t)H(t) is real in that conjugation, periodic with period t0>0t_0>0t0​>0, and satisfies H(−t)=H(t)H(-t)=H(t)H(−t)=H(t). Start at this symmetry origin and observe an integer number of full cycles. Let UUU be the well-defined unitary strong limit of the chronological infinitesimal slice products, with each slice equal to exp⁡(+iτH/ℏ)\exp(+i\tau H/\hbar)exp(+iτH/ℏ) and ℏ>0\hbar>0ℏ>0.

For every finite slicing at the symmetry origin, and for its unitary strong limit, the adjoint equals entrywise conjugation in the fixed real basis:

U†=U‾.U^\dagger=\overline U.U†=U.

Explicitly, ⟨i∣U†∣j⟩=⟨i∣U∣j⟩‾\langle i|U^\dagger|j\rangle=\overline{\langle i|U|j\rangle}⟨i∣U†∣j⟩=⟨i∣U∣j⟩​ for all basis labels i,ji,ji,j; equivalently Uij=UjiU_{ij}=U_{ji}Uij​=Uji​. The same coefficient identity holds for each finite chronological slice product.

This is the reversal identity underlying the fluctuation relations, derived from the real Hamiltonians and palindromic slicing.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P15
Formal statement
namespace QAlgorithms.Papers.Independent.Intakethird100.P15

open MeasureTheory Filter

open QAlgorithms.Papers.Independent.Information100.P37 (transition)

open QAlgorithms.Papers.Independent.Support21.P03 (reflectedLaw)

open QAlgorithms.Papers.Independent.Next46.P01 (extendedExpectation)

open scoped ENNReal Topology

universe u v w

variable {E : Type u} [NormedAddCommGroup E] [InnerProductSpace ℂ E] [CompleteSpace E]

variable {ι : Type v} {Ω : Type w} [MeasurableSpace Ω]

/-- Kurchan, PDF p.2, (3). Finite slice products and their well-defined unitary
strong limit have adjoint equal to entrywise conjugation in the fixed real basis.
The inverse of a unitary is its adjoint; scalar `star` is complex conjugation.
This derives reversal rather than including reversal in `CyclicDrive`. -/
theorem wholeCycle_timeReversal [Countable ι] [Nonempty ι]
    (b : HilbertBasis ι ℂ E) (d : CyclicDrive (Ω := Ω) b) :
    (∀ n i j,
      inner ℂ (b i) ((chronologicalEvolution (List.ofFn (d.slices n))).symm (b j)) =
        star (inner ℂ (b i) (chronologicalEvolution (List.ofFn (d.slices n)) (b j)))) ∧
    (∀ i j, inner ℂ (b i) (d.evolution.symm (b j)) =
      star (inner ℂ (b i) (d.evolution (b j)))) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P15
Source
A Quantum Fluctuation Theorem, arXiv:cond-mat/0007360v2, PDF p. 2, Whole-cycle time reversal, (3)
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

Let EEE be a complex Hilbert space, Ω\OmegaΩ a measurable space, and (bi)i∈ι(b_i)_{i\in\iota}(bi​)i∈ι​ a Hilbert basis with ι\iotaι countable and nonempty. The given cyclic drive consists of a period T>0T>0T>0, a number ℏ>0\hbar>0ℏ>0, a cycle count C∈NC\in\mathbb NC∈N, and, for every real ttt, spectral data (μt,ht,Ft)(\mu_t,h_t,F_t)(μt​,ht​,Ft​), where μt\mu_tμt​ is a measure on Ω\OmegaΩ, ht:Ω→Rh_t:\Omega\to\mathbb Rht​:Ω→R is measurable, and Ft:E→L2(μt;C)F_t:E\to L^2(\mu_t;\mathbb C)Ft​:E→L2(μt​;C) is a complex linear isometric bijection such that each FtbiF_t b_iFt​bi​ is real almost everywhere. These entire spectral data satisfy Ht+T=HtH_{t+T}=H_tHt+T​=Ht​ and H−t=HtH_{-t}=H_tH−t​=Ht​. For every n∈Nn\in\mathbb Nn∈N there are surjective complex linear isometries Vn,rV_{n,r}Vn,r​, 0≤r≤n0\le r\le n0≤r≤n; writing Δn=CT/(n+1)\Delta_n=CT/(n+1)Δn​=CT/(n+1) and tn,r=(r+12)Δnt_{n,r}=(r+\tfrac12)\Delta_ntn,r​=(r+21​)Δn​, they satisfy, for all x,y∈Ex,y\in Ex,y∈E,

⟨x,Vn,ry⟩=∫ΩFtn,rx(s)‾e i(Δn/ℏ)htn,r(s)Ftn,ry(s) dμtn,r(s).\langle x,V_{n,r}y\rangle = \int_\Omega \overline{F_{t_{n,r}}x(s)} e^{\,i(\Delta_n/\hbar)h_{t_{n,r}}(s)} F_{t_{n,r}}y(s)\,d\mu_{t_{n,r}}(s).⟨x,Vn,r​y⟩=∫Ω​Ftn,r​​x(s)​ei(Δn​/ℏ)htn,r​​(s)Ftn,r​​y(s)dμtn,r​​(s).

The drive also supplies a surjective complex linear isometry UUU such that Unx→UxU_nx\to UxUn​x→Ux for every x∈Ex\in Ex∈E, where Un=Vn,n∘⋯∘Vn,0U_n=V_{n,n}\circ\cdots\circ V_{n,0}Un​=Vn,n​∘⋯∘Vn,0​. The theorem asserts

∀n∈N, ∀i,j∈ι,⟨bi,Un−1bj⟩=⟨bi,Unbj⟩‾,∀i,j∈ι,⟨bi,U−1bj⟩=⟨bi,Ubj⟩‾.\forall n\in\mathbb N,\ \forall i,j\in\iota,\qquad \langle b_i,U_n^{-1}b_j\rangle =\overline{\langle b_i,U_n b_j\rangle}, \qquad \forall i,j\in\iota,\qquad \langle b_i,U^{-1}b_j\rangle =\overline{\langle b_i,U b_j\rangle}.∀n∈N, ∀i,j∈ι,⟨bi​,Un−1​bj​⟩=⟨bi​,Un​bj​⟩​,∀i,j∈ι,⟨bi​,U−1bj​⟩=⟨bi​,Ubj​⟩​.

The cycle count C=0C=0C=0 is included.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me