2014
DOI: 10.1142/s0218216514500606
|View full text |Cite
|
Sign up to set email alerts
|

On factorization systems for surjective quandle homomorphisms

Abstract: Abstract. We study and compare two factorisation systems for surjective homomorphisms in the category of quandles. The first one is induced by the adjunction between quandles and trivial quandles, and a precise description of the two classes of morphisms of this factorisation system is given. In doing this we observe that a special class of congruences in the category of quandles always permute in the sense of the composition of relations, a fact that opens the way to some new universal algebraic investigation… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
9
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
5
3

Relationship

2
6

Authors

Journals

citations
Cited by 10 publications
(10 citation statements)
references
References 17 publications
1
9
0
Order By: Relevance
“…This is an important difference with the case of topological spaces for instance, for which the connected components are connected and thus the corresponding π 0 functor is semi-left-exact. See also [28] for further insights on connectedness.…”
Section: Abmentioning
confidence: 99%
“…This is an important difference with the case of topological spaces for instance, for which the connected components are connected and thus the corresponding π 0 functor is semi-left-exact. See also [28] for further insights on connectedness.…”
Section: Abmentioning
confidence: 99%
“…When moreover N is a normal subgoup of Inn(A), ∼ N becomes a congruence on A, called an orbit congruence (see Theorem 6.1 in [4]). One can show (Lemma 2.6 in [7]) that the orbit congruences in Qnd permute with any other reflexive relation R: ∼ N •R = R• ∼ N . Since the kernel congruence Eq(η A ) of the A-component of the unit of the adjunction (1) η A : A → π 0 (A) is an orbit congruence (it is ∼ Inn(A) ), the adjunction (1) can be shown to be admissible for Galois theory.…”
Section: Trivializing An Extensionmentioning
confidence: 99%
“…The last part of the above theorem includes Proposition 3.6 from [6] as a particular case. For more details, the reader is referred to [18].…”
Section: Formal Closure Operatorsmentioning
confidence: 99%