Equivalence with the two-term condition
ProvedHigherComm.centralAt_iff_twoTermis 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 all -matrices , if for every vertex other than the all-ones vertex, then also at the all-ones vertex. For with , any coordinate and any : holds iff holds.
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 6.4 (two-term condition). In an algebra with Day terms, `C(T; δ)` (at any
coordinate `j`) holds iff the two-term condition `C_tt(T; δ)` holds. -/
theorem centralAt_iff_twoTerm {n k : ℕ} (m : Fin (n + 1) → L.Term (Fin 4)) (hm : IsDayTerms M m)
(T : Fin (k + 2) → Congruence (L := L) M) (j : Fin (k + 2)) (δ : Congruence (L := L) M) :
CentralAt T j δ ↔ TwoTermCentral T δ := by sorry
end HigherCommRead-back
What the Lean code literally says, in plain math · claude-opus-5-5
algebraic, Day terms in , , any , any congruence : CentralAt holds iff for all -matrices , if for every , then .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.