Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A commuting Stone flow preserves exact-state equivalence

Open
BookProof.BrstReducedTransfer.stoneU_sub_mem_exactStates_of_comm_explicit

by leonardopedro · Oct 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

brstgauge-theorystone-theoremtimepiece

If the Stone flow of TTT commutes with the gauge projection, then two vectors whose difference is an exact state continue to differ by an exact state after evolution: from x−y∈exactStatesx - y \in \mathrm{exactStates}x−y∈exactStates follows stoneUtx−stoneUty∈exactStates\mathrm{stoneU}_t x - \mathrm{stoneU}_t y \in \mathrm{exactStates}stoneUt​x−stoneUt​y∈exactStates for every ttt.

Exact states are the pure-gauge directions; the statement says the flow is well defined on the quotient by them, which is the technical heart of the BRST reduction: physical observables are functions on that quotient, so the evolution has to descend to it.

Corrected statement of the retired node BookProof.BrstReducedTransfer.stoneU_sub_mem_exactStates, with the commutation hypothesis explicit in the binder list.

Preamble
-- Corrected statement of BookProof.BrstReducedTransfer.stoneU_sub_mem_exactStates.
-- The retired node's target silently dropped the hypothesis this statement needs
-- (see its description); here the hypothesis is an explicit binder of the theorem
-- below, so a re-export cannot lose it.  Source of record:
-- timepiece/BookProof/ChapterBrstReducedTransfer.lean (Lean 4.28) and timepiece331/BookProof/ChapterBrstReducedTransfer.lean (Lean 4.33.1).
import Definitions.Def_ChapterSirkTrotterKato
import Mathlib
import Definitions.Def_ChapterBrstReducedTransfer
import Definitions.Def_ChapterStoneResolvent
import Definitions.Def_ChapterStoneUnitary
open BookProof.BrstReducedTransfer



open BookProof BookProof.ChapterStoneResolvent


variable {H : Type*} [NormedAddCommGroup H] [NormedSpace ℂ H]

variable (Om : H →L[ℂ] H)

variable {Om}
variable (Om)
variable (U : ℝ → (H →L[ℂ] H)) (hcomm : ∀ (t : ℝ) (y : H), U t (Om y) = Om (U t y))
variable {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H]
variable (T : UnboundedSelfAdjoint H) (Om : H →L[ℂ] H)
variable (hcomm : ∀ (t : ℝ) (y : H), T.stoneU t (Om y) = Om (T.stoneU t y))
Formal statement
theorem BookProof.BrstReducedTransfer.stoneU_sub_mem_exactStates_of_comm_explicit (hcomm : ∀ (t : ℝ) (y : H), T.stoneU t (Om y) = Om (T.stoneU t y)) (t : ℝ) {x y : H} (h : x - y ∈ exactStates Om) : T.stoneU t x - T.stoneU t y ∈ exactStates Om := by sorry
Source
https://github.com/leonardopedro/timepiece/blob/main/BookProof/ChapterBrstReducedTransfer.lean

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me