Identities of K are the identities of the free algebra
ProvedUAVariety.free_identities is a signature without relation symbols; an algebra is a type in Type u with an -structure (Alg L), and is a class of algebras. means and agree under every assignment of the variables in ; is the class of algebras satisfying every identity in (identities over the variables ), and the set of identities over true in every member of . , where is the term algebra over and is the intersection of all congruences on with ; and are the classes of a variable and of a term. For every type in Type u and terms over : iff , iff in , iff .
import Definitions.Def_UAVariety_defs universe u v w open FirstOrder FirstOrder.Language
namespace UAVariety
variable {L : FirstOrder.Language.{u, v}} [L.IsAlgebraic]
/-- B&S Thm 11.4: for terms `p, q` over `X`, `K ⊨ p ≈ q` iff `F_K(X̄) ⊨ p ≈ q` iff
`p̄ = q̄` in `F_K(X̄)` iff `(p, q) ∈ θ_K(X)`. -/
theorem free_identities (K : Set (Alg L)) (X : Type u) (p q : L.Term X) :
((∀ A ∈ K, Satisfies A (p, q)) ↔ Satisfies (freeAlg K X) (p, q)) ∧
(Satisfies (freeAlg K X) (p, q) ↔ freeMk K X p = freeMk K X q) ∧
(freeMk K X p = freeMk K X q ↔ (freeCong K X).r p q) := by sorry
end UAVarietyRead-back
What the Lean code literally says, in plain math · claude-opus-5-5
Let be a signature with no relation symbols, an arbitrary class of algebras (carriers in ), an arbitrary type in , and arbitrary -terms over the variables . Let be the relation on given by: iff for every congruence of the term algebra with embeddable in a member of . Let (quotient structure) and the classes of . The statement is the conjunction of three biconditionals:
- Every satisfies (i.e. for all ) iff satisfies (i.e. for all ).
- satisfies iff in .
- in iff .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.