Homomorphism property
ProvedHigherComm.hom_propertyis 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). Let be a surjective homomorphism with kernel ; for a congruence of , is the congruence of generated by , and is the preimage. For and congruences 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] [L.IsAlgebraic]
/-- Moorhead, Prop 5.2 (homomorphism property). In an algebra with Day terms, for a surjective
homomorphism `f : M → N` with kernel `π`:
`[θ₀, …, θ_{k+1}] ∨ π = f⁻¹([f(θ₀ ∨ π), …, f(θ_{k+1} ∨ π)])`. -/
theorem hom_property {n k : ℕ} (m : Fin (n + 1) → L.Term (Fin 4)) (hm : IsDayTerms M m)
{N : Type*} [L.Structure N] (f : M →[L] N) (hf : Function.Surjective f)
(T : Fin (k + 2) → Congruence (L := L) M) :
(higherComm T).sup (Congruence.ker f) =
Congruence.comap f
(higherComm (fun i => Congruence.map f ((T i).sup (Congruence.ker f)))) := by sorry
end HigherCommRead-back
What the Lean code literally says, in plain math · claude-opus-5-5
Let be algebraic, an -structure, Day terms in , any -structure (any universe), a homomorphism (function-symbol-preserving; relation-preservation vacuous) that is surjective, and congruences of ( of them). Put . Let be the congruence of generated by , and let be the higher commutator computed in (intersection of all congruences of centralizing at the last coordinate, with -matrices of over 's own polynomials). Then, as congruences of ,
The left side uses the join (intersection of upper bounds).
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.