Peng Zhou

stream of notes

User Tools

Site Tools


blog:2025-01-01

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Next revision
Previous revision
blog:2025-01-01 [2025/01/01 08:18] – created pzhoublog:2025-01-01 [2025/01/02 07:23] (current) pzhou
Line 6: Line 6:
  
 ===== CK's construction ===== ===== CK's construction =====
 +I am reading their old paper, almost 20 years old, https://arxiv.org/pdf/math/0701194
 +
 +First they give a quick review of the Reshtikhin-Turaev theory,  that assigns to tangle TT a linear map ψT:VnVm\psi_T: V^{\otimes n} \to V^{\otimes m}.
 +
 +Then they say what a weak categorification is, which is a graded dg category, that assigns to a tangle TT some functor ΨT:DnDm\Psi_T: D_n \to D_m, (why they say this only upto isomorphism?)
 +
 +Bernstein-I.Frenkel-Khovanov conjectured a weak categorification, and proved by Stroppel. Here DnD_n is some direct sum of categories associated to category OO for glngl_n. Khovanov's DnD_n is as graded module over graded algebra, combinatorial approach.
 +
 +In this paper, CK uses Dn=D(Yn)D_n = D(Y_n). They also construct, from a tangle TT, a functor Ψ(T)\Psi(T), by composing the elementary functors: merging FniF_n^i, splitting GniG_n^i, and braiding TT. Here merge and split between YnY_n and Yn2Y_{n-2} are realized by a correspondence XniX_n^i
 +
 +What is the space YnY_n? First, we fix an (N,N)(N, N) nilpotent element zEnd(C2N)z \in End(\C^{2N}). (From this data, we can build an NN-step flag, by taking kernel of zkz^k. Hold that thought.) Then, we build a 'weed', L1L2LnL_1 \In L_2 \cdots \In L_n, where dimLi=i\dim L_i=i inside CN\C^N. Such that zLiLi1z L_i \In L_{i-1}
 +
 +
 +Let's think a bit. Can we take the limit NN goes to \infty? Yes, say, the polynomial ring C[x]\C[x] as a vector space is the limit of $\C[x]/(x^N).Here,wecansay,rank. Here, we can say, rank 2vectorbundleoveranartindisk vector bundle over an artin disk Spec \C[x]/(x^N).But,whatarethose. But, what are those L_i?Wecanstartbythinkingabout? We can start by thinking about L_1,weneed, we need z L_1=0,sothatmeans, so that means L_1needstobein needs to be in ker(z).Iwouldliketosay. I would like to say z = \d_x,sothat, so that L_1$ is some 'flat' section. OK. What is L2L_2? We can parametrize L2L_2 by saying, choose a generator e1(x)e_1(x) for L1L_1, such that xe1(x)=0\d_x e_1(x)=0, then choose a section e2e_2, so that xe2=e1\d_x e_2 = e_1, then L2L_2 is generated by e1,e2e_1, e_2. L3L_3, we want something e3e_3, such that xe3=e2\d_x e_3 = e_2. No, this is not what it should be. 
 +
 +
 +There are two models for infinite dimensional vector space where an operator acts locally nilpotently, one is x\d_x on C[x]\C[x], another is zz\cdot on C[z,1/z]/C[z]\C[z,1/z] / \C[z]. One can certainly take bundles over this. The second one seems more amicable. 
 +
 +Question: if zz is an nilpotent endomorphism of VV, and WVW \In V is a subspace invariant under zz, how do I know how large is ker(z:V/WV/W)ker(z: V/W \to V/W)? OK, not sure. 
 +
 +
 +In our case, for a generic element in YnY_n, an generic element in LiL_i takes ii step to die under action by zz. I want to believe that, LiL_i is just a lattice, no better and no worse than any other lattices in $\C[t,t^{-1}]^2.Thisshouldbethebestdescription.Ifthatisthecase,then. This should be the best description. If that is the case, then Y_nisaniterated is an iterated \P^1$-bundle. Let's see if that is true. 
 +
 +Yes, that is true, see http://arxiv.org/abs/0710.3216v2 their second paper on sl(m)sl(m) case. 
 +
 +So why did Cautis-Kamnitzer only deal with sl(m)sl(m)? What's so hard about general case?
 +
 +
 +
 +
  
  
  
  
blog/2025-01-01.1735719527.txt.gz · Last modified: 2025/01/01 08:18 by pzhou