scratch

§ Scones

created 2022-10-27 · last edited 2022-11-02
  • take CCC a category. There is a global sections functor Γ:C−>Set\Gamma: C -> SetΓ:C−>Set given by Hom(1,−)Hom(1, -)Hom(1,−).
  • take the pullback C→ΓSet←codSet→C \xrightarrow{\Gamma} Set \xleftarrow{cod} Set^{\to}CΓ​Setcod​Set→.
  • From any type theory TTT, we build syn(T)syn(T)syn(T), where objects are the types, and morphisms are terms with free variables. (ie, A→BA \to BA→B is a term of type BBB involving a free variable of type AAA)
  • whatever structure TTT had will be visible in syn(T)syn(T)syn(T). eg: if TTT has products, then syn(T)syn(T)syn(T) will have products. moreover, syn(T)syn(T)syn(T) will be the initial such category. For any other CCC with the appropriate structure, there will a functor syn(T)→Csyn(T) \to Csyn(T)→C.
  • To use this to prove properties of TTT, we'll need to cook up a special CCC, so that syn(T)→Csyn(T) \to Csyn(T)→C can tell us something. Further, this CCC must somehow depend on TTT to explore properties of TTT, so let's call it C(T)C(T)C(T).
  • We must use the uniqueness of the morphism syn(T)syn(T)syn(T) to C(T)C(T)C(T) (ie, the initiality of syn(T)syn(T)syn(T)), because that's what makes this thing universal.
  • An introduction to fibrations, topos theory, the effective topos and modest sets
  • Scones, logical relations, parametricity
❦
Newer ৪ Blog ৪ Older