Not signed in (Sign In)

Start a new discussion

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 beauty bundles calculus categorical categories category category-theory chern-weil-theory cohesion cohesive-homotopy-theory cohesive-homotopy-type-theory cohomology colimits combinatorics complex complex-geometry computable-mathematics computer-science constructive cosmology deformation-theory descent diagrams differential differential-cohomology differential-equations differential-geometry digraphs duality elliptic-cohomology enriched fibration foundation foundations functional-analysis functor galois-theory 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 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 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 sheaves simplicial space spin-geometry stable-homotopy-theory string string-theory superalgebra supergeometry svg symplectic-geometry synthetic-differential-geometry terminology theory topology topos topos-theory 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).

nLab > Latest Changes

Show all

9781 to 9840 of 11564

  1. <
  2. 1
  3. ...
  4. 160
  5. 161
  6. 162
  7. 163
  8. 164
  9. 165
  10. 166
  11. 167
  12. ...
  13. 193
  14. >

    • When making inhabitant redirect to term a few minutes back I also found the entry term to be in an unfortunate state. I tried to improve it a bit by giving it more of an Idea section, and at least a vague indication of the formal definition.

    • at implication there is currently the statement

      q→r⊢(p→q)→(q→r) q \to r \vdash (p \to q) \to (q \to r) ,

      That’s a typo, right?

    • I hope to be adding bits and pieces to an article real coalgebra, which I’ve started. (In some sense it might fit better on my web, but for some reason I’m placing it on the main nLab.)

    • I ended up spending some time with expanding extension of scalars. Towards the end I had more plans, but I’ll stop now, need to do something else.

    • created four lemma (should still state the dual version, will do so later)

    • I have added some links to preprint on the entry Lascar group. I do not understand the model theory, but its link with Galois theory may be of use to someone looking at model theory and type theory elsewhere on the Lab, so I hope it is useful.

    • I keep feeling the need to point to an entry named formal logic. None of the existing entries seems to quite deserve to be where this link should be redirecting to. So I created a page formal logic with just some pointers to pages that the reader might expect behind this term.

      Just so that I can use that link for the time being.

    • creatd connecting homomorphism with (just) the pedestrian description.

      (Relation to snake lemma and more generally to fiber sequences not there yet…)

    • As I said in another thread, I would like to see the nnLab entries related to universes be somehow better, more organized, more comprehensive.

      In order to get a handle on it I decided, as so often, to tabulate what we have and what we should have, so I am creating:

      universe - contents

      and will include it as a “floating table of contents” into the relevant entries

    • at inductive reasoning it says

      Induction here is not to be confused with mathematical induction.

      We should point out that, however, there is a close relation:

      one can see this still in the German tem for, “induction over the natural numbers” which is not Induktion, but vollständige Induktion: meaning ” complete induction” !

      I guess the reasoning is clear, mathematical induction (at least that over the natural numbers) is a special case of inductive reasoning, namely that where we can be sure that we are inducing from a complete set of instances of the general rule.

      Does anyone feel like touching the entry accordingly to clarify this?

    • turns out plenty of entries were asking for quotient group. I created something. But am running a bit out of steam for tonight.

    • I have touched cokernel, briefly adding some basics. More needs to be done here.

    • After discussion here I have changed the organization of the entry structure and then expanded a bit by adding an Idea-section and a bit more here and there.

      (The previous organization of the entry instead made it look like structure in model theory is a concept on par with that discussed at stuff, structure, property. But instead, the latter axiomatizes the general notion of “structure on something” as such, whereas the former is an example of a structure on something (namely an “LL-structure on a set”). The new version aims to reflect this properly.)

    • Using the LaTeX macro package TikZ, I’ve redrawn most of the SVGs on the knots and links pages. I hope that I haven’t trodden on any toes in so doing! I may have missed a few diagrams as well.

      I’ve shifted the actual SVGs to pages of their own. This makes it easier to edit the pages with them on - TikZ’s SVG export isn’t as compact as the inbuilt SVG editor - and easier to include on other pages. For example, I can imagine that the trefoil knot is going to appear again and again!

      (Incidentally, are the two trefoils distinct? If so, which have I drawn at trefoil knot - SVG).

      I’ve named the pages with - SVG in their name, though for the moment I’ve also put in redirects to the name without the SVG. When actually including the diagram, one should always use the canonical name (ie with the - SVG) since it may be that we actually write a page about the trefoil knot one day. But I thought that for the moment, a nice aspect of hyperlinks is that if we mention the trefoil knot in a page then we can put in a link to an actual picture.

      Diagrams done so far:

      Pages with includes include: link, Reidemeister move, colorability, bridge number.

      What would be fantastic here is if the “source” link took one to the actual LaTeX/TikZ source! I do intend to put that up on the nLab, but I need to clean it up a little as it depends on some customised style files that have a lot of crud in them.

    • I have been attacking some of the grey links in knot theory and the related pages. If someone has the time (and the patience) adding a few more links would be a good thing. I have added Crowell, Fox, Dehn, Alexander, Louis Kauffman, plus some non-people pages such as Alexander polynomial. That needs some diagrams if it is to do what it ’should’ and my svg skills are too slight to attempt that today. :-)

    • I added to the “abstract nonsense” section in free monoid a helpful general observation on how to construct free monoids. “Adjoint functor theorem” is overkill for free monoids over SetSet.

    • [ forwarding old discussion that used to be at context ]

      The following discussion was initiated by a previous version of the above entry which referred to “cartesian multicategories” rather than finitely complete categories.

      +–{: .query} Mike: What is a cartesian multicategory, and how do I interpret the theory of groups in one? I can guess what it would mean for a multicategory to have finite products. But if I interpret the multiplication as a morphism G×G→GG\times G\to G, then I’m not using the multicategory structure, so we might as well just be in a category with finite products. And if I interpret the multiplication as a multimap (G;G)→G(G;G)\to G, then I don’t know how to interpret the axiom of inverses, since there is no ’diagonal’ G→(G;G)G\to (G;G) or ’projection’ G→()G\to ().

      Toby: I'm not sure why I generalised to cartesian multicategories, but it is a nontrivial generalisation. (Perhaps I was planning to show, as an example, how the category of contexts of the canonical language of a multicategory becomes a monoidal category or something, but that doesn't seem very useful. Maybe I was just doing unnecessary generality, but of course it's not the absolutely most general situation either.)

      Anyway … you make a multicategory cartesian much as you might make a monoidal category cartesian by equipping it with appropriate diagonal and projection maps. The problem is that, while G→G⊗GG \to G \otimes G and G→1G \to 1 make sense in a monoidal category, they don't make sense in a multicategory. But you fix this by filtering through Yoneda.

      So a cartesian multicategory is a multicategory equipped with, for each object GG and object XX, a function Gˇ X *:hom(G;X)←hom(G,G;X)\check{G}^*_X\colon hom(G;X) \leftarrow hom(G,G;X) and a function G^ X *:hom(G;X)←hom(;X)\hat{G}^*_X\colon hom(G;X) \leftarrow hom(;X). (H'm, my commas and semicolons are the opposite of yours; no matter.) Then these are subject to various coherence requirements that should be obvious.

      Mike: Okay, I see. Though I’m guessing you wanted those natural transformations to go the other way. Are there any naturally occurring examples of cartesian multicategories that are not cartesian monoidal categories? Even if there are, I’m inclined to regard the concept as esoteric enough that it would be clearer to just say “category with finite products” in this introductory article.

      Toby: Ah, the curse of contravariance! Going over the whole introduction again, I think that I understand why I mentioned multicategories, which is that a context like a:G,b:Ga\colon G, b\colon G is more naturally interpreted as a list (G,G)(G, G) of objects than as a single object G×GG \times G. But if we were really to go in that direction, then we'd also want the context a:G,b:G,(ab) 2=a 2b 2a\colon G, b\colon G, (a b)^2 = a^2 b^2 to be interpreted as a list in its own right rather than an actual subobject of G×GG \times G, and that's going a bit far … farther than I understand clearly, in any case. So in fact I let the category be finitely complete so that we could form that subobject (referred to only via the link to internal logic, of course).

      Mike: True. Is a one-object cartesian multicategory the same as a Lawvere theory, aka an operad relative to the theory of categories with finite products? If so, then perhaps the relevant place to work is a multicategory relative to the theory of lex categories? Can that be generalized to stronger logics?

      Toby: Yes, that seems to be right, that Lawvere theories are equivalent to one-object cartesian multicategories (cartesian multimonoids? cartesian operads?). So this should work.

      Of course, one thing that contexts do is to form an honest category even if you start with a multicategory. So here we're trying to go backwards and see what bare-bones starting point could lead to the same category of contexts of the equational theory of a group. =–

    • I finally gave the poor entry physics a bit of text.

    • created internal sheaf

      Mainly it was bugging me that I didn’t find a piece of literature that said it quite explicitly the way I do there, so I wanted to have that written down. To be expanded, eventually.

    • Made some changes at logic and started inductive inference and George Polya.

      There are still things to change at logic

      As a discipline, logic is the study of methods of reasoning. While in the past (and often today in philosophical circles), this discipline was prescriptive (describing how one should reason), it is increasingly (and usually in mathematical circles) descriptive (describing how one does reason).

      Could whoever wrote it explain what they meant? Seems odd to me.

      Also I don’t think that category-theoretic logic should be there. Should it not appear in mathematical logic, or be a new page?

    • Created arity class. Added links from a few places, but there are probably others I didn’t think of.

    • I’ve been editing second order arithmetic (I usually write “second-order arithmetic”, with a hyphen). I would appreciate someone taking a look and making corrections if necessary. There are probably some hyperlinks which could be added.

    • I ended up polishing type theory - contents (which is included as a floating table of contents in the relevant entries):

      1. expanded and re-arranged the list under “syntax”, created stubs for the missing items definition and program

      2. expanded the (logic/type theory)-table to a (logic/category theory/type theory)-table and subsumed some of the items into it that were floating around elsewhere.

    • at axiom of choice into the section In dependent type theory I have moved the explicit statement taken from the entry of dependent type theory (see there for what I am talking about in the following).

      One technical question: do we need the

        : true

      at the very end of the formal statement of the theorem?

      One conceptual question: I feel inclined to add the following Remark to that, on how to think about the fact that the axiom of choice is always true in this sense in type theory. But please let me know what you think:

      Heuristically, the reason that the axiom of choice is always true when formulated internally this way in dependent type theory is due to the fact that its assumption thereby is stated in constructive mathematics:

      Stated in informal but internal logic, the axiom of choice says:

      If B→AB \to A is a map all whose fibers are inhabited, then there is a section.

      But now if we interpret the assumption clause

      a map all whose fibers are inhabited

      constructively, we have to provide a constructive proof that indeed the fibers are inhabited. But such a constructive proof is a choice of section.

      So constructively and internally the axiom is reduced to “If there is a section then there is a section.” And so indeed this is always true.

      Would you agree that this captures the state of affairs?

    • I added a sentence to fundamental group which contains a link to an example for a fundamental group of an affine scheme.

    • split off total complex from double complex. Let the Definition-section stubby, as it was, but added a brief remark on exactness and on relation to total simplicial sets, under Dold-Kan and Eilenberg-Zilber. More to be done.

    • Dedekind completions of quasiorders (not just linear orders) may now be found at Dedekind completion. Example: the lower Dedekind completion of the quasiorder of continuous functions is the quasiorder of lower semicontinuous functions.

    • I put a bunch of stuff there that might be of interest to the logicians and foundationalists among us, although it’s still pretty trivial.

    • Am I correct in supposing that the first definition of Dedekind cuts at real numbers object is missing an openness condition (as given in the later, power object-using definition on the same page)?

9781 to 9840 of 11564

  1. <
  2. 1
  3. ...
  4. 160
  5. 161
  6. 162
  7. 163
  8. 164
  9. 165
  10. 166
  11. 167
  12. ...
  13. 193
  14. >
Top of Page