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 ...
182(208)(209)(210)(211)(h1 ) 0 ⊗ h2 ⊗ ( h 1) 1= (h 2 ) 1 ⊗ (h 2 ) 2 ⊗ S (h 1 )h 1 h 2 = ε H (h) 1 A(hl) 1 ⊗ (hl) 2 = l 1 h 1 ⊗ h 2 l 2a 0 (a 1 ) 1 ⊗ (a 1 ) 2 = 1 A ⊗ a.9.5. The Schauenburg situation is the particular case when T = A co(H) = k. Hencewe haveA = Mod-k,B = Mod-k where T = End eC (Σ) = A co(H) = k.A = − ⊗ k A : A = Mod-k −→ A = Mod-kC = − ⊗ k H : A = Mod-k −→ A = Mod-kB = − ⊗ k A = A : B = Mod-k −→ B = Mod-k where A = Hom A (A A , A A )Ψ = − ⊗ k ψ : AC = − ⊗ k H ⊗ k A −→ CA = − ⊗ k A ⊗ k H(ψ : H ⊗ k A → A ⊗ k H, h ⊗ k a ↦→ can C can−1C (1 A ⊗ k h) a )L = − ⊗ k A : Mod-k −→ Mod-A ∼ = A AW = Hom A (A, −) : Mod-A −→ Mod-k˜C = − ⊗ A A ⊗ k H ∼ = ⊗ k H : Mod-A −→ Mod-Al = eC ρ L : L = − ⊗ k A −→ ˜CL = − ⊗ k A ⊗ A A ⊗ k H ∼ = − ⊗ k A ⊗ k HLet us assume thatThen,k = commutative ringH = Hopf algebraA/k = faithfully flat H-Galois extension with ρ H A : A → A ⊗ HA co(H) = k1 Acan : A ⊗ A → A ⊗ H defined by setting can (a ⊗ b) = ab 0 ⊗ b 1γ : H → A ⊗ A defined by setting γ (h) := can −1 (1 A ⊗ h) = h 1 ⊗ h 2τ : A → A ⊗ A ⊗ Aa ↦→ a 0 ⊗ γ (a 1 ) = a 0 ⊗ a 1 1 ⊗ a 2 1is a pretorsor. We want to construct the comonads C and D as in Theorem 6.5where A = B = Mod-k and P = Q = − ⊗ A. First, let us consider ω l = − ⊗ k ̂ωland ω r = − ⊗ k ̂ω r : − ⊗ A ⊗ A → − ⊗ A ⊗ A ⊗ A wherêω l = ( σ A ⊗ A ⊗ A ) ◦ (A ⊗ τ) : A ⊗ A → A ⊗ A ⊗ Âω l (a ⊗ b) = ab 0 ⊗ b 1 1 ⊗ b 2 1̂ω r = (u A ⊗ A ⊗ A) : A ⊗ A → A ⊗ A ⊗ Âω r (a ⊗ b) = 1 A ⊗ a ⊗ b.
Let ω = ω l −ω r and ̂ω = ̂ω l −̂ω r . First of all we want to prove that for any k-moduleX we haveKer (ωX) = Ker (X ⊗ ̂ω) = X ⊗ Ker (̂ω) .Since A is faithfully flat over k we equivalently prove thatNote thatA ⊗ Ker (̂ω)Ker (X ⊗ ̂ω ⊗ A) = X ⊗ Ker (̂ω) ⊗ A. A ⊗ A ⊗ AA⊗ b ω lA⊗c ω r A ⊗ A ⊗ A ⊗ Awith respect to the map m A ⊗ A ⊗ A is a contractible equalizer so that alsoKer (̂ω) A ⊗ Abω lcω r A ⊗ A ⊗ Ais a contractible equalizer (see the dual case of [BW, Proposition 3.4 (c)]). Hence,by Proposition
- 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 144 and 145: 144(◦ ρ D ̂QQ)Q◦ (QlQ) ◦ (Q
- 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 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
- Page 194 and 195: 194Following Theorem 6.29, we now c
- Page 196 and 197: 196)û E(ε C H C (h) = û E (π (h
- Page 198 and 199: 198Letandα l = (ϕ ⊗ H) ( (x ⊗
- Page 200 and 201: 200This map is well-defined, in fac
- Page 202 and 203: 202We now have to prove that this m
- Page 204 and 205: 2041) − ⊗ B Σ A preserves the
- Page 206 and 207: 206functorial isomorphism. In parti
- Page 208 and 209: 208coaction ρ C Σ : Σ → Σ ⊗
- Page 210 and 211: 210Now, we consider a particular ca
- Page 212 and 213: 212Definition 9.27. Let k be a comm
- Page 214 and 215: 214∆coass= a ⊗ c (1) ⊗ A 1 A
- Page 216 and 217: 216Definition 9.32.</strong
- Page 218 and 219: 218Let us compute, for every d ∈
- Page 220 and 221: 220• 2-cells: monad functor trans
- Page 222 and 223: 222We now want to prove that ρ Q·
- Page 224 and 225: 224Proof. Let us consider the follo
- Page 226 and 227: 226and since p Q•B Q ′ ,Q ′
- Page 228 and 229: 228(241)= (1 Q • B l Q ′) ζ Q,
- Page 230 and 231: 230On the other hand, we can first
Let ω = ω l −ω r and ̂ω = ̂ω l −̂ω r . First of all we want to prove that for any k-moduleX we haveKer (ωX) = Ker (X ⊗ ̂ω) = X ⊗ Ker (̂ω) .Since A is faithfully flat over k we equivalently prove thatNote thatA ⊗ Ker (̂ω)Ker (X ⊗ ̂ω ⊗ A) = X ⊗ Ker (̂ω) ⊗ A. A ⊗ A ⊗ AA⊗ b ω lA⊗c ω r A ⊗ A ⊗ A ⊗ Awith respect to the map m A ⊗ A ⊗ A is a c<strong>on</strong>tractible equalizer so that alsoKer (̂ω) A ⊗ Abω lcω r A ⊗ A ⊗ Ais a c<strong>on</strong>tractible equalizer (see the dual case of [BW, Propositi<strong>on</strong> 3.4 (c)]). Hence,by Propositi<strong>on</strong> <str<strong>on</strong>g>2.</str<strong>on</strong>g>20, ( it is preserved by any functor. Since(C, i) = Equ Fun ω l = − ⊗ ̂ω) l , ω r = − ⊗ ̂ω r we have that C = − ⊗ Ĉ where{∑Ĉ = a i ⊗ b i | ∑ ( ) ( aib i) ⊗ ( b i) 1⊗ ( b i) 2= 1 0 1 1 A ⊗ ∑ }a i ⊗ b i .Note that γ is a fork for ̂ω l and ̂ω r , in fact( ̂ωl ◦ γ)(h) = ̂ω ( l h 1 ⊗ h 2) = h 1 h 2 0 ⊗ ( )h 2 1 ( )1 ⊗ h2 2 (206)1 = 1 A ⊗ h 1 ⊗ h 2and(̂ω r ◦ γ ) (h) = ̂ω ( r h 1 ⊗ h 2) = 1 A ⊗ h 1 ⊗ h 2 .) ( )Since(Ĉ, î = Equ ̂ωl , ̂ω r , by the universal property of the equalizer, there existsa unique functorial morphism ϕ : H → Ĉ such that î ◦ ϕ = γ. In our case thismeans that Imγ ⊆ C and henceϕ : H → Ĉh ↦→ h 1 ⊗ h 2 .We want to prove that ϕ is an isomorphism. We computeLet us setand let us computeand[(A ⊗ ϕ) ◦ can] (a ⊗ b) = (A ⊗ ϕ) (ab 0 ⊗ b 1 ) = ab 0 ⊗ b 1 1 ⊗ b 2 <str<strong>on</strong>g>1.</str<strong>on</strong>g>ψ : A ⊗ C → A ⊗ Aa ⊗ b ⊗ d ↦→ ab ⊗ d[ψ ◦ (A ⊗ ϕ) ◦ can] (a ⊗ b) = ψ ( ab 0 ⊗ b 1 1 ⊗ b 2 1)= ab0 b 1 1 ⊗ b 2 1[(A ⊗ ϕ) ◦ can ◦ ψ] (a ⊗ b ⊗ d) = [(A ⊗ ϕ) ◦ can] (ab ⊗ d)(211)= a ⊗ b183