prime maltsev conditions
play

Prime Maltsev Conditions Libor Barto joint work with Jakub Opr sal - PowerPoint PPT Presentation

Prime Maltsev Conditions Libor Barto joint work with Jakub Opr sal Charles University in Prague NSAC 2013, June 7, 2013 Outline (Part 1) Interpretations (Part 2) Lattice of interpretability (Part 3) Prime filters (Part 4)


  1. Prime Maltsev Conditions Libor Barto joint work with Jakub Oprˇ sal Charles University in Prague NSAC 2013, June 7, 2013

  2. Outline ◮ (Part 1) Interpretations ◮ (Part 2) Lattice of interpretability ◮ (Part 3) Prime filters ◮ (Part 4) Syntactic approach ◮ (Part 4) Relational approach

  3. (Part 1) Interpretations

  4. Interpretations between varieties V , W : varieties of algebras

  5. Interpretations between varieties V , W : varieties of algebras Interpretation V → W : mapping from terms of V to terms of W , which sends variables to the same variables and preserves identities.

  6. Interpretations between varieties V , W : varieties of algebras Interpretation V → W : mapping from terms of V to terms of W , which sends variables to the same variables and preserves identities. Determined by values on basic operations

  7. Interpretations between varieties V , W : varieties of algebras Interpretation V → W : mapping from terms of V to terms of W , which sends variables to the same variables and preserves identities. Determined by values on basic operations Example: ◮ V given by a single ternary operation symbol m and ◮ the identity m ( x , y , y ) ≈ m ( y , y , x ) ≈ x

  8. Interpretations between varieties V , W : varieties of algebras Interpretation V → W : mapping from terms of V to terms of W , which sends variables to the same variables and preserves identities. Determined by values on basic operations Example: ◮ V given by a single ternary operation symbol m and ◮ the identity m ( x , y , y ) ≈ m ( y , y , x ) ≈ x ◮ f : V → W is determined by m ′ = f ( m ) ◮ m ′ must satisfy m ′ ( x , y , y ) ≈ m ( y , y , x ) ≈ x

  9. Interpretation between varieties Exmaple: Unique interpretation from V = Sets to any W

  10. Interpretation between varieties Exmaple: Unique interpretation from V = Sets to any W V = Semigroups , W = Sets , f : x · y �→ x is an Example: interpretation

  11. Interpretation between varieties Exmaple: Unique interpretation from V = Sets to any W V = Semigroups , W = Sets , f : x · y �→ x is an Example: interpretation Assume V is idempotent. No interpretation V → Sets Example: equivalent to the existence of a Taylor term in V

  12. Interpretation between algebras A , B : algebras

  13. Interpretation between algebras A , B : algebras Interpretation A → B : map from the term operations of A to term operations of B which maps projections to projections and preserves composition

  14. Interpretation between algebras A , B : algebras Interpretation A → B : map from the term operations of A to term operations of B which maps projections to projections and preserves composition ◮ Interpretations A → B essentially the same as interpretations HSP( A ) → HSP( B )

  15. Interpretation between algebras A , B : algebras Interpretation A → B : map from the term operations of A to term operations of B which maps projections to projections and preserves composition ◮ Interpretations A → B essentially the same as interpretations HSP( A ) → HSP( B ) ◮ Depends only on the clone of A and the clone of B

  16. Interpretation between algebras A , B : algebras Interpretation A → B : map from the term operations of A to term operations of B which maps projections to projections and preserves composition ◮ Interpretations A → B essentially the same as interpretations HSP( A ) → HSP( B ) ◮ Depends only on the clone of A and the clone of B Examples of interpretations between clones A → B :

  17. Interpretation between algebras A , B : algebras Interpretation A → B : map from the term operations of A to term operations of B which maps projections to projections and preserves composition ◮ Interpretations A → B essentially the same as interpretations HSP( A ) → HSP( B ) ◮ Depends only on the clone of A and the clone of B Examples of interpretations between clones A → B : ◮ Inclusion (A): when B contains A

  18. Interpretation between algebras A , B : algebras Interpretation A → B : map from the term operations of A to term operations of B which maps projections to projections and preserves composition ◮ Interpretations A → B essentially the same as interpretations HSP( A ) → HSP( B ) ◮ Depends only on the clone of A and the clone of B Examples of interpretations between clones A → B : ◮ Inclusion (A): when B contains A ◮ Diagonal map (P): when B = A n

  19. Interpretation between algebras A , B : algebras Interpretation A → B : map from the term operations of A to term operations of B which maps projections to projections and preserves composition ◮ Interpretations A → B essentially the same as interpretations HSP( A ) → HSP( B ) ◮ Depends only on the clone of A and the clone of B Examples of interpretations between clones A → B : ◮ Inclusion (A): when B contains A ◮ Diagonal map (P): when B = A n ◮ Restriction to B (S): when B ≤ A

  20. Interpretation between algebras A , B : algebras Interpretation A → B : map from the term operations of A to term operations of B which maps projections to projections and preserves composition ◮ Interpretations A → B essentially the same as interpretations HSP( A ) → HSP( B ) ◮ Depends only on the clone of A and the clone of B Examples of interpretations between clones A → B : ◮ Inclusion (A): when B contains A ◮ Diagonal map (P): when B = A n ◮ Restriction to B (S): when B ≤ A ◮ Quotient modulo ∼ (H): when B = A / ∼

  21. Interpretation between algebras A , B : algebras Interpretation A → B : map from the term operations of A to term operations of B which maps projections to projections and preserves composition ◮ Interpretations A → B essentially the same as interpretations HSP( A ) → HSP( B ) ◮ Depends only on the clone of A and the clone of B Examples of interpretations between clones A → B : ◮ Inclusion (A): when B contains A ◮ Diagonal map (P): when B = A n ◮ Restriction to B (S): when B ≤ A ◮ Quotient modulo ∼ (H): when B = A / ∼ Birkhoff theorem ⇒ ∀ interpretation is of the form A ◦ H ◦ S ◦ P .

  22. Interpretations are complicated Theorem (B, 2006) The category of varieties and interpretations is as complicated as it can be. For instance: every small category is a full subcategory of it

  23. (Part 2) Lattice of Interpretability Neumann 74 Garcia, Taylor 84

  24. The lattice L V ≤ W : if ∃ interpretation V → W This is a quasiorder

  25. The lattice L V ≤ W : if ∃ interpretation V → W This is a quasiorder Define V ∼ W iff V ≤ W and W ≤ V . ≤ modulo ∼ is a poset, in fact a lattice:

  26. The lattice L V ≤ W : if ∃ interpretation V → W This is a quasiorder Define V ∼ W iff V ≤ W and W ≤ V . ≤ modulo ∼ is a poset, in fact a lattice: The lattice L of intepretability types of varieties

  27. The lattice L V ≤ W : if ∃ interpretation V → W This is a quasiorder Define V ∼ W iff V ≤ W and W ≤ V . ≤ modulo ∼ is a poset, in fact a lattice: The lattice L of intepretability types of varieties ◮ V ≤ W iff W satisfies the “strong Maltsev” condition determined by V ◮ i.e. V ≤ W iff W gives a stronger condition than V

  28. The lattice L V ≤ W : if ∃ interpretation V → W This is a quasiorder Define V ∼ W iff V ≤ W and W ≤ V . ≤ modulo ∼ is a poset, in fact a lattice: The lattice L of intepretability types of varieties ◮ V ≤ W iff W satisfies the “strong Maltsev” condition determined by V ◮ i.e. V ≤ W iff W gives a stronger condition than V ◮ A ≤ B iff Clo( B ) ∈ AHSP Clo( A )

  29. Meet and joins in L V ∨ W : Disjoint union of signatures of V and W and identities

  30. Meet and joins in L V ∨ W : Disjoint union of signatures of V and W and identities A ∧ B ( A and B are clones) Base set = A × B operations are f × g , where f (resp. g ) is an operation of A (resp. B )

  31. About L ◮ Has the bottom element 0 = Sets = Semigroups and the top element ( x ≈ y ).

  32. About L ◮ Has the bottom element 0 = Sets = Semigroups and the top element ( x ≈ y ). ◮ Every poset embeds into L (follows from the theorem mentioned; known before Barkhudaryan, Trnkov´ a)

  33. About L ◮ Has the bottom element 0 = Sets = Semigroups and the top element ( x ≈ y ). ◮ Every poset embeds into L (follows from the theorem mentioned; known before Barkhudaryan, Trnkov´ a) ◮ Open problem: which lattices embed into L ?

  34. About L ◮ Has the bottom element 0 = Sets = Semigroups and the top element ( x ≈ y ). ◮ Every poset embeds into L (follows from the theorem mentioned; known before Barkhudaryan, Trnkov´ a) ◮ Open problem: which lattices embed into L ? ◮ Many important classes of varieties are filters in L : congruence permutable/ n -permutable/distributive/modular. . . varieties; clones with CSP in P/NL/L, . . .

  35. About L ◮ Has the bottom element 0 = Sets = Semigroups and the top element ( x ≈ y ). ◮ Every poset embeds into L (follows from the theorem mentioned; known before Barkhudaryan, Trnkov´ a) ◮ Open problem: which lattices embed into L ? ◮ Many important classes of varieties are filters in L : congruence permutable/ n -permutable/distributive/modular. . . varieties; clones with CSP in P/NL/L, . . . ◮ Many important theorems talk (indirectly) about (subposets of) L

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend