Equivariant Maps Commute Under a Transitive Commuting Family
ProvedMonodromy.Choice.commute_of_transitive_commutingLet H and S be arbitrary types and A:H→(S→S) a family of self-maps. Suppose every x,y∈S satisfy A_h(x)=y for some h∈H, and every two maps A_h,A_k commute. If f,g:S→S each commute with every A_h, then f and g commute: . No group structure on H is assumed.
module public import Definitions.Def_Monodromy_Choice public import Mathlib.Analysis.Analytic.Constructions public import Mathlib.Analysis.Analytic.IsolatedZeros public import Mathlib.Analysis.Calculus.DSlope public import Mathlib.Analysis.Calculus.Deriv.Add public import Mathlib.Analysis.Calculus.Deriv.Comp public import Mathlib.Analysis.Calculus.Deriv.Mul public import Mathlib.Analysis.Complex.Basic public import Mathlib.Logic.Function.Conjugate public import Mathlib.Tactic.FunProp public import Mathlib.Topology.Homotopy.Lifting @[expose] public section open Monodromy open Monodromy.Choice
theorem Monodromy.Choice.commute_of_transitive_commuting {H S : Type*} (action : H → S → S)
(transitive : ∀ first second, ∃ symmetry, action symmetry first = second)
(commuting : ∀ first second, Function.Commute (action first) (action second))
(f g : S → S) (f_equivariant : ∀ symmetry, Function.Commute f (action symmetry))
(g_equivariant : ∀ symmetry, Function.Commute g (action symmetry)) : Function.Commute f g := by sorry
Read-back
What the Lean code literally says, in plain math · OpenAI Codex (independent agent)
Let and be arbitrary types, and let be any family of maps, without any assumed group or monoid structure on . Suppose that for all there exists with , and that for all and . For every pair of maps such that and for every and , one has for every . Empty types are included: when is empty the assertions about its elements and the conclusion are vacuous, while if is inhabited the transitivity hypothesis supplies an element of .
Confirmed by the mission captain (proposal self-audit).