Not signed in (Sign In)

Not signed in

Want to take part in these discussions? Sign in if you have an account, or apply for one below

  • Sign in using OpenID

Site Tag Cloud

2-category 2-category-theory abelian-categories adjoint algebra algebraic algebraic-geometry algebraic-topology analysis analytic-geometry arithmetic arithmetic-geometry book bundles calculus categorical categories category category-theory chern-weil-theory cohesion cohesive-homotopy-type-theory cohomology colimits combinatorics complex complex-geometry computable-mathematics computer-science constructive cosmology definitions deformation-theory descent diagrams differential differential-cohomology differential-equations differential-geometry digraphs duality elliptic-cohomology enriched fibration foundation foundations functional-analysis functor gauge-theory gebra geometric-quantization geometry graph graphs gravity grothendieck group group-theory harmonic-analysis higher higher-algebra higher-category-theory higher-differential-geometry higher-geometry higher-lie-theory higher-topos-theory homological homological-algebra homotopy homotopy-theory homotopy-type-theory index-theory integration integration-theory k-theory lie-theory limits linear linear-algebra locale localization logic mathematics measure-theory modal modal-logic model model-category-theory monad monads monoidal monoidal-category-theory morphism motives motivic-cohomology nforum nlab noncommutative noncommutative-geometry number-theory of operads operator operator-algebra order-theory pages pasting philosophy physics pro-object probability probability-theory quantization quantum quantum-field quantum-field-theory quantum-mechanics quantum-physics quantum-theory question representation representation-theory riemannian-geometry scheme schemes set set-theory sheaf simplicial space spin-geometry stable-homotopy-theory stack string string-theory superalgebra supergeometry svg symplectic-geometry synthetic-differential-geometry terminology theory topology topos topos-theory tqft type type-theory universal variational-calculus

Vanilla 1.1.10 is a product of Lussumo. More Information: Documentation, Community Support.

Welcome to nForum
If you want to take part in these discussions either sign in now (if you have an account), apply for one now (if you don't).
    • CommentRowNumber1.
    • CommentAuthorDavid_Corfield
    • CommentTimeMar 11th 2017

    I see that from 15 March Dropbox is no longer going to allow a publicly accessible folder. So I was thinking of uploading some files to my personal web here, but when trying to edit the max size of file, realized I don’t have the system password. Is there one for each personal web, or a master one?

    • CommentRowNumber2.
    • CommentAuthorMike Shulman
    • CommentTimeMar 11th 2017

    There’s a master one. I knew it at one point, but I’m not sure whether I still do.

    A bit of googling suggests that maybe you can still create “public links” to individual files in dropbox folders? https://www.dropbox.com/help/167

    • CommentRowNumber3.
    • CommentAuthorDavid_Corfield
    • CommentTimeMar 11th 2017

    I see, thanks. Well if the address of the public link changes to my ’Expressing the Structure’ paper, which you kindly cite in your latest paper, I’ll let you know.

    • CommentRowNumber4.
    • CommentAuthorMike Shulman
    • CommentTimeMar 11th 2017

    If you want a more stable URL for me to cite, you could make a wikipage for the paper on your personal web that contains a link to wherever the current PDF is.

    • CommentRowNumber5.
    • CommentAuthorDavid_Corfield
    • CommentTimeMar 13th 2017

    Good idea. So here is such a wikipage link: https://ncatlab.org/davidcorfield/show/Expressing+%27The+Structure+of%27+in+Homotopy+Type+Theory

    By the way, I posted a comment at the Cafe about your article.

    A couple of very minor things:

    and also more novel synthetic mathematics using of nonclassical structure I’m struggling with the grammar.

    The reference [102] … Cambridge, 2015, still not out yet. Hopefully this year.

    • CommentRowNumber6.
    • CommentAuthorUrs
    • CommentTimeMar 13th 2017

    David,

    sorry for the slow reaction. I have increased the upload size maximum on your web. Please check if it works now.

    • CommentRowNumber7.
    • CommentAuthorTobyBartels
    • CommentTimeMar 13th 2017
    • CommentRowNumber8.
    • CommentAuthorDavid_Corfield
    • CommentTimeMar 13th 2017

    Great thanks, uploads are working now.

    • CommentRowNumber9.
    • CommentAuthorNikolajK
    • CommentTimeMar 13th 2017
    • (edited Mar 13th 2017)

    @David: There’s a :: before the \equiv on page 6 and later there isn’t one. Is that right?

    In any case, if people don’t know how the binding order of all those symbols go, I’d put that whole expression in brackets,

    X:T(F(X)E(X)):TX:T \vdash (F(X)\equiv E(X)):T

    or write it in two lines

    F(X)E(X)F(X)\equiv E(X)

    X:TF(X):TX:T \vdash F(X):T

    • CommentRowNumber10.
    • CommentAuthorDavid_Corfield
    • CommentTimeMar 13th 2017

    Thanks, Nikolaj.

    :: \equiv is meant to signal a definition, as in the HoTT book, but now I look I see they never seem to use the symbol to the right of a \vdash. Is that just for clarity?

    • CommentRowNumber11.
    • CommentAuthorMike Shulman
    • CommentTimeMar 14th 2017

    Thanks for the fixes David.

    The HoTT book mostly doesn’t use \vdash at all, only in the appendix. But even when being more formal, I don’t think I would normally use the “being defined to equal” symbol ::\equiv in that way, since it’s not a judgment. Unless we’re working in a type theory that has an internal notion of “definition” (which of course real-world systems like Coq and Agda do, but mathematical type theories don’t usually), defining something to equal something else is a meta-theoretic shorthand rather than part of the formal system. I suppose one could say that it takes place in a context, though.

    • CommentRowNumber12.
    • CommentAuthorDavid_Corfield
    • CommentTimeMar 14th 2017
    • (edited Mar 14th 2017)

    The final ’it’ refers to defining something to equal something else? How then would you write such a definition if it takes place in a context? Perhaps verbally, e.g.,

    Relative to context Γ\Gamma, we define F(x,y,z):...F(x,y,z) :\equiv ...,

    where x,y,zx, y, z all appear as free variable in Γ\Gamma.

    • CommentRowNumber13.
    • CommentAuthorMike Shulman
    • CommentTimeMar 14th 2017

    In ordinary mathematics, which the book strives to emulate, we don’t usually feel the need to mention contexts at all. If there is something currently in the context, then when we define something, it’s obviously relative to that, and we might or might not notate it depending on whether the dependence matters. Ordinary mathematics also blurs the line between hypothetical judgments x:Af x:Bx:A \vdash f_x:B and functions f:AB\cdot \vdash f:A\to B, so any time we define something in a context we might as well be just defining a function in the empty context.

    • CommentRowNumber14.
    • CommentAuthorDavid_Corfield
    • CommentTimeMar 14th 2017
    • (edited Mar 14th 2017)

    Hmm, so the: z:( X:TypeisContr(X))(π 1(z))\vdash the: \prod_{z: (\sum_{X: Type} isContr(X))} (\pi_1(z))? And theπ 1(π 2)the \equiv \pi_1(\pi_2).

    • CommentRowNumber15.
    • CommentAuthorMike Shulman
    • CommentTimeMar 14th 2017

    I suppose.