Renaissance Grrrl
http://winterkoninkje.dreamwidth.org/
Renaissance Grrrl - Dreamwidth StudiosMon, 25 Apr 2016 00:12:55 GMTLiveJournal / Dreamwidth Studioswinterkoninkjepersonalhttp://v.dreamwidth.org/8328681/518115Renaissance Grrrl
http://winterkoninkje.dreamwidth.org/
10086http://winterkoninkje.dreamwidth.org/108092.htmlMon, 25 Apr 2016 00:12:55 GMTQuantifiers in type theory
http://winterkoninkje.dreamwidth.org/108092.html
<p>All this stuff is "well known", but I want to put it out there for folks who may not have encountered it, or not encountered it all together in one picture.</p>
<p>The Damas–Hindley–Milner type system (i.e., the type system that Algorithm W is inferring types for) is propositional logic extended with <b><i>rank-1 second-order universal</i></b> quantifiers. It is interesting because it is so particularly stable with respect to inference, decidability, etc. That is, we can come up with many other algorithms besides Algorithm W and they enjoy nice properties like the fact that adding type signatures won't cause inference to fail. (It's worth noting, that Algorithm W is DEXPTIME-complete; so while in practice it's often linear time, for pathological inputs it can take exponentially long. However, if we put a constant bound on the depth of nested let-bindings, then the upper bound becomes polynomial.)</p>
<p>The extension of DHM with <b><i>rank-1 second-order existential</i></b> quantifiers is strictly more powerful. It is interesting because it allows unrestricted use of both of the quantifiers in prenex position; thus, it is the limit/top of the alternating quantifier hierarchy (à la the arithmetical hierarchy) that starts with DHM. Surely there are other interesting properties here, but this system is understudied relative to the ones above and below. <i>Edit:</i> Although GHC gets by with encoding existentials away, it's worth noting that MLF allows existentials where the unpacking is implicit rather than requiring an "unseal" or case eliminator <a href="http://research.microsoft.com/en-us/um/people/daan/download/papers/existentials.pdf">(Leijen 2006)</a>; and also that UHC does in fact offer first-class existentials <a href="http://dspace.library.uu.nl/bitstream/handle/1874/7352/full.pdf?sequence=8">(Dijkstra 2005)</a>.</p>
<p>The extension with <b><i>rank-2 second-order universals<i></i></i></b> (i.e., where the universal quantifier can appear to the left of one function arrow) is strictly more powerful still. Here we can encode rank-1 existentials, but my point in this whole post is to point out that rank-1 existentials themselves are strictly weaker than the rank-2 universals it takes to encode them! Also, one little-known fact: this type system is interesting because it is the last one in this progression where type inference is decidable. The decidability of rank-2 universal quantification is part of the reason why GHC distinguishes between <code>-XRank2Types</code> vs <code>-XRankNTypes</code>. Alas, although inference is decidable —and thus of mathematical interest— it is not decidable in the same robust way that DHM is. That is, if we care about human factors like good error messages or not breaking when the user adds type signatures, then we don't get those properties here. Still, the fact that this system is at the cusp of decidable inference is important to know. <i>Edit:</i> Also of interest, this system has the same typeable terms as simply-typed λ-calculus with <b><i>rank-2 intersection types</i></b>, and the type inference problem here is fundamentally DEXPTIME-complete <a href="http://publications.csail.mit.edu/lcs/pubs/pdf/MIT-LCS-TM-531b.pdf">(Jim 1995)</a>.</p>
<p>Things keep alternating back and forth between existentials and universals of each rank; so far as I'm aware, none of these systems are of any particular interest until we hit the limit: <b><i>rank-ω (aka: rank-N) second-order quantification<i></i></i></b>. This type system is often called "System F", but that's a misnomer. It is important to differentiate between the syntactic system (i.e., actual System F) we're inferring types for, vs the type system (aka: propositional logic with second-order quantifiers) in which the inferred types live. That is, we can perfectly well have a syntactic system which doesn't have explicit type abstractions/applications but for which we still ascribe rank-ω types. It so happens that the type inference problem is undecidable for that syntactic system, but it was already undecidable way back at rank-3 so the undecidability isn't particularly novel.</p>
<div class="btn-group">
<a href="https://twitter.com/share?text=Quantifiers%20in%20type%20theory&url=http%3A%2F%2Fwinterkoninkje.dreamwidth.org%2F108092.html&via=wrengr" class="btn" title="Share on Twitter" target="_blank">Twitter</a>
<a href="https://www.facebook.com/sharer/sharer.php?u=http%3A%2F%2Fwinterkoninkje.dreamwidth.org%2F108092.html&t=Quantifiers%20in%20type%20theory" class="btn" title="Share on Facebook" target="_blank">Facebook</a>
<a href="https://plus.google.com/share?url=http%3A%2F%2Fwinterkoninkje.dreamwidth.org%2F108092.html" class="btn" title="Share on Google+" target="_blank">Google+</a>
<a href="http://www.tumblr.com/share/link?url=http%3A%2F%2Fwinterkoninkje.dreamwidth.org%2F108092.html&name=Quantifiers%20in%20type%20theory" class="btn" title="Share on Tumblr" target="_blank">Tumblr</a>
<a href="http://wordpress.com/press-this.php?u=http%3A%2F%2Fwinterkoninkje.dreamwidth.org%2F108092.html&t=Quantifiers%20in%20type%20theory&s=" class="btn" title="Share on WordPress" target="_blank">WordPress</a>
</div><br /><br /><img src="http://www.dreamwidth.org/tools/commentcount?user=winterkoninkje&ditemid=108092" width="30" height="12" alt="comment count unavailable" style="vertical-align: middle;"/> commentshttp://winterkoninkje.dreamwidth.org/108092.htmlhaskell planettype theorylogiccolumbicubiculomaniapublic2http://winterkoninkje.dreamwidth.org/98453.htmlThu, 07 Aug 2014 09:51:21 GMTOn being the "same" or "different": Introduction to Apartness
http://winterkoninkje.dreamwidth.org/98453.html
<p>Meanwhile, back in math land... A couple-few months ago I was doing some work on apartness relations. In particular, I was looking into foundational issues, and into what an apartness-based (rather than equality-based) dependently-typed programming language would look like. Unfortunately, too many folks think "constructive mathematics" only means BHK-style intuitionistic logic— whereas constructive mathematics includes all sorts of other concepts, and they really should be better known!</p>
<p>So I started writing a preamble post, introducing the basic definitions and ideas behind apartnesses, and... well, I kinda got carried away. Instead of a blog post I kinda ended up with a short chapter. And then, well, <a href="http://winterkoninkje.dreamwidth.org/95307.html">panic struck</a>. In the interests of Publish Ever, Publish Often, I thought I might as well share it: <a href="http://cl.indiana.edu/~wren/resources/cartography-of-math/Apartness.pdf">a brief introduction to apartness relations</a>. As with my blog posts, I'm releasing it under <a href="http://creativecommons.org/licenses/by-nc-nd/4.0/">Creative Commons Attribution-NonCommercial-NoDerivs 4.0</a>; so feel free to share it and use it for classes. But, unlike the other columbicubiculomania files, it is not ShareAlike— since I may actually turn it into a published chapter someday. So do respect that. And if you have a book that needs some chapters on apartness relations, get in touch!</p>
<p>The intro goes a little something like this:</p>
<hr />
<p>We often talk about values being "the same as" or "different from" one another. But how can we formalize these notions? In particular, how should we do so in a constructive setting?</p>
<p>Constructively, we lack a general axiom for double-negation elimination; therefore, every primitive notion gives rise to both strong (strictly positive) and weak (doubly-negated) propositions. Thus, from the denial of (weak) difference we can only conclude weak sameness. Consequently, in the constructive setting it is often desirable to take difference to be a primitive— so that, from the denial of strong difference we can in fact conclude strong sameness.</p>
<p>This ability "un-negate" sameness is the principal reason for taking difference to be one of our primitive notions. While nice in and of itself, it also causes the strong and weak notions of sameness to become logically equivalent (thm 1.4); enabling us to drop the qualifiers when discussing sameness.</p>
<p>But if not being different is enough to be considered the same, then do we still need sameness to be primitive? To simplify our reasoning, we may wish to have sameness be <i>defined</i> as the lack of difference. However, this is not without complications. Sameness has been considered a natural primitive for so long that it has accrued many additional non-propositional properties (e.g., the substitution principle). So, if we eliminate the propositional notion of primitive equality, we will need somewhere else to hang those coats.</p>
<p><a href="http://cl.indiana.edu/~wren/resources/cartography-of-math/Apartness.pdf">The rest of the paper</a> fleshes out these various ideas.</p>
<div class="btn-group">
<a href="https://twitter.com/share?text=On%20being%20the%20%22same%22%20or%20%22different%22%3A%20Introduction%20to%20Apartness&url=http%3A%2F%2Fwinterkoninkje.dreamwidth.org%2F98453.html&via=wrengr" class="btn" title="Share on Twitter" target="_blank">Twitter</a>
<a href="https://www.facebook.com/sharer/sharer.php?u=http%3A%2F%2Fwinterkoninkje.dreamwidth.org%2F98453.html&t=On%20being%20the%20%22same%22%20or%20%22different%22%3A%20Introduction%20to%20Apartness" class="btn" title="Share on Facebook" target="_blank">Facebook</a>
<a href="https://plus.google.com/share?url=http%3A%2F%2Fwinterkoninkje.dreamwidth.org%2F98453.html" class="btn" title="Share on Google+" target="_blank">Google+</a>
<a href="http://www.tumblr.com/share/link?url=http%3A%2F%2Fwinterkoninkje.dreamwidth.org%2F98453.html&name=On%20being%20the%20%22same%22%20or%20%22different%22%3A%20Introduction%20to%20Apartness" class="btn" title="Share on Tumblr" target="_blank">Tumblr</a>
<a href="http://wordpress.com/press-this.php?u=http%3A%2F%2Fwinterkoninkje.dreamwidth.org%2F98453.html&t=On%20being%20the%20%22same%22%20or%20%22different%22%3A%20Introduction%20to%20Apartness&s=" class="btn" title="Share on WordPress" target="_blank">WordPress</a>
</div><br /><br /><img src="http://www.dreamwidth.org/tools/commentcount?user=winterkoninkje&ditemid=98453" width="30" height="12" alt="comment count unavailable" style="vertical-align: middle;"/> commentshttp://winterkoninkje.dreamwidth.org/98453.htmlcolumbicubiculomanialogicmathshaskell planetpublic0http://winterkoninkje.dreamwidth.org/91968.htmlTue, 11 Mar 2014 01:49:03 GMTA crash course in topos theory
http://winterkoninkje.dreamwidth.org/91968.html
<p>I ended up spending this weekend learning a lot about topos theory. Why? I have no idea. But for whatever reason, this happened. Like many areas of category theory, the biggest hurdle is figuring out the terminology— in particular, figuring out what terminology you actually need to know now vs the terminology you can put off learning until later.</p>
<p>So, with that in mind, I threw together <a href="http://cl.indiana.edu/~wren/resources/cartography-of-math/TopoiLogoi.pdf">a quick sketch of topos/logos theory</a>. I should emphasize that this is only a <i>very quick</i> sketch. It shows when one kind of category is also another kind of category, but for the most part[1] it doesn't say what the additional characteristics of the subkind are (unlike in my other terminology maps). One major thing missing from this sketch is a notation for when one kind of category is exactly the intersection of two other kinds (e.g., a pretopos is <i>precisely</i> an extensive exact category). Once I figure out how to show that in PSTricks, I'll post a new version. As before, the dashed lines indicate things you get for free (e.g., every pretopos is coherent for free). The dotted line from Heyting categories to well-powered geometric categories is meant to indicate that, technically, all WPG categories are also Heyting categories, but the Heyting structure is not preserved by geometric functors and therefore should not be "relied on" when reasoning about WPG categories as a whole. And finally, the table at the bottom shows what operators exist in the internal logic of these various categories, as well as what structure the subobject posets have.</p>
<p>Despite being far less polished than my other maps, hopefully it'll give you enough to go on so that you can read through the pages at <a href="http://ncatlab.org/">n-lab</a> in the correct order.</p>
<p>[1] For the arcs which are explained, the following abbreviations are used: "So.C." = subobject classifier; "AMC" = axiom of multiple choice; "NNO" = natural numbers object.; "LCCC" = locally cartesian closed.</p><br /><br /><img src="http://www.dreamwidth.org/tools/commentcount?user=winterkoninkje&ditemid=91968" width="30" height="12" alt="comment count unavailable" style="vertical-align: middle;"/> commentshttp://winterkoninkje.dreamwidth.org/91968.htmlcolumbicubiculomaniahaskell planetcategory theorypublic2http://winterkoninkje.dreamwidth.org/87291.htmlThu, 03 Oct 2013 23:06:32 GMTModal logic (columbicubiculomania, pt.V)
http://winterkoninkje.dreamwidth.org/87291.html
<p>It's been a while since I've posted under this tag, but I made a <a href="http://cl.indiana.edu/~wren/resources/cartography-of-math/ModalLogic.pdf">map of common normal modal logics</a> based off the diagram in <a href="http://plato.stanford.edu/entries/logic-modal/">SEP</a>. I don't have much to say about it, but I'm taking a course on the topic now so hopefully I'll have a bit more to say in the future.</p>
<p>While I was at it, I revised the <a href="http://cl.indiana.edu/~wren/resources/cartography-of-math/BinaryRelations.pdf">map for binary relations</a> (first published <a href="http://winterkoninkje.dreamwidth.org/79427.html">back here</a>). Not too much has changed overall. I added the definition of "dense" (op-transitive) and "shift-reflexive" relations, since these show up in modal logics and so could be interesting elsewhere. I also tightened up the list of entailments to more explicitly capture the difference between the weak and strong definitions of (anti)symmetry. In the new versions, the entailments all hold in minimal logic assuming the substitution principle for equality (if <code>x=y</code> and <code>P(x)</code> then <code>P(y)</code>, for any elements <code>x</code> and <code>y</code> and any property <code>P</code>)— except for those marked with a subscript <code>I</code>, which require intuitionistic logic. In addition, any of the entailments with strong (anti)symmetry as a premise can be strengthened to only require weak (anti)symmetry if we have decidable equality or are working in classical logic.</p>
<p><i>Edit 2013.10.12:</i> Updated these two again. For the relations, just added a note that shift-reflexivity entails density. For the modal logics, added a bunch of new goodies and cleaned things up a bit.</p><br /><br /><img src="http://www.dreamwidth.org/tools/commentcount?user=winterkoninkje&ditemid=87291" width="30" height="12" alt="comment count unavailable" style="vertical-align: middle;"/> commentshttp://winterkoninkje.dreamwidth.org/87291.htmlcolumbicubiculomanialogicmathspublic1http://winterkoninkje.dreamwidth.org/80410.htmlSun, 23 Dec 2012 06:11:10 GMTSemirings (columbicubiculomania, pt.IV)
http://winterkoninkje.dreamwidth.org/80410.html
<p>Apparently I messed up my link to the map of ring theory <a href="http://winterkoninkje.dreamwidth.org/80018.html">last time</a>. It's fixed now, but the fact that noone commented on it means noone's reading this blog anymore (or those who do don't care). Ah well. Regardless, it's time to finish up this little series for now.</p>
<p>Anyone who's hung around me long enough knows that I'm a great fan of semirings. Partly this is because of their ubiquity in natural language processing, but mostly it's because they're the intersection of two of the most powerful and ubiquitous abstractions in mathematics. Semirings simultaneously generalize rings (by not necessarily having negation) and bounded lattices (by not necessarily being commutative nor having both operators distribute). Therefore, they generalize both arithmetic and ordering, two of the core components of mathematics. Also the fact that the natural numbers do not form a ring is a strong case for taking semirings seriously. I don't have a map this time, instead I have <a href="http://cl.indiana.edu/~wren/resources/cartography-of-math/semirings.pdf">an extensive list of common examples</a>. The examples fall into about half a dozen common patterns.</p>
<ul>
<li>Natural number-like semirings</li>
<li>Integer-like rings</li>
<li>Tropical and Viterbi semirings</li>
<li>Bounded distributive lattices</li>
<li>Boolean rings</li>
<li>Regular languages</li>
<li>Square matrices over a semiring</li>
</ul>
<p>I'm sure you're already familiar with the natural numbers, integers, etc., so I won't spend much time talking about them. The one thing worth mentioning here, though, is what the heck that last column is for. It's for *-semirings (i.e., closed semirings), not to be confused with *-(semi)rings (i.e., (semi)rings with involution). <a href="http://www.cas.mcmaster.ca/~carette/">Jacques Carette</a> introduced me and <a href="http://r6.ca/">Russell O'Connor</a> to them, and Russell has <a href="http://r6.ca/blog/20110808T035622Z.html">written a bit about them</a>. Since he does a good job of explaining them, I won't talk about them just now. But, because they're a bit obscure, I made sure to indicate what the asteration operation is when it exists. The one especially notable point here is that the Alexandroff compactification of the reals is no longer a ring! (Another reason to take semirings seriously.) We give up the ring-ness of the reals to obtain closed-ness and compact-ness.</p>
<p>The tropical and Viterbi semirings are a sort of cross between arithmetic and ordering, and you've probably never heard of them before. They are, however, rather common in computer science. They tend to arise whenever we use dynamic programming in order to find the "best" of some set of things: e.g., the most likely tag sequence, the shortest path, the longest path, etc. This is what <a href="http://en.wikipedia.org/wiki/Viterbi_algorithm">part of speech tagging</a>, <a href="http://en.wikipedia.org/wiki/Matrix_chain_multiplication">matrix chain multiplication</a>, and Dijkstra's algorithm are all about. And recognizing that these are semirings is what leads to generalizations like <a href="http://en.wikipedia.org/wiki/Forward–backward_algorithm">forward–backward</a> and <a href="http://en.wikipedia.org/wiki/Inside-outside_algorithm">inside–outside</a>, to say nothing of the Gauss–Jordan–Floyd–Warshall–McNaughton–Yamada algorithm that comes from focusing on *-semirings.</p>
<p>The last major class I'll talk about are the bounded distributive lattices. The reason to discuss these is just to point out that this includes all Boolean algebras (hence classical logic and subset inclusion hierarchies), all Heyting algebras (hence intuitionistic logic), and all bounded totally ordered sets.</p>
<p>This chart is released under <a href="http://creativecommons.org/licenses/by-sa/3.0/us/">Creative Commons Attribution-ShareAlike 3.0</a>. Any questions? Anything I missed? Anything that needs further explanation?</p><br /><br /><img src="http://www.dreamwidth.org/tools/commentcount?user=winterkoninkje&ditemid=80410" width="30" height="12" alt="comment count unavailable" style="vertical-align: middle;"/> commentshttp://winterkoninkje.dreamwidth.org/80410.htmlsemi(near)ringscomputer sciencecolumbicubiculomaniamathspublic4http://winterkoninkje.dreamwidth.org/80018.htmlMon, 17 Dec 2012 20:54:05 GMTcolumbicubiculomania (pt.III)
http://winterkoninkje.dreamwidth.org/80018.html
<p><a href="http://winterkoninkje.dreamwidth.org/79868.html">Last time</a> we talked about sets which support a single binary operator. That's all well and good, but things get really interesting once we have two of those operators. Thus, for lack of a better name, I present <a href="http://cl.indiana.edu/~wren/resources/cartography-of-math/RingTheory.pdf">a map of ring theory</a>. The majority of this isn't actually part of ring theory proper, of course; but that's as good a name as any, since we'll want to distinguish these from lattice theory which also has two interlocking operators.</p>
<p>In the center of the map are (unital) rings. For those who aren't aware, in older literature, what are now called pseudorings used to be called "rings", and what are now called rings used to be called "unital rings" or "rings with unit". I've run into very few proper pseudorings of interest, so I support this change in terminology. In any case, if we start from rings and move upward we get rid of properties. In addition to pseudorings we also get semirings, which are utterly ubiquitous. In the next post I'll give a few dozen of the most common semirings, so I'll save my rant for then. If we keep moving up then we start getting rid of associativities and distributivities, resulting in things like seminearrings (aka near semirings) which arise naturally in certain kinds of parsing problems. This area is poorly explored, hence the dearth of names in the upper part of the map. This is, however, where I've been spending a lot of time lately; so you'll probably hear more about seminearrings and their ilk in the near future. As the names suggest, we have both left-near and right-near versions of these various structures, though I only draw the right-near ones for clarity.</p>
<p>Moving downward from semirings there are two directions to head. Off to the left we run into Kleene algebras and lattice theory yet again. And to the south we run into the swamp along the way to fields. In spite of their apparent axiomatization, fields are not really algebraic objects, which is a big part of the reason for all this mess. In the lower left we see a chain of inclusions based on some peculiar properties like <a href="http://en.wikipedia.org/wiki/Principal_ideal_domain">every ideal being principal</a>, the <a href="http://en.wikipedia.org/wiki/GCD_domain">existence of greatest common divisors</a> (though not necessarily <a href="http://en.wikipedia.org/wiki/Euclidean_domain">computable with Euclid's algorithm</a>), <a href="http://en.wikipedia.org/wiki/Ascending_chain_condition_on_principal_ideals">the ascending chain condition on principal ideals</a>, etc. These properties will be familiar to the actual ring theorists, as would numerous other properties I didn't bother putting on here. Off to the lower right we get a different sort of breakdown. In particular, before we get unique inverses for all non-zero elements, we can instead just have pseudoinverses or strong pseudoinverses. This is similar to the distinction between (von Neumann) regular semigroups vs inverse semigroups.</p>
<p>There's plenty more to say about ring theory and related areas, but that would be a whole series of posts on its own. This is actually the first map I started to make, because this is the region where we find so many mathematicians coming in from different areas and not being familiar with all that has been done before. As I'm sure you notice, quite a lot has been done, both in breadth and in depth. I brought this map up once when chatting with <a href="http://www.cs.indiana.edu/~sabry/">Amr Sabry</a>, and he's the one who convinced me to finally get around to posting all these. So, hopefully these'll give y'all a better lay of the land.</p>
<p>There are some notable omissions from this map as it stands. In particular, complete semirings (aka *-semirings) are missing, as are rings with involution (aka *-rings), as are the various constructive notions of fields (like <a href="http://ncatlab.org/nlab/show/field">discrete fields, Heyting fields, residue fields</a>, meadows, etc.). Next time I'll talk a bit about complete semirings; they were omitted mainly for lack of space, but should be included in future versions. The various constructive notions of fields were also omitted mainly for space reasons. I'll probably end up making a close-up map of the swamplands between rings and fields in order to do justice to them. Rings with involution were omitted mainly because I'm not entirely sure where the best place to put them is. As the name suggests, they've been primarily studied in contexts where you have a full-blown ring. However, there's nothing about the involution which really requires the existence of negation. I've started chatting with <a href="http://www.cas.mcmaster.ca/~carette/">Jacques Carette</a> about related topics recently, though; so perhaps I'll have more to say about them later.</p>
<p>This map is released under <a href="http://creativecommons.org/licenses/by-sa/3.0/us/">Creative Commons Attribution-ShareAlike 3.0</a>. Any questions? Anything I missed? Anything that needs further explanation?</p><br /><br /><img src="http://www.dreamwidth.org/tools/commentcount?user=winterkoninkje&ditemid=80018" width="30" height="12" alt="comment count unavailable" style="vertical-align: middle;"/> commentshttp://winterkoninkje.dreamwidth.org/80018.htmlsemi(near)ringscolumbicubiculomaniamathspublic0http://winterkoninkje.dreamwidth.org/79868.htmlMon, 17 Dec 2012 19:43:41 GMTcolumbicubiculomania (pt.II)
http://winterkoninkje.dreamwidth.org/79868.html
<p>Continuing the thread from <a href="http://winterkoninkje.dreamwidth.org/79427.html">last time</a>, let's move on from relations and consider <a href="http://cl.indiana.edu/~wren/resources/cartography-of-math/GroupTheory.pdf">a map of individual binary operations</a>. In a lot of ways this is even simpler than the binary relations from last time, though the map requires a bit more explanation. This time, rather than having definitions at the top, they're given as labels on the arcs. Arcs in the same color denote the same property, dashed lines represent things you get for free, and black lines are for the odd things; all just like last time.</p>
<p>Most of the study of individual binary operations falls under group theory, which forms the core of this map. The one interesting thing here is that if you have at least monoid structure (i.e., have an identity element) then the uniqueness of inverses follows from having the presence of inverses. However, for semigroups which are not monoids, these two properties differ. This'll come up again next time when we start talking about rings and fields.</p>
<p>Off to the left we veer into lattices. And to the right we get the crazy stuff that comes from non-associative algebra. Quasigroups and loops are somewhat similar to groups in that they have an invertible structure, but unfortunately they don't have associativity. It turns out, there's a whole hierarchy of almost-but-not-quite-associative properties, which is shown on the second page. The strongest property you can get without being fully associative is Moufang, which can be phrased in four different ways. Below this we have left- and right-Bol (if you have both the Bols then you have Moufang). Below that we have alternativity where you choose two of three: left-alternativity, right-alternativity, and flexibility. Below that, of course, you can have just one of those properties. And finally, at the bottom, power associativity means that powers associate (and so "powers" is a well-formed notion) but that's it.</p>
<p>As I said, there's not a whole lot here, but I needed to bring this one up before getting into ring-like structures. This map is released under <a href="http://creativecommons.org/licenses/by-sa/3.0/us/">Creative Commons Attribution-ShareAlike 3.0</a>. Any questions? Anything I missed? Anything that needs further explanation?</p><br /><br /><img src="http://www.dreamwidth.org/tools/commentcount?user=winterkoninkje&ditemid=79868" width="30" height="12" alt="comment count unavailable" style="vertical-align: middle;"/> commentshttp://winterkoninkje.dreamwidth.org/79868.htmlcolumbicubiculomaniamathspublic0http://winterkoninkje.dreamwidth.org/79427.htmlMon, 17 Dec 2012 03:47:50 GMTNight of the Living Blog
http://winterkoninkje.dreamwidth.org/79427.html
<p>Friday I turned in the last of my papers, and last night I turned in the last of my grades. Which means I'm free for a whole two weeks or so. Which is good because for the last couple weeks I've been wanting desperately to blog as a means of escaping all those due dates. So now I get to flush some of the backlog from this semester. In particular, there's a cluster of posts I've been meaning to put up for a while, a sort of <i>Intro to Maths for mathematicians</i>, as it were. To save y'all's friendspages I'll spread these posts out over the next few days.</p>
<blockquote><p><b>columbicubiculomania</b> — The compulsion to stick things into pigeonholes. (<a href="http://www.ling.ohio-state.edu/~bjoseph/Ling611/Lx611Matisoff1990.pdf">Jim Matisoff 1990</a>)</p></blockquote>
<p>Ever since <a href="http://languagelog.ldc.upenn.edu/nll/?p=4306">stumbling upon</a> that fabulous word I've wanted to spread its popularity. As a geek with certain obsessive–compulsive tendencies, I'm a bit prone to columbicubiculomania; or rather, as the theoretician that I am, I'm prone to the dual of columbicubiculomania. I don't care so much about the pigeons, they can take care of themselves. But I do have a certain compulsion to design and arrange pigeonholes such that whenever someone feels the columbicubiculocompulsion, they'll have the right places to stuff all their pigeons into. Part of this is also tied up in me trying to figure out (or rather, to convey) where exactly I situate myself in the vast sea of competing academic fields. As the perennial outsider, I'm more interested (it seems) in seeing how everything is connected than are those stuck on the inside.</p>
<p>And so, over the past few years I've been accumulating the jargon from different subfields of mathematics and organizing them into a cohesive whole. In particular, for the next few posts, I'm concerned with the terminology for algebraic objects. Too often I read papers with practitioners of one algebraic field (e.g., group theory, ring theory,...) getting unwittingly caught up in another field and subsequently using such outrageous terms as "semigroup with identity" or "monoid without identity". Because of this ridiculousness, a lot of mathematicians and computer scientists end up not realizing when the thing they're studying has already been studied in depth under another name. So let's see all those names and how they connect. Let's produce a cartography of mathematical objects.</p>
<p>Perhaps the easiest place to start is one of the latter maps I produced. Binary relations are ubiquitous in all areas of mathematics, logic, and computer science. Typically we don't care about all binary relations, we only care about relations with particular properties. Of course, the interaction between properties is nontrivial since properties A and B together can entail that property C must hold. Thus, <a href="http://cl.indiana.edu/~wren/resources/cartography-of-math/BinaryRelations.pdf">a map of binary relations</a> is helpful for keeping track of it all. This map requires relatively little explanation, which is why I started here.</p>
<p>All the common properties of interest are defined at the top, and color coded for use in the map. And, constructivist that I am, I've been sure to distinguish between strong and weak versions of the properties (which collapse in the classical setting). The arrowheads in the map are for keeping track of when we're talking about P, anti-P, or co-P (for some particular property P). And the big black dot is the starting point of the map (i.e., a binary relation with no special properties). The dashed lines indicate when some property will follow for free. So, for example, there's no name for a transitive irreflexive relation since trans+irrefl entails antisymmetry and trans+irrefl+antisym is a strict partial order. And the black lines are for when the named object requires some peculiar property that doesn't show up all over the place. These conventions for dashed and black lines are common to all my maps.</p>
<p>Once you're familiar with my conventions, the only thing really left unstated on this map is that the apartness relation used in the definition of a strongly connected binary relation is actually a <i>tight</i> apartness. The constructive significance of apartness relations vs equality relations is something I'll have to talk about another time.</p>
<p>Towards the top of the map we start veering away from binary relations per se and start heading into order theory. Because the complexities of order theory are a bit different from the complexities of binary relations, I've chosen to break them up into different maps. As yet, I haven't actually made the map for order theory, but I'll get around to it eventually. Lattice theory and domain theory also gets tied up in all this (in the order theory particularly). I've started work on a lattice theory map, but haven't finished it just yet.</p>
<p>This map is released under <a href="http://creativecommons.org/licenses/by-sa/3.0/us/">Creative Commons Attribution-ShareAlike 3.0</a>. Any questions? Anything I missed? Anything that needs further explanation?</p><br /><br /><img src="http://www.dreamwidth.org/tools/commentcount?user=winterkoninkje&ditemid=79427" width="30" height="12" alt="comment count unavailable" style="vertical-align: middle;"/> commentshttp://winterkoninkje.dreamwidth.org/79427.htmlmathscolumbicubiculomaniaDJ Tiëstopublic0