Two models of mathematics

I've been thinking lately about high-level parallels between three activities I engage in on a regular basis: philosophy, mathematics and computer programming. One of the obvious things that all of these have in common is that abstraction has a role, though what role it has differs between the three and within each, depending on what one is doing.

One model of mathematics is the abstractive model. "Aristotelian" is a label that comes to mind. Natural numbers abstract from pluralities, ratios abstract from pairs of natural numbers, fields abstract from arithmetic, morphisms abstract from homomorphisms, categories abstract from just about everything. There is an old category theory joke that mathematicians are so absent-minded because mathematics is all about the application of forgetful functors. Taking the joke's thesis literally probably isn't going to give an adequate picture of, say, the number theorist or harmonic analyst are doing, but the basic picture is clear: mathematicians abstract away, or forget, structure. Pluralities have all sorts of structure: these four cows have legs, spots, give milk, and have one dominant cow, but we forget about everything but the "four" to get numbers. When we go from pairs to ratio, we forget everything but the multiplicative relationship. And so on up.

The other model of mathematics is the constructive model (using the term very loosely, and without a commitment to constructivism). Here, we build our way up to more complex structures out of simpler ones. The most impressive example is just how much of mathematics can be seen as about sets and membership.

The abstractive model makes one think of very high level programming languages, of paradigms like functional programming or object-oriented programming. The constructive model makes one think of assembly language programming (some will lump C in here, and I guess that's not unfair). The models can be thought of as models of practice. If so, then they are complementary. Both with computers and mathematics, we need both the abstractive and the constructive practices. We need Java and assembly programmers; we need category theorists and real analysts. Different solutions are appropriate to different problems. You are unlikely to do a lot of abstraction when producing hand-optimized code for an 8-bit microcontroller, but you won't want to produce a banking system in this way. The abstractive approach ("abstract nonsense", as it is fondly called) is just the right thing for many (but not all) problems in algebra, but a constructive approach is likely to be the better solution for many (but not all) problems in harmonic analysis. And of course really good work can involve both, and a well-rounded programmer and mathematician can work in both modalities.

But besides thinking of the two models as models of practice, one can think of them as models of ontology. There is an abstractive ontology of mathematics. Mathematical facts are simply abstractions from facts about concrete things. And there is a constructive ontology, the most prominent starting with sets and showing how the mathematics we care about can be made to be about sets.

With computers, it's clear that the analogue to the constructive ontology is simply the truth of the matter. Computers are built up of transistors, the transistors run microcode, the microcode runs higher level machine code, and all the way up to Java, Haskell and the like. That elegant Haskell one-liner will eventually need to be implemented with microcode. And we have tools to bridge all the levels of abstraction. The proponent of the set-theoretic ontology in mathematics says that the analogy here is perfect. But that is far from clear. We need to take seriously the idea that mathematical abstractions are not built up out of simpler mathematical entities, but are either fundamental or are grounded in non-mathematical entities and pluralities (and their powers, I will say).

Nothing new here. Just laying out the territory for myself.

Grounding and category theory

I've been searching for the right kind of mathematical structure to think about the phenomenon of grounding or partial grounding with. The orthodoxy is that the right structure is a partial ordering. That the axioms of partial ordering are satisfied by partial grounding has been challenged and defended. But even the critics have tended to take partial grounding to be something like[note 1] a single relation, or perhaps a small collection of related relations, between pairs of propositions or between a proposition and a set of propositions. I've offered two suggestions (first and second) on how to model grounding using graphs. But I now think all of these approaches abstract away too much of the structure of grounding and/or are unable to capture all the prima facie possibilities that a theory of grounding should recognize.

For instance, the relational approach loses sight of the structural fact that one can sometimes have two different grounding relations between a pair of propositions. Let W be the proposition that Smith is drinking water and let H be the proposition that Smith is drinking H₂O. Let D be the disjunction of W and H: the proposition that Smith is drinking water or drinking H₂O. If we think of grounding as a relation, we can certainly say that H grounds D. But we want to be able to say that there are two groundings between H and D: H grounds D directly by being one of its disjuncts and indirectly by grounding W which is another disjunct. And this structure is not captured by the orthodoxy. The graph approach nicely captures this sort of thing, but it does not adequately capture the compositional structure which is that the indirect grounding that H provides for D is a composition between a grounding by H of W and a grounding by W of D. There are ways to make it capture this, say by identifying composition of grounding with sequences of arrows in the directed graph, but this won't work for infinite sequences of arrows, something that we should not rule out in the formalism. I realized this when trying to finish a paper on grounding and fundamentality.

I am now wondering if the right structure isn't that of a category. Maybe the objects are true propositions. The arrows are groundings, i.e., token grounding-like relations. Every arrow is at least a partial weak grounding (weak, because there are identity arrows). Some arrows may be full groundings. There is a nice associative compositional structure.

There will be further structure in the category. For instance, perhaps, every family of true propositions will have a coproduct, which is the conjunction of the propositions in that family. The canonical injections are the partial groundings that conjuncts give to the conjunction, and the universal property of the coproduct basically says that when a proposition is weakly partially grounded by each member of a family of propositions, then there is a coproduct weak partial grounding arrow from the conjunction of that family to the proposition. This is very nice.

We might also consider a move to a category where the objects are all propositions, but that creates the challenge that we need to keep track of which propositions are true and which groundings are actual. For that p partially grounds q is, in general, a contingent matter.[note 2] Truth and actuality of grounding respects the category structure. Actual groundings only obtain between truths, and compositions of actual groundings are actual.

The category structure is going to yield transitivity of weak partial grounding. There are apparent counterexamples to transitivity. But it is my hope that when we keep track of the additional structure, and think of the token groundings as central rather than the relation of there being a token grounding, the result is not going to be problematic.

It is now interesting to investigate what different category theoretic phenomena occur in the grounding category, and how they connect up with metaphysical phenomena. One thing I'd like to see is if there is a neat category theoretic characterization of full, as opposed to partial, grounding.

I have an intuitive worry about the above approaches. Intuition would suggest that if conjunctions are coproducts, then disjunctions would be products. But they're not. For in general there is no grounding from a disjunction to disjuncts. This could be related to another worry, that because categories include identity arrows, I had to take the arrows to be weak groundings—i.e., I had to allow each proposition to count as having a grounding between itself and itself.

I do not know if category theory will in the end provide a good mathematical home to grounding structures, but I am hopeful.

Privileging objects

Consider this criticism of traditional metaphysics: Traditional metaphysics privileges objects. A natural (though really not all that common) move for philosophers of a certain stripe is to move from a focus on objects to a focus on relationships between objects and to capture this by means of Category Theory. But Category Theory privileges relationships between pairs of objects, and that's at least as bad as privileging single objects.