talk 1 3 restriction species
play

Talk 1.3: Restriction species Imma G alvez-Carrillo Universitat - PowerPoint PPT Presentation

Talk 1.3: Restriction species Imma G alvez-Carrillo Universitat Polit` ecnica de Catalunya 24/07/2017 Joint work with Joachim Kock (Universitat Aut` onoma de Barcelona) Andrew Tonks (University of Leicester) arXiv:1512.07573 , 1512.07577


  1. Talk 1.3: Restriction species Imma G´ alvez-Carrillo Universitat Polit` ecnica de Catalunya 24/07/2017 Joint work with Joachim Kock (Universitat Aut` onoma de Barcelona) Andrew Tonks (University of Leicester) arXiv:1512.07573 , 1512.07577 , 1512.07580 (to appear Adv Math), 1602.05082 (Proc Royal Soc Edinburgh, doi:10.1017/prm.2017.20) and 1707.????? Higher Structures Lisbon Deformation theory, Operads, Higher categories: developments & applications Instituto Superior T´ ecnico, Lisbon, 24-27 July 2017

  2. Categorifying linear algebra We work in a monoidal closed ∞ -category LIN objects are all slices S / I of the ∞ -category S of ∞ -groupoids, morphisms are linear functors S / I ��� S / J . A slice S / B should be thought of as a generalised ‘vector space with specified basis’: any X → B is a homotopy linear combination � B → S � b ∈ B � X b · (1 � b � � “ − − → B ) ” = X b ⊗ � b � := hocolim . b �→ X b b ∈ π 0 B Any f : B ′ → B gives adjoint functors between slice categories f ∗ f ! − → S / B , − → S / B ′ S / B ′ S / B defined by post-composition and homotopy pullback. Using these constructions, any span between I and J p q I ← − M − → J defines a so-called linear functor p ∗ q ! − → S / M − → S / J . S / I

  3. Composition is ‘matrix multiplication’: the Beck–Chevalley condition says the composite of linear functors defined by spans I ← M → J and J ← N → K is defined by the pullback span I ← P → K : K P N I M J The monoidal structure on LIN is defined on slices by S / I ⊗ S / J := S / I × J with S = S / 1 as unit, and the tensor product of two linear functors defined by spans I ← M → J and K ← N → L is the linear functor defined by the span I × K ← M × N → J × L , ( S / I ��� S / J ) ⊗ ( S / K ��� S / L ) = ( S / I × K ��� S / J × L )

  4. Cardinality of ∞ -groupoids and linear functors [Quinn (1995), Baez–Dolan (2001)] An ∞ -groupoid X is locally finite if ∀ x ∈ π 0 X the homotopy groups π i ( X , x ) are finite for i ≥ 1 and are eventually trivial. A locally finite ∞ -groupoid X is finite if π 0 X is finite. | π i ( X , x 0 ) | ( − 1) i ∈ Q � � The cardinality of X is then | X | = x 0 ∈ π 0 X i ≥ 1 � The cardinality of ( X → B ) ∈ S / B is the vector | X b | e b ∈ Q π 0 B b ∈ π 0 B That of a span S ← M → T is a matrix | M | : Q π 0 S → Q π 0 T The cardinality of a finite ∞ -groupoid is | π i ( X , x ) | ( − 1) i ∈ Q . � � | X | := x ∈ π 0 X i > 0 In particular, we have equivalence-invariant notions of finiteness and cardinality of ordinary groupoids 1 � | G | := | Aut G ( x ) | . x ∈ π 0 G

  5. ∞ -categorification of the notion of coalgebra A coalgebra in LIN is a slice S / I together with linear functors δ 0 δ 2 ⊗ 2 = S / I 2 (comultiplication) ��� S (counit) and S / I S / I ��� S / I 1 ⊗ δ 2 S ⊗ 3 that are counital: 1 ⊗ δ 0 S / I S ⊗ 2 S ⊗ 2 / I / I / I (1 ⊗ δ 0 ) δ 2 =1=( δ 0 ⊗ 1) δ 2 δ 2 1 δ 0 ⊗ 1 δ 2 δ 2 ⊗ 1 and coassociative: (1 ⊗ δ 2 ) δ 2 = ( δ 2 ⊗ 1) δ 2 S ⊗ 2 S ⊗ 2 S / I S / I / I / I δ 2 δ 2 Suppose the linear functors δ 0 and δ 2 are defined by the spans s m c → I 2 . I ← − − M − → 1 I ← − − N − − I 2 I 2 I 3 I × M I × N Then the counital and I the coassociative 1 properties can be written: M × I N I N × I N P 1 I 2 I N I 2 I N

  6. Recovering classical coalgebras s m c → I 2 satisfying the above Consider spans I ← − M → 1 , I ← − N − counit and coassociativity conditions and that restrict to linear functors on slices of the category s of finite ∞ -groupoids Theorem Taking cardinality of such a finite coalgebra in LIN defines a classical coalgebra structure on the vector space Q π 0 I s / I ⊗ 2 s / I s s / I Q π 0 I ⊗ 2 . Q π 0 I Q Q π 0 I

  7. Incidence coalgebras in LIN For any simplicial ∞ -groupoid X , the spans ( d 2 , d 0 ) X 1 × X 1 s 0 d 1 1 , X 1 X 0 X 1 X 2 define linear functors, termed counit and comultiplication δ 0 : S / X 1 ��� S / 1 , δ 2 : S / X 1 ��� S / ( X 1 × X 1 ) . We have seen that for coassociativity, for example, we need: d 1 d 2 X 1 X 2 X 1 × X 1 X 1 ( d 2 , d 0 ) d 1 d 1 d 1 d 1 × id d 1 d 2 d 3 X 2 X 3 X 2 × X 1 X 2 ( d 3 , d 0 d 0 ) ( d 2 ( d 2 , d 0 ) 2 , d 0 ) ( d 2 , d 0 ) × id X 1 × X 1 X 1 × X 2 id × ( d 2 , d 0 ) X 1 × X 1 × X 1 id × d 1 This is equivalent to a certain other set of squares being pullbacks.

  8. Definition (Decomposition space [G-K-T, arXiv:1404.3202 ]) A decomposition space is a simplicial ∞ -groupoid X : ∆ op → S sending certain pushouts in ∆ to pullbacks in S   f ′∗ f [ n ] [ m ] X p X q     = X g g ′ g ′∗ g ∗       [ q ] [ p ] X m X n . f ′ f ∗ The pushouts involved are those for which g , g ′ are generic (that is, end-point preserving) maps in ∆ , f , f ′ are free (that is, distance-preserving) maps in ∆ . This notion in fact coincides with that of unital 2-Segal space formulated independently by Dyckerhoff and Kapranov, see arXiv:1212.3563, arXiv:1306.2545, arXiv:1403.5799 .

  9. Free maps are composites of outer coface maps ∂ ⊥ = ∂ 0 , ∂ ⊤ = ∂ n , generic maps are composites of inner coface & codegeneracy maps. [2] { 0 , 1 , 2 } [4] { 0 , 1 , 2 , 3 , 4 } g f [5] { 0 , 1 , 2 , 3 , 4 , 5 } [5] { 0 , 1 , 2 , 3 , 4 , 5 } There is a monoidal structure (on the generic subcategory) [ n ] ∨ [ m ] = [ n + m ] . Free maps in ∆ are the ‘obvious’ inclusions [ n ] ֌ [ a ] ∨ [ n ] ∨ [ b ]. Lemma Generic and free maps in ∆ admit pushouts along each other, and the results are again generic and free. f [ n ] [ a ] ∨ [ n ] ∨ [ b ] = [ a + n + b ] g id ∨ g ∨ id f ′ [ q ] [ a ] ∨ [ q ] ∨ [ b ] = [ a + q + b ] These are the pushouts that any decomposition space X : ∆ op → S is required to send to pullbacks of ∞ -groupoids.

  10. Simplicial category ∆ v augmented simplicial category ∆ The objects of ∆ are denoted [ n ] := { 0 , 1 , . . . , n } , n ≥ 0 . The monotone maps are generated by s k : [ n +1] → [ n ] that repeats the element k ∈ [ n ], d k : [ n ] → [ n +1] that skips the element k ∈ [ n +1]. The objects of ∆ are denoted n := { 1 , . . . , n } , n ≥ 0 . The monotone maps are generated by s k : n +1 → n that repeats the element k + 1 ∈ n , (0 ≤ k ≤ n − 1), d k : n → n +1 that skips the element k + 1 ∈ n +1, (0 ≤ k ≤ n ). There is a canonical contravariant isomorphism of categories between the generic subcategory of ∆ and the augmented simplicial category. ∼ ∆ genop [Joyal–Stone duality] = ∆ s k : [ n +1] → [ n ] the degeneracy map d k : corresponds to → n +1 n an inner coface map d k +1 : [ n ] → [ n +1] s k corresponds to : n +1 → n Picture: a map [5] ← [4] in ∆ gen and 5 → 4 in ∆ :

  11. Conservative and ULF maps A simplicial map F : Y → X is called cartesian on a generic map g : [ m ] → � [ n ] in ∆ if the naturality square g ∗ Y m Y n F m F n X m X n g ∗ is a pullback. conservative if F is cartesian on all codegeneracy maps σ i n of ∆ , ULF if F is cartesian on generic coface maps ∂ i n , i � = 0 , n , of ∆ , cULF (that is, conservative with Unique Lifting of Factorisations) if it is cartesian on all generic maps of ∆ . Such maps behave well on decomposition spaces. For example: Lemma If F is cULF and X is a decomposition space then so is Y .

  12. The incidence coalgebra of a decomposition space Let X be a decomposition space. For n ≥ 0 there is a linear functor δ n : S / X 1 ��� S / X 1 ⊗ · · · ⊗ S / X 1 termed the n th comultiplication map, defined by the span X 1 ← − X n − → X 1 × · · · × X 1 δ 0 is the counit, and δ 1 is the identity. Theorem (Coherent coassociativity) Any linear functor S / X 1 ��� S / X 1 ⊗ · · · ⊗ S / X 1 given by composites of tensors of comultiplication maps is again a comultiplication map. In particular, (1 ⊗ δ 0 ) δ 2 =1=( δ 0 ⊗ 1) δ 2 , (1 ⊗ δ 2 ) δ 2 = δ 3 =( δ 2 ⊗ 1) δ 2 so C ( X ) := S / X 1 is a (counital, coassociative) coalgebra in LIN.

  13. Functoriality for cULF maps of decomposition spaces Recall that a map F : X → X ′ of simplicial groupoids is said to be conservative and ULF (cULF) if it is cartesian on generic maps. δ n g f X n S ⊗ n X 1 X n S / X 1 S / X n g ∗ 1 / X 1 f ! F n F 1! ⊗ n F 1 F n F 1! F n ! 1 g ′ ∗ f ′ ! n S ⊗ n X ′ X ′ X ′ S / X ′ S / X ′ 1 n 1 / X ′ g ′ f ′ n 1 1 δ ′ n Thus any cULF map F : X → X ′ between decomposition spaces induces a homomorphism of coalgebras F 1! : C ( X ) → C ( X ′ ), since F 1! : S / X 1 → S / X ′ 1 commutes with comultiplication maps.

  14. Decalage Recall that the augmented functors Dec ⊥ and Dec ⊤ forget the bottom and top face and degeneracy maps respectively. d 2 d 3 s 2 d 1 s 1 d 2 X X 0 X 1 X 2 X 3 s 0 s 1 ··· d 1 s 0 d 1 s 0 d 0 d 0 d 0 d ⊥ d 0 d 0 d 0 d 0 d 3 d 4 s 3 d 2 s 2 Dec ⊥ X d 3 X 1 X 2 X 3 X 4 s 1 s 2 ··· d 2 s 1 d 2 s 1 d 1 d 1 d 1 Lemma A simplicial ∞ -groupoid X : ∆ op → S is a decomposition space if and only if both Dec ⊤ ( X ) and Dec ⊥ ( X ) are Segal spaces, and the two comparison maps are cULF: d ⊤ : Dec ⊤ ( X ) → X d ⊥ : Dec ⊥ ( X ) → X

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend