Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Chapter GaugeParametrization

Definition
ChapterGaugeParametrization

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

definitionsformalizationtimepiece

Formal definitions for the timepiece Lean 4 formalization (source chapter BookProof/ChapterGaugeParametrization.lean): generated def bundle for ChapterGaugeParametrization. See BookProof/ChapterGaugeParametrization.lean for full context.

Definition code
import Definitions.Def_ChapterGaugeIncompleteFixing
import Mathlib


/-!
# Every parametrization carries a gauge symmetry

This module formalizes the opening argument of the section *"Gauge transformations,
constrained systems and conditioned probability"* of `book.tex` (lines 2240–2252):

> "This includes the case of parametrizations, since these are surjective but
> often there are two or more points in the space of parameters which correspond
> to the same point in the parametrized space […].  As a matter of principle, for
> all parametrizations we can define a gauge group transforming points in the
> parameter space without modifying the corresponding point in the parametrized
> space.  Thus all parametrizations are solutions to constraint equations
> requiring gauge invariance."

Given any parametrization `π : X → Y` of a space `Y` by a parameter space `X`, the
**gauge group of the parametrization** is the group `fiberGauge π` of the
permutations of the parameter space that do not move the parametrized point.

## Results

* `fiberGauge` — the gauge group of a parametrization, a subgroup of the
  permutations of the parameter space.
* `orbit_eq_fiber` — its orbits are *exactly* the fibers of `π`: two parameters
  describe the same point iff they are gauge equivalent.
* `isPhysicalObservable_iff_factors_through` — the gauge-invariant observables of
  this gauge group are exactly the functions of the parametrized point.  This is
  the book's "all parametrizations are solutions to constraint equations requiring
  gauge invariance".
* `fiberGauge_ne_bot_iff` — the gauge group is non-trivial precisely when the
  parametrization is redundant (two parameters for one point), and
  `fiberGauge_eq_bot_iff` is the injective case.
* `isCompleteGaugeFixing'_iff_injOn`,
  `isComprehensiveGaugeFixing_iff_surjOn` — a gauge fixing of this gauge symmetry
  is complete exactly when `π` is injective on it, and comprehensive exactly when
  it already meets every fiber, i.e. when `π` maps it onto the whole parametrized
  space.  A complete comprehensive gauge fixing is therefore the same thing as a
  set of parameters in bijection with the parametrized space.

Everything in this module is `sorry`-free and `axiom`-free.
-/

namespace BookProof.ChapterGaugeParametrization

open BookProof.ChapterGaugeIncompleteFixing

variable {X Y : Type*}

/-- The **gauge group of a parametrization** `π : X → Y`: the permutations of the
parameter space `X` that leave the parametrized point `π x` unchanged. -/
def fiberGauge (π : X → Y) : Subgroup (Equiv.Perm X) where
  carrier := {σ | ∀ x, π (σ x) = π x}
  mul_mem' {a b} ha hb x := by
    simp only [Equiv.Perm.mul_apply]
    rw [ha (b x), hb x]
  one_mem' _ := rfl
  inv_mem' {a} ha x := by
    have h := ha (a⁻¹ x)
    simpa using h.symm



















end BookProof.ChapterGaugeParametrization
Source
https://github.com/leonardopedro/timepiece/blob/61595bc/BookProof/ChapterGaugeParametrization.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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me