Full dualisability is independent of the generating algebra (Q422337): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00012-012-0180-5 / rank
Normal rank
 
Property / author
 
Property / author: Brian A. Davey / rank
Normal rank
 
Property / author
 
Property / author: Miroslav Haviar / rank
Normal rank
 
Property / author
 
Property / author: Jane G. Pitkethly / rank
Normal rank
 
Property / review text
 
Let be \(\mathbb M\) and \(\mathbb N\) be two finite algebras that generate the same quasivariety \(\mathcal A\). The authors prove that if there is a full duality for \(\mathcal A\) based on \(\mathbb M\), then there is also one based on \(\mathbb N\) (Theorem 1.1). Recall that the corresponding result for dualisability was proved by \textit{M. J. Saramago} [Algebra Univers. 43, No. 2--3, 197--212 (2000; Zbl 1011.08003)] and \textit{B. A. Davey} and \textit{R. Willard} [Algebra Univers. 45, No. 1, 103--106 (2001; Zbl 1039.08006)], and for strong dualisability it was proved by \textit{J. Hyndman} [Algebra Univers. 51, No. 1, 29--34 (2004; Zbl 1092.08004)]. The route to Theorem 1.1 is via its multi-sorted generalisation (Theorem 1.2). In fact, the proof simultaneously establishes independence of the generator for multi-sorted full and strong dualities. The authors prove Theorem 1.2 using the same two-stage approach that \textit{B. A. Davey} et al. [Algebra Univers. 66, No. 4, 331--336 (2011; Zbl 1235.08004)] used to prove the corresponding result for multi-sorted duality: they show how to transfer a full/strong duality when an algebra is added to the generating set (Lemma 3.1), and how to transfer a full/strong duality when an algebra is removed from the generating set (Lemma 3.2). The following Theorem 2.4 tells exactly how to add to the type of an \textsl{alter ego} without destroying full duality. This theorem was proved in the single-sorted case by \textit{B. A. Davey} et al. [Int. J. Algebra Comput. 22, No. 1, 1250007, 36 p. (2012; Zbl 1258.08006), Theorem 5.3] as a corollary of a general theorem based on a Galois connection, which was set up to help give a better understanding of full dualities. While this Galois connection can be extended to the multi-sorted setting, the authors give a direct simpler proof of this multi-sorted version.
Property / review text: Let be \(\mathbb M\) and \(\mathbb N\) be two finite algebras that generate the same quasivariety \(\mathcal A\). The authors prove that if there is a full duality for \(\mathcal A\) based on \(\mathbb M\), then there is also one based on \(\mathbb N\) (Theorem 1.1). Recall that the corresponding result for dualisability was proved by \textit{M. J. Saramago} [Algebra Univers. 43, No. 2--3, 197--212 (2000; Zbl 1011.08003)] and \textit{B. A. Davey} and \textit{R. Willard} [Algebra Univers. 45, No. 1, 103--106 (2001; Zbl 1039.08006)], and for strong dualisability it was proved by \textit{J. Hyndman} [Algebra Univers. 51, No. 1, 29--34 (2004; Zbl 1092.08004)]. The route to Theorem 1.1 is via its multi-sorted generalisation (Theorem 1.2). In fact, the proof simultaneously establishes independence of the generator for multi-sorted full and strong dualities. The authors prove Theorem 1.2 using the same two-stage approach that \textit{B. A. Davey} et al. [Algebra Univers. 66, No. 4, 331--336 (2011; Zbl 1235.08004)] used to prove the corresponding result for multi-sorted duality: they show how to transfer a full/strong duality when an algebra is added to the generating set (Lemma 3.1), and how to transfer a full/strong duality when an algebra is removed from the generating set (Lemma 3.2). The following Theorem 2.4 tells exactly how to add to the type of an \textsl{alter ego} without destroying full duality. This theorem was proved in the single-sorted case by \textit{B. A. Davey} et al. [Int. J. Algebra Comput. 22, No. 1, 1250007, 36 p. (2012; Zbl 1258.08006), Theorem 5.3] as a corollary of a general theorem based on a Galois connection, which was set up to help give a better understanding of full dualities. While this Galois connection can be extended to the multi-sorted setting, the authors give a direct simpler proof of this multi-sorted version. / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 08C20 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 08C15 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6035620 / rank
 
Normal rank
Property / zbMATH Keywords
 
natural duality
Property / zbMATH Keywords: natural duality / rank
 
Normal rank
Property / zbMATH Keywords
 
full dualisability
Property / zbMATH Keywords: full dualisability / rank
 
Normal rank
Property / zbMATH Keywords
 
strong dualisability
Property / zbMATH Keywords: strong dualisability / rank
 
Normal rank
Property / zbMATH Keywords
 
multi-sorted duality
Property / zbMATH Keywords: multi-sorted duality / rank
 
Normal rank
Property / author
 
Property / author: Brian A. Davey / rank
 
Normal rank
Property / author
 
Property / author: Miroslav Haviar / rank
 
Normal rank
Property / author
 
Property / author: Jane G. Pitkethly / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Leonid Matveevich Martynov / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00012-012-0180-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1984611384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4220406 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Not every full duality is strong! / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5184960 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multisorted dualisability: change of base / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2725477 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5297720 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Full but not strong dualities at the finite level: extending the realm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using coloured ordered sets to study finite-level full dualities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Full does not imply strong, does it? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural entailment / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE LATTICE OF ALTER EGOS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3033816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dualisability of a quasi-variety is independent of the generating algebra. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transferral of entailment in duality theory II: Strong dualisability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong duality of finite algebras that generate the same quasivariety / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5536619 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3182302 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on dualisability and endodualisability / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00012-012-0180-5 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:04, 9 December 2024

scientific article
Language Label Description Also known as
English
Full dualisability is independent of the generating algebra
scientific article

    Statements

    Full dualisability is independent of the generating algebra (English)
    0 references
    16 May 2012
    0 references
    Let be \(\mathbb M\) and \(\mathbb N\) be two finite algebras that generate the same quasivariety \(\mathcal A\). The authors prove that if there is a full duality for \(\mathcal A\) based on \(\mathbb M\), then there is also one based on \(\mathbb N\) (Theorem 1.1). Recall that the corresponding result for dualisability was proved by \textit{M. J. Saramago} [Algebra Univers. 43, No. 2--3, 197--212 (2000; Zbl 1011.08003)] and \textit{B. A. Davey} and \textit{R. Willard} [Algebra Univers. 45, No. 1, 103--106 (2001; Zbl 1039.08006)], and for strong dualisability it was proved by \textit{J. Hyndman} [Algebra Univers. 51, No. 1, 29--34 (2004; Zbl 1092.08004)]. The route to Theorem 1.1 is via its multi-sorted generalisation (Theorem 1.2). In fact, the proof simultaneously establishes independence of the generator for multi-sorted full and strong dualities. The authors prove Theorem 1.2 using the same two-stage approach that \textit{B. A. Davey} et al. [Algebra Univers. 66, No. 4, 331--336 (2011; Zbl 1235.08004)] used to prove the corresponding result for multi-sorted duality: they show how to transfer a full/strong duality when an algebra is added to the generating set (Lemma 3.1), and how to transfer a full/strong duality when an algebra is removed from the generating set (Lemma 3.2). The following Theorem 2.4 tells exactly how to add to the type of an \textsl{alter ego} without destroying full duality. This theorem was proved in the single-sorted case by \textit{B. A. Davey} et al. [Int. J. Algebra Comput. 22, No. 1, 1250007, 36 p. (2012; Zbl 1258.08006), Theorem 5.3] as a corollary of a general theorem based on a Galois connection, which was set up to help give a better understanding of full dualities. While this Galois connection can be extended to the multi-sorted setting, the authors give a direct simpler proof of this multi-sorted version.
    0 references
    natural duality
    0 references
    full dualisability
    0 references
    strong dualisability
    0 references
    multi-sorted duality
    0 references
    0 references
    0 references
    0 references

    Identifiers