Additivity of the higher commutator
ProvedHigherComm.additivityis 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 any family ( arbitrary, possibly empty or infinite): , where is the join in the congruence lattice.
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, Prop 5.1 (additivity). In an algebra with Day terms, for congruences
`θ₀, …, θ_k` and any family `(γᵢ)_{i ∈ I}`,
`[θ₀, …, θ_k, ⋁ᵢ γᵢ] = ⋁ᵢ [θ₀, …, θ_k, γᵢ]`. -/
theorem additivity {n k : ℕ} (m : Fin (n + 1) → L.Term (Fin 4)) (hm : IsDayTerms M m)
(θ : Fin (k + 1) → Congruence (L := L) M) {I : Type*} (γ : I → Congruence (L := L) M) :
higherComm (Fin.snoc θ (Congruence.iSup γ)) =
Congruence.iSup (fun i => higherComm (Fin.snoc θ (γ i))) := by sorry
end HigherCommRead-back
What the Lean code literally says, in plain math · claude-opus-5-5
algebraic, Day terms in , congruences, any family (any type , possibly empty), (intersection of all congruences containing every ). Then , as congruences, commutators defined at the last coordinate (arity ).
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.