Absorption Theorem
ProvedBKAbsorption.absorption_theoremis a signature without relation symbols. and are finite algebras in one Taylor variety: both are idempotent and satisfy the identities of one fixed Taylor term. ( absorbs ): is a subuniverse and some term operation gives whenever all but at most one lie in ; proper means ; : is nonempty, absorbs , and no proper subalgebra of absorbs . : is a subuniverse of (coordinatewise operations) with both projections onto. is linked: any two elements of its first projection are joined by a chain whose consecutive elements have a common -neighbour. If is linked and , then or has a proper absorbing subuniverse.
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, Theorem 2.11 (the Absorption Theorem). Let `A, B` be finite algebras in a
Taylor variety (both satisfy the identities of one Taylor datum `T`) and let `R` be a proper,
subdirect and linked subalgebra of `A × B`. Then `A` or `B` has a proper absorbing
subalgebra. -/
theorem absorption_theorem {A : Type w} {B : Type w'} [L.Structure A] [L.Structure B]
[Finite A] [Finite B] (T : TaylorDatum L) (hA : IsTaylorAlg T A) (hB : IsTaylorAlg T B)
(R : L.Substructure (A × B)) (hsd : Subdirect (R : Set (A × B)))
(hlk : Linked (R : Set (A × B))) (hpr : (R : Set (A × B)) ≠ Set.univ) :
HasProperAbsorbing L A ∨ HasProperAbsorbing L B := by sorry
end BKAbsorptionRead-back
What the Lean code literally says, in plain math · claude-opus-5-5
Let , be finite algebras (possibly in different universes) and one Taylor datum such that both and are idempotent and satisfy the Taylor identities of . Let be a subalgebra of the coordinatewise product such that:
- is subdirect: and ;
- is linked: for all there is a chain () in which consecutive have a common neighbour with ;
- .
Then has an absorbing subuniverse with , or has an absorbing subuniverse with .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.