Giter VIP home page Giter VIP logo

coq-hott's People

Contributors

abooij avatar alizter avatar amahboubi avatar andreaslyn avatar andrejbauer avatar artagnon avatar awodey avatar benediktahrens avatar co-dan avatar cohencyril avatar dangrayson avatar ejgallego avatar ezyang avatar jarlg avatar jasongross avatar jdchristensen avatar jledent avatar kevinquirin avatar kristinas avatar langston-barrett avatar marcbezem avatar mattam82 avatar maximedenes avatar mikeshulman avatar peterlefanulumsdaine avatar ppedrot avatar proux01 avatar simonboulier avatar skyskimmer avatar spitters avatar

Stargazers

 avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar

Watchers

 avatar  avatar  avatar  avatar

coq-hott's Issues

Limits and colimits

The Limits and Colimits directories should be generalizable from Type to arbitrary wild categories.

Opposite wild (oo,oo)-cats

For ooCat.v, similar to how Laxity is defined, we could have a stream of op's. This would then allow us to consider all opping at once.

Generalising DComma to sections of categories

It is mentioned in ooCat.v that DComma could possible be generalised to act on sections of displayed categories. This could then be used to define what a transfor is in general. I tried messing around with defining such a thing on paper but couldn't get it to work. What do we have in mind here?

Separated modalities

I've finished the proof of CORS 2.26 (which was needed for my general-modalities version of the LES), but am having universe problems. Right now I think that my initial attempt at defining separated modalities with a simple typeclass relating two modalities was too naive, because the resulting relation refers only to types in one universe, whereas it ought to apply to types in any universe. I guess that means it has to be a module type (unless we want to depend on the join construction, the way CORS does, or restrict to accessible modalities).

On the plus side, I finally hacked through the universes in O_ind_from_inO_sigma and realized that ReflectiveSubuniverses_to_Modalities can actually instantiate Modalities after all.

hfiber categories

So the hfiber of a X-coherent Y-functor should probably be itself a X-coherent Y-category. I'm not sure how this relates to notions of Grothendieck fibration,

The category of Prespectra as an inserter

I'll make note of this here in case I forget about it. We can construct the wild category of prespectra as a comma category of a functor F : (forall n:N, pType) -> (forall n:N, pType) where N is a successor structure and the identity functor. N ends up inducing an endofunctor on (forall n:N, pType) which takes (fun n => P n) and gives (fun n => P n.+1). F is then defined to take (fun n => P n) and give (fun n => loops (P n.+1)).

I wonder if there is a comma category like construction for equivalences instead of maps. Then it seems that spectra would be constructed this way. I also wonder what the relation with comma categories and comma categories with equivalences is. Are there other analogues of spectrification from this?

Make `pi_functor` definitionally equal to the expected pointed map

I just added the following lemma to the library:

Lemma pmap_pi_functor {X Y : pType} (f : X ->* Y) (n : nat) 
  : pi_functor_type_pmap (pi_functor (S n) f) ==* 
  ptr_functor 0 (iterated_loops_functor (S n) f).
Proof.
  srapply Build_pHomotopy. 1: reflexivity. apply path_ishprop.
Defined

Is it possible to redefine pi_functor so that these maps become definitionally equal? This would also ensure that the underlying maps of Pi_les are definitionally equal to the expected maps, e.g. that les_fn (Pi_les i f) (S n, 1) $== pi_functor (S n) i is true by reflexivity.

Make a PR to the main library including WildCat/Square

Every time I switch from the wildcat branch to the master branch, the leftover compiled WildCat/Square.vo gets mistakenly imported by Cubical/DSquare until I delete it. Let's at least merge a change that will stop that from happening.

First we'll have to merge master back into wildcat, which will require a bit of manual work.

Define adjunctions

There are a lot of choices as to how to go about that, each of which has different possible amounts of coherence:

  • Equivalences of hom-functors
  • Unit and counit with triangle identities
  • Comma categories and universal arrows

To what extent are they equivalent? Which one(s) should we use?

Reflective subcategories

As Egbert pointed out, a lot of the theory of reflective subuniverses should generalize. But we couldn't get the theory of reflective subuniverses itself as a special case, unless we did away with the modules there.

IsGraph?

Consider defining IsGraph (or maybe Is0Coh0Cat?) to have a Hom but no identities or composition yet. A 0-coherent 1-functor, and a 1-natural transformation, can be defined between these alone, and we use such things when talking about diagrams and (co)limits over graphs (#27).

Equivalences in ooCat.v

I am opening this issue as a discussion about the notions of equivalences in ooCat.v

It occurred to me earlier that if an ooCat has a terminal object and "pullbacks" (whatever that means), we could define a notion of "homotopy fiber". Then we could ask if a map's fibers are terminal in the category, which I think corresponds to equivalences by contractible fibers. This might be a more coherent notion of equivalence, at least for categories with hfibers.

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    ๐Ÿ–– Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. ๐Ÿ“Š๐Ÿ“ˆ๐ŸŽ‰

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google โค๏ธ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.