Contents 1. Introduction 2 2. Preliminaries 4 2.1. Some results on ...
Contents 1. Introduction 2 2. Preliminaries 4 2.1. Some results on ... Contents 1. Introduction 2 2. Preliminaries 4 2.1. Some results on ...
144(◦ ρ D ̂QQ)Q◦ (QlQ) ◦ (QP xQ) ◦ (δ C QP Q) ◦ (CQδ D ) ◦ (C ρ Q D ) ◦ ρ D Q(= τ ̂QQ)◦ τ.2) Counitality, in the sense that ( Qσ B) ◦ τ = Qu B and ( σ A Q ) ◦ τ = u A Q. Let usprove that (QσB ) ◦ τ = Qu B .In fact, we have(QσB ) ◦ τ= ( Qσ B) ◦ (QlQ) ◦ (QP xQ) ◦ (δ C QP Q) ◦ (CQδ D ) ◦ (C ρ Q D ) ◦ ρ D Q(149)= ( Qσ B) ◦ (Qν ′ 0Q) ◦ (QyP Q) ◦ (δ C QP Q) ◦ (CQδ D ) ◦ (C ρ Q D ) ◦ ρ D Q(162)= (Qm B ) ◦ (QBy) ◦ (QyP Q) ◦ (δ C QP Q) ◦ (CQδ D ) ◦ (C ρ Q D ) ◦ ρ D QLet us prove that= (Qm B ) ◦ (Qyy) ◦ (δ C QP Q) ◦ (CQδ D ) ◦ (C ρ Q D ) ◦ ρ D Q(109)= (Qy) ◦ (QP χ) ◦ (δ C QP Q) ◦ (CQδ D ) ◦ (C ρ Q D ) ◦ ρ D Qδ C= (Qy) ◦ (QP χ) ◦ (QP Qδ D ) ◦ (δ C QD) ◦ (C ρ Q D ) ◦ ρ D Q(130)= (Qy) ◦ ( QP Qε D) ◦ (δ C QD) ◦ (C ρ Q D ) ◦ ρ D Qδ C= (Qy) ◦ (δ C Q) ◦ ( CQε D) ◦ (C ρ Q D ) ◦ ρ D QQis a bicom= (Qy) ◦ (δ C Q) ◦ ( CQε D) ◦ (Cρ D Q) ◦ C ρ QQis a com= (Qy) ◦ (δ C Q) ◦ C ρ Q(127)= (Qy) ◦ (Qδ D ) ◦ ρ D Q(110)= (Qu B ) ◦ ( Qε D) ◦ ρ D Qis a comQ = Qu B .(σ A Q ) ◦ τ = (u A Q).We calculate(σ A Q ) ◦ τ= ( σ A Q ) ◦ (QlQ) ◦ (QP xQ) ◦ (δ C QP Q) ◦ (CQδ D ) ◦ (C ρ Q D ) ◦ ρ D Q(161)= (m A Q) ◦ (xAQ) ◦ (QP xQ) ◦ (δ C QP Q) ◦ (CQδ D ) ◦ (C ρ Q D ) ◦ ρ D Q= (m A Q) ◦ (xxQ) ◦ (δ C QP Q) ◦ (CQδ D ) ◦ (C ρ Q D ) ◦ ρ D Q(102)= (xQ) ◦ (χP Q) ◦ (δ C QP Q) ◦ (CQδ D ) ◦ (C ρ Q D ) ◦ ρ D Q(129)= (xQ) ◦ ( ε C QP Q ) ◦ (CQδ D ) ◦ (C ρ Q D ) ◦ ρ D Qε C = (xQ) ◦ (Qδ D ) ◦ ( ε C QD ) ◦ (C ρ Q D ) ◦ ρ D QQis a com= (xQ) ◦ (Qδ D ) ◦ ρ D (127)Q = (xQ) ◦ (δ C Q) ◦ C ρ Q(103)= (u A Q) ◦ ( ε C Q ) ◦ C ρ QQis a com= u A Q.
7.5. Herd - Coherd - Herd.7.1
- Page 94 and 95: 94(ii) the functorial morphism can
- Page 96 and 97: 96defΦ= ( QP A µ Q)◦(QP σ A Q
- Page 98 and 99: 98AU A can AA F = can AA F = ( CσA
- Page 100 and 101: 100Similarly, one can prove the sta
- Page 102 and 103: 102(b) A comonad C = ( C, ∆ C ,
- Page 104 and 105: 104We calculateso that we getx ◦
- Page 106 and 107: 106There exist functorial morphisms
- Page 108 and 109: 108andsatisfying(B, y) = Coequ Fun(
- Page 110 and 111: 1104) With notations of Theorem 6.2
- Page 112 and 113: 112Then ν : Y → D is the unique
- Page 114 and 115: 114= A µ Q ◦ ( Aε C Q ) ◦ (AC
- Page 116 and 117: 116= ( Aε C Q ) ◦ ( cocan1 −1
- Page 118 and 119: 118so that we getχ= (Cx) ◦ (C ρ
- Page 120 and 121: 120We want to prove that Γ is an o
- Page 122 and 123: 122and since Dε D is an epimorphis
- Page 124 and 125: 124χ= (Cχ) ◦ (C ρ Q P Q ) ◦
- Page 126 and 127: 126Now, since cocan 1 : AC → QP i
- Page 128 and 129: 1287. Herds and Coherds7.1.
- Page 130 and 131: 130◦ ( σ A QQQ ) ◦ (A µ Q P Q
- Page 132 and 133: 132= µ B Q ◦ (A µ Q B ) ◦ ( A
- Page 134 and 135: 134Assume now that there is another
- Page 136 and 137: 136and hence we get(160) x ◦ (χP
- Page 138 and 139: 138Proposition 7.7. In the setting
- Page 140 and 141: 140We calculateA µ Q ◦ ( σ A Q
- Page 142 and 143: 142x=and=δ C=(l= QlQ ̂QQ)◦ (QP
- Page 146 and 147: 146given byWe computeσ B = m B ◦
- Page 148 and 149: 148andy= ′m B ◦ (ν B B) ◦ (y
- Page 150 and 151: 150Now we compute(hQ) ◦ ( Qχ )
- Page 152 and 153: 152Thus we obtainσ B ◦ ( ) (P µ
- Page 154 and 155: 154Thus hQ is an isomorphism with i
- Page 156 and 157: 156) ( )l=(pb Q AQ B ◦ ̂QA µ QB
- Page 158 and 159: 158In fact we haveTherefore we dedu
- Page 160 and 161: 160χ= h 1 ◦ (P xQ B ) ◦ (P QP
- Page 162 and 163: 162so that we obtain:(190)We comput
- Page 164 and 165: 164(194)=) )(p QB ̂QA ◦(Qpb Q◦
- Page 166 and 167: 166= Ξ ◦ (A A U A λ) ◦ (xx A
- Page 168 and 169: 168)(155)= k 2 ◦(Qpb Q◦ (Ql A U
- Page 170 and 171: 170) ) (χ= ρ ◦(p QB ̂QA ◦(Qp
- Page 172 and 173: 172Theorem 8.13. Let A and B be cat
- Page 174 and 175: 174l = eC ρ L : L = − ⊗ B A
- Page 176 and 177: and[µBQ ◦ ( Qσ B)] (− ⊗ T x
- Page 178 and 179: 178so that− ⊗ R 1 A ⊗ R c = (
- Page 180 and 181: 180− ⊗ T x ⊗ R 1 A ⊗ A f
- Page 182 and 183: 182(208)(209)(210)(211)(h1 ) 0 ⊗
- Page 184 and 185: 184= abd 0 ⊗ d 1 1 ⊗ d 2 1b⊗d
- Page 186 and 187: 186so that h 1 ⊗ h 2 ⊗ a ∈ A
- Page 188 and 189: 188= 〈( h (1) y (1))εH ( h (2) y
- Page 190 and 191: 190H C is faithfully coflat. Assume
- Page 192 and 193: 192=(Qε C H C) ( ∑ )−□ C k i
7.5. Herd - Coherd - Herd.7.1<str<strong>on</strong>g>1.</str<strong>on</strong>g> Let τ : Q → QP Q be a herd for a regular formal dual structure M =(A, B, P, Q, σ A , σ B , ) where P : A → B, Q : B → A, A : A → A and B : B → Bare functors that preserve equalizers. Then, by Propositi<strong>on</strong>s 6.1 and 6.2, we canc<strong>on</strong>struct com<strong>on</strong>ads C = ( C, ∆ C , ε C) and D = ( D, ∆ D , ε D) and functorial morphismsC ρ Q : Q → CQ and ρ D Q : Q → QD such that (Q, C ρ Q , ρ D Q ) is a C-Dbicomodule) functor (see Theorem 6.5). Let Q as defined in Propositi<strong>on</strong> 7.<str<strong>on</strong>g>1.</str<strong>on</strong>g> Then(Q, D ρ Q , ρ C is a D-C-bicomodule functor. By Theorem 7.5, we c<strong>on</strong>struct a coherdQX = ( C, D, Q, Q, δ C , δ D , χ ) where χ := µ B Q ◦(A µ Q B ) ◦ ( AQσ B) ◦ ( σ A QP Q ) ◦(QP iQ)◦(QqQ). Then we can c<strong>on</strong>struct m<strong>on</strong>ads A ′ = (A ′ , m A ′, u A ′) and B ′ = (B ′ , m B ′, u B ′)following respectively Propositi<strong>on</strong> 6.25 and Propositi<strong>on</strong> 6.26 as the coequalizers QQC (χQ)◦(QQδC )QQ x′ A ′QQε C DQQ (Qχ)◦(δD QQ)SQ y′ B ′ε D QQThis means that the following holdm A ′ ◦ (x ′ x ′ ) = x ′ ◦ ( χQ ) and u A ′ ◦ ε C = x ′ ◦ δ C(163) m B ′ ◦ (y ′ y ′ ) = y ′ ◦ ( Qχ ) and u B ′ ◦ ε D = y ′ ◦ δ D .Notati<strong>on</strong> 7.1<str<strong>on</strong>g>2.</str<strong>on</strong>g> With notati<strong>on</strong>s of Theorem 6.5 and Propositi<strong>on</strong> 7.1, let h : Q → Pbe defined by settingh = B µ P ◦ ( σ B P ) ◦ (P i) ◦ q.The following theorem reformulates Theorem 3.5 in [BV] in our categorical setting.Theorem 7.13. Let M = (A, B, P, Q, σ A , σ B ) be a tame Morita c<strong>on</strong>text and letτ : Q → QP Q be a herd for M such that A and B reflect equalizers and coequalizers.We denote by A ′ and B ′ the m<strong>on</strong>ads c<strong>on</strong>structed in Claim 7.1<str<strong>on</strong>g>1.</str<strong>on</strong>g> Then1) There are functorial morphisms ν A : A ′ → A and ν B : B ′ → B such that ν Aand ν B are morphisms of m<strong>on</strong>ads.2) If the functorial morphism hQ : QQ → P Q, where h = B µ P ◦ ( σ B P ) ◦(P i)◦q,is an isomorphism, then ν A and ν B are isomorphisms.3) If P C = Q ≃ Q ′ = DP then hQ is an isomorphism and hence ν A and ν Bare isomorphisms of m<strong>on</strong>ads.Proof. Note that, since A and B reflect equalizers, by Lemma 6.10, we have aregular herd, i.e. the assumpti<strong>on</strong>s (A, u A ) = Equ Fun (u A A, Au A ) and (B, u B ) =Equ Fun (u B B, Bu B ) are fulfilled. We will prove <strong>on</strong>ly the statement for the m<strong>on</strong>adB ′ , for A ′ the proof is similar.1) C<strong>on</strong>sider the functorial morphismσ B : QQ → B145□