2007
DOI: 10.1016/j.jpaa.2007.01.009
|View full text |Cite
|
Sign up to set email alerts
|

Localization in tame and wild coalgebras

Abstract: We apply the theory of localization for tame and wild coalgebras in order to prove the following theorem: "Let Q be an acyclic quiver. Then any tame admissible subcoalgebra of K Q is the path coalgebra of a quiver with relations".

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
20
0

Year Published

2007
2007
2021
2021

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 11 publications
(23 citation statements)
references
References 16 publications
0
20
0
Order By: Relevance
“…3. In particular, it shows that the coalgebra C is fc-tame if and only if every socle-finite colocalization C E ∼ = R • E of C (in the sense of [11,25]) is fc-tame.…”
Section: On Fc-tameness For Arbitrary Coalgebrasmentioning
confidence: 95%
See 3 more Smart Citations
“…3. In particular, it shows that the coalgebra C is fc-tame if and only if every socle-finite colocalization C E ∼ = R • E of C (in the sense of [11,25]) is fc-tame.…”
Section: On Fc-tameness For Arbitrary Coalgebrasmentioning
confidence: 95%
“…Since E 0 is a direct summand of E Uv , by [11] and [25] (Proposition 2.7 and Theorem 2.10) there is an isomorphism E 0 ∼ = E 0 , the socle of res Ev (E 1 ) is a finite-dimensional subcomodule of the coalgebra e v Ce v and the socle of E ∨ 1 = e v C evCev res Ev (E 1 ) is a finite direct sum of comodules S(a), with a ∈ U v . It follows that the injective envelope E 1 = E C (E ∨ 1 ) of the C-comodule E ∨ 1 lies in add(E Uv ).…”
Section: Preliminaries Onfc-comodule Types For Coalgebrasmentioning
confidence: 99%
See 2 more Smart Citations
“…Apply the proof of Theorem 5.7(b). The following corollary is an immediate consequence of Theorem 6.2. for n ≤ m. Here we follow the localisation technique for coalgebras studied in [11], [19], [29], [37]. It follows that µ I n (S I (a), S I (b)) = µ J n (S J (a), S J (b)) for 1 ≤ n ≤ m, and the computation of r I (a, b) in I reduces to the computation of r J (a, b) in the finite subposet J = J ab of b ⊆ I.…”
Section: And S(y ) = S(x)mentioning
confidence: 99%