Symmetry of the higher commutator
ProvedHigherComm.higherComm_permis a signature without relation symbols and an -algebra; congruences are compatible equivalence relations, ordered by inclusion. are Day terms for : 4-ary terms with , , , ( even), ( odd), holding for all elements of . For congruences with , a -matrix is a map , with if and if , for a polynomial (a term with constants from ) in blocks of variables of arbitrary arities and tuples . A -line is a pair of vertices differing only in coordinate ; the pivot -line has all other coordinates , the others are supporting. : in every -matrix, if all supporting -lines are -pairs then so is the pivot -line. is the intersection of all congruences with (last coordinate). For , congruences and every permutation of : .
import Definitions.Def_HigherComm_defs universe u v w open FirstOrder FirstOrder.Language
namespace HigherComm
variable {L : FirstOrder.Language.{u, v}} {M : Type w} [L.Structure M]
variable [L.IsAlgebraic]
/-- Moorhead, Thm 3.3 (symmetry), in the form of property (4) of §2: in an algebra with Day
terms, `[θ_{σ(0)}, …, θ_{σ(k+1)}] = [θ₀, …, θ_{k+1}]` for every permutation `σ`. -/
theorem higherComm_perm {n k : ℕ} (m : Fin (n + 1) → L.Term (Fin 4)) (hm : IsDayTerms M m)
(T : Fin (k + 2) → Congruence (L := L) M) (σ : Equiv.Perm (Fin (k + 2))) :
higherComm (T ∘ σ) = higherComm T := by sorry
end HigherCommRead-back
What the Lean code literally says, in plain math · claude-opus-5-5
algebraic, Day terms in , congruences, a permutation of . With the congruence relating iff every with CentralAt relates them: .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.