Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Centrality is upward closed: C(T; delta) iff [T] <= delta

Proved
HigherComm.centralAt_iff_le

by Alien60 · Nov 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

commutator-theorycongruence-modularday-termsmodel-theoryuniversal-algebra

LLL is a signature without relation symbols and MMM an LLL-algebra; congruences are compatible equivalence relations, ordered by inclusion. m0,…,mnm_0,\dots,m_nm0​,…,mn​ are Day terms for MMM: 4-ary terms with me(x,y,y,x)=xm_e(x,y,y,x)=xme​(x,y,y,x)=x, m0=xm_0=xm0​=x, mn=um_n=umn​=u, me(x,x,u,u)=me+1(x,x,u,u)m_e(x,x,u,u)=m_{e+1}(x,x,u,u)me​(x,x,u,u)=me+1​(x,x,u,u) (eee even), me(x,y,y,u)=me+1(x,y,y,u)m_e(x,y,y,u)=m_{e+1}(x,y,y,u)me​(x,y,y,u)=me+1​(x,y,y,u) (eee odd), holding for all elements of MMM. For congruences T=(θ0,…,θk−1)T=(\theta_0,\dots,\theta_{k-1})T=(θ0​,…,θk−1​) with k≥2k\ge2k≥2, a TTT-matrix is a map h:{0,1}k→Mh:\{0,1\}^k\to Mh:{0,1}k→M, h(f)=t(x0,…,xk−1)h(f)=t(\mathbf x_0,\dots,\mathbf x_{k-1})h(f)=t(x0​,…,xk−1​) with xi=ai\mathbf x_i=\mathbf a_ixi​=ai​ if f(i)=0f(i)=0f(i)=0 and xi=bi\mathbf x_i=\mathbf b_ixi​=bi​ if f(i)=1f(i)=1f(i)=1, for a polynomial ttt (a term with constants from MMM) in blocks of variables of arbitrary arities and tuples ai≡θibi\mathbf a_i\equiv_{\theta_i}\mathbf b_iai​≡θi​​bi​. A (j)(j)(j)-line is a pair of vertices differing only in coordinate jjj; the pivot (j)(j)(j)-line has all other coordinates 111, the others are supporting. C(T;j;δ)C(T;j;\delta)C(T;j;δ): in every TTT-matrix, if all supporting (j)(j)(j)-lines are δ\deltaδ-pairs then so is the pivot (j)(j)(j)-line. [θ0,…,θk][\theta_0,\dots,\theta_k][θ0​,…,θk​] is the intersection of all congruences δ\deltaδ with C(T;k;δ)C(T;k;\delta)C(T;k;δ) (last coordinate). For k≥1k\ge1k≥1, congruences T=(θ0,…,θk)T=(\theta_0,\dots,\theta_k)T=(θ0​,…,θk​), any coordinate jjj and any congruence δ\deltaδ: C(T;j;δ)C(T;j;\delta)C(T;j;δ) holds iff [θ0,…,θk]≤δ[\theta_0,\dots,\theta_k]\le\delta[θ0​,…,θk​]≤δ.

Preamble
import Definitions.Def_HigherComm_defs

universe u v w

open FirstOrder FirstOrder.Language
Formal statement
namespace HigherComm

variable {L : FirstOrder.Language.{u, v}} {M : Type w} [L.Structure M]

variable [L.IsAlgebraic]

/-- Moorhead, Thm 4.4(2).  In an algebra with Day terms, `C(T; δ)` holds (at any coordinate
`j`) iff `[T] ≤ δ`. -/
theorem centralAt_iff_le {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 δ ↔ higherComm T ≤ δ := by sorry

end HigherComm
Source
A. Moorhead, Higher commutator theory for congruence modular varieties, J. Algebra 513 (2018) 133-158, https://doi.org/10.1016/j.jalgebra.2018.07.026 (arXiv:1610.07087), Thm 4.4(2)
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

LLL algebraic, Day terms in MMM, T=(θ0,…,θk+1)T=(\theta_0,\dots,\theta_{k+1})T=(θ0​,…,θk+1​), any j≤k+1j\le k+1j≤k+1, any congruence δ\deltaδ: CentralAt(T,j,δ)  ⟺  [T]≤δ(T,j,\delta)\iff[T]\le\delta(T,j,δ)⟺[T]≤δ, where [T][T][T] is the intersection of all δ′\delta'δ′ centralizing at the last coordinate.

Human review
  • Endorsed by Shuze Chen · Nov 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Alien60 · Nov 7, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me