Barto–Kozik Claim 3.8: weak components of algebraic length 1 are subuniverses
ProvedBKAbsorption.component_subuniverseThroughout, is a finite algebra, is a subuniverse (a digraph on compatible with the operations), and is a subuniverse such that the induced digraph is smooth (every vertex of has an in- and an out-neighbour in ). A walk of algebraic length counts forward edges minus backward edges. Absorption is relative: absorbs if is a subuniverse and some term of positive arity satisfies whenever all and all but at most one .
Assume is idempotent. If lies on a closed walk of algebraic length in , then the weak component is a subuniverse of .
(In the paper this follows from Claim 3.8: every vertex of the component is reached from by one common fence, and applying an operation coordinatewise along the fence preserves the component, by idempotency.)
import Definitions.Def_BKAbsorption_defs universe u v w w' open FirstOrder FirstOrder.Language
namespace BKAbsorption
variable {L : FirstOrder.Language.{u, v}} [L.IsAlgebraic]
/-- Barto–Kozik, consequence of Claim 3.8 (relative form). Let `A` be a finite idempotent
algebra, `E ≤ A²` a subuniverse, and `S` a subuniverse of `A` such that the induced digraph
`(S, E ∩ S²)` is smooth. If `a ∈ S` lies on a closed walk of algebraic length `1` in `(S, E ∩ S²)`,
then the weak component of `a` in `(S, E ∩ S²)` is a subuniverse of `A`. -/
theorem component_subuniverse {A : Type w} [L.Structure A] [Finite A] (hid : IsIdempotent L A)
(E : L.Substructure (A × A)) (S : Set A) (hS : IsSubuniverse L S)
(hsm : ∀ x ∈ S, (∃ y ∈ S, (x, y) ∈ E) ∧ ∃ y ∈ S, (y, x) ∈ E)
(a : A) (ha : a ∈ S) (hlen : Walk ((E : Set (A × A)) ∩ S ×ˢ S) a a 1) :
IsSubuniverse L {x | ∃ z, Walk ((E : Set (A × A)) ∩ S ×ˢ S) a x z} := by sorry
end BKAbsorption