Shift rotation
ProvedHigherComm.shift_rotationis 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. For coordinates there are maps () on such that for every -matrix : (0) each is a -matrix; (1) each -cross-section square of (rows indexed by coordinate , columns by ) becomes in ; (2) for every congruence , if all supporting -lines of are -pairs then all supporting -lines of every are; (3) if the supporting -line of the -pivot square of is a -pair, then the pivot -line of is a -pair iff the pivot -line of is a -pair for every .
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]
/-- Moorhead, Lemma 3.1 (shift rotation). Let `m₀, …, mₙ` be Day terms for `M` and
`T = (θ₀, …, θ_{k+1})` (at least two congruences). For coordinates `j ≠ l` there are maps `R e : M(T) → M(T)`
(`e ≤ n`) such that, for every `h ∈ M(T)`:
(1) each `(j,l)`-cross-section square `[[r, s], [u, v]]` of `h` (rows indexed by `j`, columns
by `l`) becomes `[[s, s], [mₑ(s,r,u,v), mₑ(s,s,v,v)]]` in `R e h`;
(2) if every `(j)`-supporting line of `h` is a `δ`-pair, then every `(l)`-supporting line of
`R e h` is a `δ`-pair;
(3) if the `(j)`-supporting line of the `(j,l)`-pivot square of `h` is a `δ`-pair, then the
`(j)`-pivot line of `h` is a `δ`-pair iff the `(l)`-pivot line of `R e h` is a `δ`-pair for
every `e`. -/
theorem shift_rotation {n k : ℕ} (m : Fin (n + 1) → L.Term (Fin 4)) (hm : IsDayTerms M m)
(T : Fin (k + 2) → Congruence (L := L) M) (j l : Fin (k + 2)) (hjl : j ≠ l) :
∃ R : Fin (n + 1) → ((Fin (k + 2) → Bool) → M) → ((Fin (k + 2) → Bool) → M),
∀ h, IsTMatrix T h →
(∀ e, IsTMatrix T (R e h)) ∧
(∀ e (f : Fin (k + 2) → Bool),
let g := Function.update (Function.update f j false) l false
let r := h g
let s := h (Function.update g l true)
let u := h (Function.update g j true)
let v := h (Function.update (Function.update g j true) l true)
R e h f = if f j then (if f l then (m e).realize ![s, s, v, v]
else (m e).realize ![s, r, u, v]) else s) ∧
(∀ δ : Congruence (L := L) M, SupportingRel δ h j → ∀ e, SupportingRel δ (R e h) l) ∧
(∀ δ : Congruence (L := L) M,
LineRel δ h j (Function.update (fun _ => true) l false) →
(PivotRel δ h j ↔ ∀ e, PivotRel δ (R e h) l)) := by sorry
end HigherCommRead-back
What the Lean code literally says, in plain math · claude-opus-5-5
Let be an -structure, , 4-ary terms that are Day terms in , congruences (at least two), in . Then there is a map sending each and each to such that for every -matrix :
- each is a -matrix;
- for each and , with , , , , : if ; if ; if ;
- for every congruence : if all supporting -lines of are -pairs then for every all supporting -lines of are -pairs;
- for every congruence : if , then .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.