# Mathematical Explanation beyond Explanatory Proof

Mathematical Explanation beyond Explanatory Proof Abstract Much recent work on mathematical explanation has presupposed that the phenomenon involves explanatory proofs in an essential way. I argue that this view, ‘proof chauvinism’, is false. I then look in some detail at the explanation of the solvability of polynomial equations provided by Galois theory, which has often been thought to revolve around an explanatory proof. The article concludes with some general worries about the effects of chauvinism on the theory of mathematical explanation. 1 Introduction 2 Why I Am Not a Proof Chauvinist   2.1 Proof chauvinism and mathematical practice   2.2 Proof chauvinism and philosophy 3 An Example: Galois Theory and Explanatory Proof 4 Conclusion 1 Introduction Near the beginning of ‘Mathematical Explanation’—the founding document of the recent literature on the subject—Mark Steiner ([1978a], p. 135) writes: ‘Mathematical explanation exists. Mathematicians routinely distinguish proofs that merely demonstrate from proofs which explain’. Judging from his treatment of the subject in the rest of the article, Steiner seems to intend the second claim as something like an elaboration of the first, rather than as an example of one sort of mathematical explanation among others.1 That is, Steiner appears to endorse approximately the following view: Proof Chauvinism: All or most cases of mathematical explanation involve explanatory proofs in an essential way. Steiner’s ([1978b]) contemporaneous paper on mathematical explanations in science is perhaps even more explicitly committed to proof chauvinism. In that essay, Steiner ([1978b], p. 19) claims that we have a mathematical explanation of a physical phenomenon just in case ‘when we remove the physics, we remain with a mathematical explanation—of a mathematical truth’. A few lines later, Steiner seems to suggest that ‘remaining with a mathematical explanation’ amounts to obtaining an explanatory proof of the relevant theorem.2 On this view, then, an explanation of a mathematical fact just is an explanatory proof of that fact. Much has been written on the subject since Steiner’s work appeared, and his theory of mathematical explanation is no longer popular.3 For one reason or another, however, Steiner’s proof-chauvinist assumptions have taken deep root. Subsequent papers on mathematical explanation have almost invariably dealt with some issue in the theory of explanatory proofs—for instance, whether and why a particular proof explains its result (Sandborg ; Mancosu ; Lange ), whether certain general types of proof are explanatory or not (Cellucci ; Lange ; Baker ), or the factors that contribute to a proof’s being explanatory (Mancosu ; Lange ; Pincock ). Some authors admit that there might be other kinds of mathematical explanation, but they almost never say what these kinds might be or discuss specific examples. And it’s still common to see mathematical explanation in general run together with explanation-by-proof in particular, as in passages like the following: The topic of mathematical explanation seems to me a central one for an accurate understanding of mathematics. Mathematicians, as we have seen, do not simply struggle to obtain rigorous and compelling proofs. They often look for new proofs or consider old proofs unsatisfactory on account of their lack of ‘explanatoriness’. (Mancosu , p. 102) The impression given by all this is that mathematical explanations not involving explanatory proof are vanishingly rare, or not very interesting, or both. I aim to show that this view is mistaken, and importantly so. Proof chauvinism has already led to missteps in the theory of mathematical explanation, and its continued hegemony threatens to make things worse. (Hence it’s not merely, as one might have thought, that philosophers have focused on explanatory proofs just because they’re the most distinctively mathematical sort of mathematical explanation. Such an attitude might have led to an imbalanced distribution of research efforts, but it probably wouldn’t be so bad on the whole. Rather, I’ll argue that proof chauvinism has had more insidious effects—that it’s led to theoretical errors and misdiagnoses of important cases, for instance.)4 I’ll begin by considering the epistemic status of chauvinism. What sorts of reasons could there be for accepting it, as many philosophers apparently do? Neither Steiner nor anyone else, as far as I’m aware, has defended the principle explicitly, but its possible justifications seem to fall into two general categories. The first kind is something like this: We should accept chauvinism because it faithfully reflects mathematical practice. When mathematicians pursue explanations or make claims about what explains what, according to this line of thought, explanatory proofs are generally their targets. Hence, as philosophers striving to ground our theories in the realities of working mathematics, we should be chauvinists. The second sort of possible justification runs as follows: We should accept chauvinism because it has a compelling philosophical rationale. Whatever mathematicians might or might not say, the theory of explanation presents us with good reasons—perhaps emanating from general philosophy of science, or from elsewhere in the philosophy of mathematics—to think that explanatory proofs must be central to mathematical explanation. Hence, as philosophers striving to achieve a unified picture of the theoretical landscape, we should accept chauvinism. The next section discusses several arguments of the above kinds. Its conclusion is that philosophical considerations offer no support for proof chauvinism, and mathematical practice strongly suggests its falsity. The rest of the article provides some reasons for caring about the chauvinism issue. I look in some detail at the explanation of the solvability of polynomial equations provided by Galois theory, which has often been thought to revolve around an explanatory proof. I argue that this diagnosis is mistaken. The article concludes with some general worries about the effects of chauvinism on the theory of mathematical explanation. 2 Why I Am Not a Proof Chauvinist 2.1 Proof chauvinism and mathematical practice As suggested above, one reason for embracing proof chauvinism is that it might be thought to reflect mathematical practices of seeking and offering explanations. It’s not hard to see why this view might seem attractive. After all, mathematicians certainly do talk often about the explanatory virtues of various proofs (and proof methods)—the recent literature on mathematical explanation has shown at least that much beyond doubt. Generalizing from these cases, one might form the impression that proofs are the only sort of explanation that mathematicians care much about. But this impression is erroneous. Mathematicians often cite items other than proofs as the explanantia of mathematical explanations: for example, theories, diagrams and other sorts of pictures, and particular facts of various descriptions. Examples of each kind of attribution are easy to find. Here are just a few: The following theorem, which we give here without proof, provides a necessary and sufficient condition for a number to be the sum of two squares: An integer a is the sum of two squares if and only if any prime congruent to 3 (mod 4) in the prime factorization of a appears an even number of times in the factorization. This theorem explains why 12 is not the sum of two squares. (Maor , p. 224) The next lemma explains why certain degenerate cases, singled out by the condition χˇ=χ, sometimes simplify […] Let χbe a character on a group G such that χˇ=χ. If G is generated by its squares, and in particular if G is 2-divisible, then χ= 1. (Stetkær , p. 31) The fact that xm – 1 is reducible over Q […] explains why its roots do not all have the same algebraic properties over Q. (Newman , p. 92) The central limit theorem is the reason why the Gaussian distribution is the limit of the binomial distribution. (Keshav , p. 40) Complex analysis explains why the Taylor series for the function f(x)=1/(1+x2) converges in the finite domain −1<x<1 even though f(x) is smooth for all real x. (Bender et al. , p. 1) An arithmetic quotient of a bounded symmetric domain has several compactifications, that is, Satake-Baily-Borel’s, Mumford’s toroidal and Looijenga’s compactifications. A general theory explaining the relations between these types of compactifications and those of a geometric nature […] has been developed by Looijenga. (Artebani and Kondo , p. 1445) Let F be the field of rational numbers or the Galois field GF(p), where p is a prime. Let A be the underlying additive group of F. Pick an abelian group X [Then] Hom(A,X) is A-cellular. Also, the following diagram explains why the ‘evaluation at one’ map is an A-equivalence, where 1→ατ is the unique homomorphism taking 1 to ατ. (Farjoun et al. , p. 66) In these and many similar cases, we’re confronted with mathematical explanations in which proofs seem to play no obvious role.5 I think this impression is basically right. Hence I think mathematical practice lends no support to proof chauvinism. The chauvinist, however, has a number of options for trying to resist this conclusion. Let me present what I take to be the most pressing concerns; answering them will help clarify just what is and isn’t shown by examples like the above. An initial worry is whether diagrams can count as proofs, as some have argued that they can (for instance, Brown ). If so, then explanatory diagrams may just be explanatory proofs, so that these cases aren’t counterexamples to chauvinism after all. It may well be true that some diagrams are proofs. But the claim that every explanatory diagram is a proof is much stronger, and there’s no obvious reason to accept it. For instance, it’s doubtful that the commutative diagram above, taken by itself, proves anything about the map ev. (Compare the way in which, for example, an appropriate dot diagram might be thought to prove that the sum of the first n odd numbers is n2.) At any rate, even if it’s true that all explanatory diagrams are proofs, this doesn’t put any pressure on the other types of example. Similarly, it’s unclear whether claims about explanatory theories might not ultimately depend on facts about explanatory proofs. At the very least, it’s hard to deny that true claims about explanation-by-theories are sometimes grounded in facts about explanation-by-components-of-theories. In the empirical sciences, these components are sometimes facts or laws falling under the purview of the theory in question. Hence we might think that biological theory explains why the fox population increased at time t in virtue of the fact that the Lotka–Volterra equations explain why the fox population increased at t. (Compare van Fraassen’s (, p. 101) proposal that the claim ‘theory T explains fact F ’ is equivalent to the claim ‘there are facts which explain F relative to T ’.) In the mathematical setting, couldn’t the explanatory components of T just as well be proofs? I don’t deny that some claims about explanation-by-theories in mathematics are true in virtue of facts about explanation-by-proofs. But why think this is the typical case? Assuming that, say, theorems are often explanatory in their own right, we should expect many explanations-by-theory to rest instead on explanations-by-constituent-theorems. And perhaps there are cases in which theories are ‘irreducibly’ explanatory—that is, explanatory in a way that isn’t grounded in the explanatoriness of any of their components. Maybe so. Still, I admit that it’s usually hard to tell exactly what’s behind a given claim of the form ‘theory T explains why p’. In the above cases, and in most others, there isn’t any straightforward way to determine whether T is supposed to be explanatory in virtue of containing an explanatory proof, or an explanatory theorem, or an explanatory something-else, or in its own right. Since the cases of diagrams and theories involve the complications just discussed, and since they’re probably less important anyway, I’ll mostly set them aside in what follows. My focus for the rest of the article will largely be on the explanatoriness of theorems and other mathematical facts. (But I continue to maintain that explanatory diagrams and theories can’t be generally assimilated to explanatory proofs.) Another objection: Why assume that claims like the above should be taken literally? Mathematicians’ talk about explanations and reasons in such contexts, one might think, could just as well be understood as innocent façons de parler with no deep philosophical meaning. For instance, claims like ‘theorem T explains why p’ may just be stylized ways of expressing the thought that T implies p. As before, there’s no point in denying that some authors may sometimes use explanatory language in this way. But neither is there any reason to think this is always or usually the case. More to the point: if this suggestion is supposed to help the proof chauvinist, then she’d have to maintain that mathematicians generally speak literally when they refer to explanatory proofs, but non-literally when they make other sorts of explanatory claims. This idea seems quite ad hoc, and I can’t see how anyone would try to defend it. I’ve saved the next concern for last because it’s weightier than the others, and the response it requires is relatively involved. The worry is this: given only a list of decontextualized claims like those above, it’s difficult to tell whether proofs are in fact making some important explanatory contribution that the quoted text doesn’t make obvious. For instance, when mathematicians say things like ‘theorem T explains why p’, this might be a loose or elliptical way of pointing to the explanatoriness of some proof of p from T—one that’s offered or indicated elsewhere in the text, perhaps. Certainly this is possible, and perhaps it’s the right way to understand some cases. But typically there’s no evidence that anything like this is going on. If the explanations in the above cases involved proofs in some significant way, then one would expect the explanatory features of those proofs to be highlighted at some point during the proof presentations or in the surrounding discussions. Otherwise it’s hard to see what the point of the explanatory claims would be: if the intention is to communicate something about a proof, why say something about a theorem instead, and then fail to draw the reader’s attention to the features of the proof that one had in mind? This would be a strange and unhelpful expository choice, to say the least. Thus, if nothing about any proof is flagged as explanatory anywhere in the relevant text, I take this to be good evidence that no claim about explanatory proofs is intended. And this is in fact the situation in cases like the ones I’ve offered. There’s just no suggestion in these cases that an explanatory proof is somehow lying behind an assertion about an explanatory proposition, or diagram, or theory. Indeed, in some cases a proof isn’t so much as gestured at. This suggests that the examples in question are just what they appear to be: instances of mathematical explanation that don’t involve explanatory proofs. But perhaps this is too quick. Marc Lange has recently proposed a way of thinking about this issue that’s congenial to chauvinism, but that doesn’t seem to require that an explanatory proof be flagged in the way I’ve suggested. Lange’s view isn’t crudely chauvinist in the sense that it denies explanatory power to anything other than proofs. In fact it deserves credit for being, as far as I know, the only account of mathematical explanation that acknowledges that some theorems are genuinely explanatory. Regarding d’Alembert’s theorem on roots of polynomials, for instance, Lange (, pp. 241–2) writes: Why is it that in all of the cases I have examined of polynomials with real coefficients, their nonreal roots all fall into complex-conjugate pairs? Is it a coincidence, or are they all like that? […] In fact, as I have shown, d’Alembert’s theorem is the explanation; any polynomial with exclusively real coefficients has all of its nonreal roots coming in complex-conjugate pairs. Here we have a mathematical explanation that consists not of a proof, but merely of a theorem. So far I’m happy to agree. As it turns out, however, Lange’s theory about the nature of explanation-by-theorems is still chauvinist at heart. For Lange (, p. 345), ‘A theorem can explain [one of its instances] only if the theorem is no coincidence and hence only if it has a certain kind of proof’. The kind of proof in question is what Lange (, p. 287) calls a ‘common proof’ of all the theorem’s cases—that is, a proof that exploits some respect in which the cases are alike, and that ‘proceed[s] from there to arrive at the result by treating all of the (classes of) cases in exactly the same way’.6 Such proofs, Lange thinks, are necessarily explanatory, at least in the appropriate context.7 So even though he recognizes that some theorems genuinely explain, his proposal implies that the explanatory power of a theorem derives from the explanatory power of a proof. (If this is the case, why are the relevant features of the relevant proofs not always explicitly pointed out? Perhaps Lange would say that his theory is tacitly understood by mathematicians, and assumed to be understood by their readers. So when someone writes ‘theorem T explains why p’, it’s supposed to go without saying that this means ‘T has a “common proof” that exploits some respect in which its instances, including p, are all alike’.) There are a few things to say in response to Lange’s view. First of all, his account only applies to theorems that explain their instances by subsuming them under a more general fact. But not all explanatory theorems work this way.8 For instance, in the third example given above, the fact that the roots of xm − 1 don’t have all the same algebraic properties over Q isn’t an instance of the fact that xm − 1 is reducible over Q. And yet the latter fact is supposed to explain the former. So even if Lange is right, his account only applies to a limited class of explanations-by-theorems, and there’s no obvious way to generalize the proposal to cover other cases. So the strategy leads only to a partial vindication of chauvinism at best. Second, it’s doubtful whether Lange’s view is in fact correct. Consider that mathematicians also make claims about what a theorem would explain if it were true, even though its truth value is actually unknown, and hence even though no proof yet exists. For instance, in his discussion of the current state of evidence for P ≠ NP, William Gasarch (, p. 258) writes: If a theory explains much data, then perhaps the theory is true […] Are there a set of random facts that P ≠ NP would help explain? Yes. [For example,] Chvatal in 1979 showed that there is an algorithm for Set Cover that returns a cover of size (lnn)×OPT where OPT is the best one could do. Moshkovitz in 2011 proved that, assuming P ≠ NP, this approximation cannot be improved. Why can’t we do better than lnn? Perhaps because P ≠ NP. If this was the only example it would not be compelling. But there are many such pairs where assuming P ≠ NP would explain why we have approached these limits. This sort of case makes it hard to see how chauvinism, or Lange’s account in particular, could be right. We have no proof of P ≠ NP. Nor does anyone have much idea what a proof of P ≠ NP might look like. And yet it seems perfectly natural to say that P ≠ NP would explain all sorts of results in computability theory if it turned out to be true. Of course, this particular example doesn’t involve a case of explanation-by-subsumption, but similar remarks apply to cases that do. Consider, for instance, the famous Hadwiger conjecture in graph theory, which says that, for all t≥0, a graph is t-colourable if it has no Kt+1 minor.9 The conjecture is equivalent to the four-colour theorem when t = 4, but the general case is considered extremely difficult, and again nobody has much idea what to expect from a proof. Nevertheless, many mathematicians feel that the Hadwiger conjecture, if true, would explain the four-colour theorem. As Paul Seymour (, pp. 417–18.) writes: The four-colour conjecture (or theorem as it became in 1976) […] was the central open problem in graph theory for a hundred years; and its proof is still not satisfying, requiring as it does the extensive use of a computer. (Let us call it the 4CT.) We would very much like to know the ‘real’ reason the 4CT is true; what exactly is it about planarity that implies that four colours suffice? […] By the Kuratowski–Wagner theorem, planar graphs are precisely the graphs that do not contain K5 or K3, 3 as a minor; so the 4CT says that every graph with no K5 or K3, 3 minor is 4-colourable. If we are searching for the ‘real’ reason for the four-colour theorem, then it is natural to exclude K5 here, because it is not four-colourable; but why are we excluding K3, 3? What if we just exclude K5, are all graphs with no K5 minor four-colourable? And does the analogous statement hold if we change K5 to Kt+1 and four-colouring to t-colouring? That conjecture was posed by Hadwiger in 1943 and is still open. Seymour’s discussion strongly suggests that, if the Hadwiger conjecture turned out to be true, then it would explain (that is, give ‘the real reason’ for) the four-colour theorem. But neither Seymour nor anyone else is in a position to guess whether the conjecture has a ‘common proof’ in Lange’s sense. And even if there turned out to be no such proof, there’s no reason to think this would change anybody’s assessment of the situation. So it seems that the question whether a Langean common proof exists is irrelevant to the question whether the conjecture would be explanatory. Moreover, this is precisely the type of case that Lange’s account is designed to handle, since the four-colour theorem is a particular case of the Hadwiger conjecture. Hence Lange’s account appears not to work even for cases of explanation by subsumption under a theorem. I conclude that the verdict reached earlier was the right one. Many theorems are explanatory in a way that doesn’t involve or depend on their having explanatory proofs. So the first strategy for defending proof chauvinism seems to fail. Mathematical practice offers no support for the claim that explanatory proofs are at the centre of most instances of mathematical explanation. On the contrary, mathematicians regularly identify particular facts (as well as things like theories and diagrams) as explanantia, and they do so in ways that leave proofs entirely out of the picture. 2.2 Proof chauvinism and philosophy 2.2.1 An argument from philosophy of science I turn now to the second possible strategy for defending chauvinism. According to this line of thought, there are compelling philosophical reasons to think that proofs must be central to mathematical explanation—reasons that don’t directly involve mathematical explanation-seeking practices, but that hinge on general considerations about the nature of explanation, the role of proofs in mathematics, and the like. Here I’ll focus on two fairly natural ways that such an argument might go. The first argument appeals to the history of philosophy of science. As everyone knows, the most important early works on scientific explanation in the modern tradition were (Hempel and Oppenheim ) and its sequels, which defended a view according to which explanations are arguments. (More specifically—according to the ‘deductive-nomological’ version of the theory, which is the version that’s relevant here—an explanation is a deductive argument whose premises are antecedent conditions and general laws, and whose conclusion is the fact to be explained.) If one wanted to adapt this sort of view to the mathematical setting, the natural thing would be to identify explanations with proofs. And why not give this a shot? The Hempel–Oppenheim theory was enormously popular in philosophy of science for decades, after all, and in some ways it seems even more promising as an account of mathematical explanation. I’ll consider the merits of this idea shortly. But first, why do I say that the explanations-as-arguments view seems better off in the mathematical setting? Well, recall the main objections that eventually led many philosophers of science to abandon the view. Salmon (, p. 102) describes three such problems. The first is that irrelevant information is ‘harmless to arguments but fatal to explanations’—hence cases like that of ‘John Jones’ birth control pills’ are fine as deductive inferences, but unacceptable as pieces of explanatory reasoning. The second problem is that the explanations-as-arguments paradigm seems unable to account for explanations of low-probability events. The third problem is that legitimate explanations exhibit ‘temporal asymmetry’—meaning that the events or conditions appearing in the explanans always occur before those appearing in the explanandum—whereas arguments are subject to no such constraint. Salmon’s preferred solution to these problems, which has since become thoroughly mainstream, is to view scientific explanation as a matter of identifying causes rather than simply giving deductively valid arguments. In the mathematical context, however, things look quite different. Salmon’s second and third problems are no trouble at all for the view that mathematical explanations are arguments (that is, proofs), since the relevant issues about probability and temporality simply don’t arise. The first problem is a little more complicated, but perhaps one could say that arguments containing irrelevant information don’t qualify as fully satisfactory proofs in the first place. (A good proof, after all, is a piece of reasoning that actually is or would be accepted by the mathematical community, and mathematicians aren’t fond of arguments packed with irrelevancies.) In any case, even if we had doubts about the adequacy of the explanations-as-arguments model in mathematics, there’s no obvious move available corresponding to Salmon’s turn to causation. One could perhaps try to replace causal relations with some species of metaphysical grounding or dependence, but it’s not at all clear how to do this in a plausible way. Pincock () explores a view of this sort, but I think the proposal can be shown not to work.) Prima facie, then, the Hempel–Oppenheim approach may look pretty promising as an account of mathematical explanation. And since it identifies explanations with arguments, such an approach would vindicate a type of proof chauvinism. Let me now explain why we shouldn’t be convinced by this line of thought. The first thing to note is that the Hempel–Oppenheim model isn’t primarily motivated by the idea that explanations are arguments of some sort. Hempel and Oppenheim didn’t start with this conviction, and then proceed to investigate what sort of argument an explanation might be. The real motivation for the view is rather the ‘covering law’ conception of explanation. This is the thought that [an event] is explained by subsuming it under general laws, i.e., by showing that it occurred in accordance with those laws, by virtue of the realization of certain specified antecedent conditions […] Thus […] the question ‘Why does this phenomenon happen?’ is construed as meaning ‘according to what general laws, and by virtue of what antecedent conditions does the phenomenon occur?’. (Hempel and Oppenheim , p. 136) The identification of explanations with (deductive-nomological) arguments is offered, then, as a way of making the covering law picture more precise. But the latter is really the heart of the view. Why is this point relevant to the chauvinism issue? In the first place, because the covering law conception has no plausibility whatsoever as a theory of mathematical explanation. Even if we limit our attention to proofs—and even if we assume we can make sense of ‘antecedent conditions’ and ‘general laws’ in mathematics—the covering law picture gives plainly wrong conditions for explanatoriness. Subsumption under a law isn’t necessary, because many uncontroversially explanatory proofs just don’t have this form. Consider for instance the proof of Desargues’ theorem discussed by Lange, whose explanatoriness seems rather to lie in its ‘exploit[ing] [a] feature of the given case that is similar to the remarkable feature of the theorem’ (, p. 438). (One could also consider the many explanatory proofs that succeed by transferring a problem to a geometric setting, or by making it otherwise visualizable.) And subsumption isn’t sufficient, either. If it were, then countless proofs like the following would presumably be explanatory: ‘All odd numbers are divisible by some prime number; 9 is odd; hence 9 is divisible by some prime’.10 I take it we’d like to avoid this result. Perhaps contrary to first appearances, then, the motivation for the Hempel–Oppenheim view fails to transfer in any meaningful way to the mathematical setting. The ‘covering law’ conception of explanation, which the Hempel–Oppenheim theory is supposed to formalize, is a non-starter as an account of explanatory proof. And the fault doesn’t lie just with the deductive-nomological style of argument in particular. In fact, there seems to be no interesting formal structure of any kind that’s common to all explanatory proofs. So nothing even in the spirit of the Hempel–Oppenheim view looks promising. For these reasons, even if such a view was wildly successful as a theory of scientific explanation, this would provide no obvious support for the notion that mathematical explanations are proofs. But of course the Hempel–Oppenheim view is far from wildly successful. The current consensus is rather that it ‘jams an alien picture of explanation onto the scientific phenomena […] fails to fit swathes of explanations in the sciences, and has been consequently widely rejected in the philosophy of science as the truth about scientific explanation’ (Gillett , p. 48). Indeed, it’s worth remarking that—along with the objections due to Salmon described above—a longstanding complaint is that the deductive-nomological picture wrongly precludes singular facts from serving as explanantia. As Michael Scriven (, p. 68) wrote more than fifty years ago: If you reach for a cigarette and in doing so knock over an ink bottle which then spills onto the floor, you are in an excellent position to explain to your wife […] why the carpet is stained (if you cannot clean it off fast enough). You knocked the ink bottle over. This is the explanation of the state of affairs in question, and there is no nonsense about it being in doubt because you cannot quote the laws that are involved. I think this is right, and I think the same point is well taken in the mathematical setting. Not all legitimate explanations, whether mathematical or scientific, involve the deduction of a special case from a general law. In light of these issues, it’s very hard to see how the Hempelian paradigm could provide the proof chauvinist with any encouragement. 2.2.2 An argument from philosophy of mathematics I now turn to the second philosophical argument for chauvinism. The argument comes from philosophy of mathematics, and it appeals to the supposed epistemological primacy of proofs (as compared to axioms, theorems and the like). This type of proof-centred viewpoint is defended with vigour by Rav (, p. 20), who writes, for instance, that […] proofs rather than the statement-form of theorems are the bearers of mathematical knowledge. Theorems are in a sense just tags, labels for proofs, summaries of information, headlines of news, editorial devices. The whole arsenal of mathematical methodologies, concepts, strategies and techniques for solving problems, the establishment of interconnections between theories, the systematisation of results—the entire mathematical know-how is embedded in proofs. On this sort of picture, chauvinism looks almost inevitable, since a mere theorem is presumably too slender a reed to bear the weight of being explanatory. Only proofs seem epistemologically robust enough to handle the job. In defence of his view, Rav points out that some theorems (or conjectures) have generated proofs (or proof-attempts) that are much more interesting, useful and deep than the original statements themselves, such as Fermat’s last theorem and the Goldbach conjecture. Similarly, there are statements like the continuum hypothesis that turned out to be independent of the relevant axioms (and hence neither provable nor disprovable), but whose would-be proofs led to important kinds of progress. True enough, but such examples hardly vindicate Rav’s view. All that these cases show by themselves is that some theorems are less epistemologically valuable than their proofs. It’s quite another thing to claim that theorems in general occupy a lower rung on the epistemological ladder than do proofs in general. And indeed there’s plenty of reason to deny this. Mathematicians routinely identify theorems as profound, beautiful, powerful, deep, essential, and the like. High praise for mere tags! And just as some run-of-the-mill theorems have interesting proofs, the reverse is also true. The fundamental theorem of arithmetic (FTA), for instance, is a result worthy of its name: the unique prime factorization property of the natural numbers is a highly nontrivial feature that provides a foundation for much of what goes on in number theory.11 But the proof of FTA doesn’t seem noteworthy in any way. At least, it isn’t especially deep or revelatory, and its development didn’t lead to the invention of any groundbreaking new machinery: FTA could have been (and practically was) proved by Euclid, using just the modest number-theoretic resources at his disposal. (Euclid’s lemma, which is Elements VII.30, is the key ingredient of the proof.) Plenty of other results fit the same pattern. One could mention, for instance, Ramsey’s theorem in combinatorics, the intermediate value theorem in analysis, the binomial theorem in algebra, Brouwer’s fixed-point theorem in topology, and the five lemma in category theory as results that are more important and interesting than their proofs. (See also the discussion of Morley’s triangle theorem in (Lange , pp. 252–3). This result has been called ‘spectacular’, ‘amazing’, and ‘the marvel of marvels’, but its known proofs are all notably unenlightening.) So I don’t think we can get to proof chauvinism by way of a Rav-style view about the epistemological primacy of proofs. Rav is right to insist on proof’s distinctive value, and to remind us that mathematics wouldn’t get very far without the creative stimulus provided by the search for new problem-solving methods. But it doesn’t follow that proofs are the only things worth knowing. Far from being mere tags or labels, many theorems also have great epistemological significance in their own right. Indeed, it’s puzzling why anyone would go to the trouble of devising proofs in the first place if the statements to be proved had no intrinsic intellectual worth. This thought is corroborated by the section on the goals of mathematical research in the recent Princeton Companion to Mathematics (Gowers et al. , p. 73): The object of a typical paper is to establish mathematical statements. Sometimes this is an end in itself: for example, the justification for the paper may be that it proves a conjecture that has been open for twenty years. Sometimes the mathematical statements are established in the service of a wider aim, such as helping to explain a mathematical phenomenon that is poorly understood. But either way, mathematical statements are the main currency of mathematics. Indeed. Theorems are epistemologically valuable; more specifically, they have explanatory value, as I’ve been arguing. 3 An Example: Galois Theory and Explanatory Proof I’ve now finished making the case that proof chauvinism is false. But it’s not yet clear that its falsity should be any great concern. It would be useful to know how, if at all, chauvinist assumptions have actually done harm in the theory of mathematical explanation, and how they might do more in the future. In order to get clearer about the perils of chauvinism, then, let me now consider a particular case in somewhat more detail. One of the standard examples in the literature has long been Évariste Galois’s explanation of the solvability of polynomial equations. The case deserves the attention it gets; Galois’s work was a major explanatory achievement, and a watershed moment in the history of mathematics. I’ll argue, however, that explanatory proof plays no role in this case. What’s more, the prejudice in favour of identifying mathematical explanation with explanatory proof has led to some confusions about Galois’s work. First, a brief review of what Galois theory accomplished. The oldest and most famous problem in the theory of equations involves finding the set of solutions to a given equation ‘in radicals’, that is, as a function of the equation’s coefficients involving only basic arithmetical operations and nth roots. (The quadratic equation x=−b±b2−4ac2a is a familiar example of such a solution formula.) Solving a linear equation ax+b=0 in radicals is easy; the single root is given by x=−ba. The quadratic formula, or something essentially equivalent, was known already in antiquity. But the cubic and quartic cases are much harder. General solution formulas for these equations were found only in the sixteenth century, by a laborious trial-and-error process involving complicated substitutions. Following these discoveries, mathematicians sought to understand whether and why an arbitrary polynomial (of any degree) is solvable in radicals. After centuries of limited progress, Niels Henrik Abel proved the unsolvability of the quintic in 1824, and Galois put the general problem to rest shortly thereafter. The approach he developed, now known as Galois theory, involves the study of a certain algebraic object associated with a given polynomial (namely, its ‘Galois group’, a group of permutations of the roots). Galois’s major breakthrough was the discovery that, if the Galois group of a polynomial has a certain property (also known as ‘solvability’), then the polynomial is solvable in radicals; if not, then no solution formula exists. This result is ‘Galois’s criterion for solvability’.12 To obtain a complete picture of which equations are solvable and which aren’t, Galois combined this criterion with two other results. The first is that the Galois group of an nth-degree polynomial is a subgroup of the ‘symmetric group’ Sn, that is, the group of all permutations of an n-element set. (Moreover, Sn itself is the Galois group of the ‘general’ polynomial of degree n.) The second fact is that Sn and all its subgroups are solvable for n≤4, but not for n≥5. Together, these facts imply that an arbitrary equation of degree ≤4 is always solvable in radicals, but not so for equations of higher degrees. Many mathematicians and philosophers view Galois’s accomplishment as an important case of mathematical explanation. And so it is. Unfortunately, the chauvinist preoccupation with explanatory proof has led to some mistakes in the philosophical understanding of the case. For instance, Pincock () presents a theory of what he calls ‘abstract mathematical explanation’ motivated largely by Galois theory. I won’t go into the details of Pincock’s account here. For now I only want to note that, although little is said to justify either of these assumptions, Pincock takes it for granted that the case involves an explanatory proof, and he fixes on Galois’s proof of the unsolvability of the quintic as the relevant item. (Pincock (, p. 2) then suggests that this proof is a paradigmatic example of an abstract mathematical explanation, that is, a proof that explains ‘by appeal to an entity that is more abstract than the subject-matter or topic of the theorem’.) I think this is a mistake. Galois theory isn’t explanatorily successful by virtue of containing an explanatory proof. Instead, I claim that the explanantia in this case are theorems, notably Galois’s criterion itself and his results about the solvability of symmetric groups. There are a couple of reasons to think so. For one, my proposal reflects how mathematicians actually talk about the case—they simply don’t ever, as far as I can tell, mention any proof (or any aspect of any proof) in their discussions of Galois’s explanatory achievements. Instead, they identify Galois’s theorems, or sometimes Galois theory as a whole, as the bearers of explanatory value. The following sorts of remarks are typical: [Galois] showed that the group of the general nth degree equations is the symmetric group Sn and that solvability of an equation by radicals is reflected in a group-theoretic ‘solvability’ property, possessed by S3 and S4 but not by S5. This explains why the general cubic and quartic are solvable by radicals and the general quintic is not. (Stillwell , p. 58) The group of the general equation of the nth degree is the symmetric group [Sn] whose factors of composition [for n = 3] are 2, 3; for n = 4 they are 2, 3, 2, 2… all of them prime; this is the reason why the general equations of the third and fourth degree are solvable by radicals.13 (Bolza , pp. 138–9) In Section 2.1, we show that if the group G is solvable, then the elements of the field P are representable by radicals through the elements of the invariant subfield K of G […] When P is the field of rational functions of n variables, G is the symmetric group acting by permutations of the variables, and K is the subfield of symmetric functions of n variables, this result provides an explanation for the fact that algebraic equations of degrees 2, 3 and 4 in one variable are solvable by radicals. (Khovanskii , p. 48) An algebraic equation of the form [ anxn+⋯+a1x+a0=0] is solvable by radicals if and only if its Galois group is solvable […] In view of [this theorem], the nonsolvability by radicals of the general polynomial equation of degree ≥5 is then explained by the following result […] The symmetric group Sn is solvable if and only if n < 5. (Pantea et al. , p. 425) The quadratic formula for polynomials of second degree […] holds that an equation of the form ax2+bx+c=0 has two solutions […] Galois theory explains why there is no comparable formula for equations of degree 5 and higher. (Nadis and Yau , p. 170) So the mathematical literature provides no support for a proof-chauvinist interpretation of the Galois theory case. But it provides ample support for the idea that Galois’s theorems are explanatory. (Pincock (, p. 1) claims that there’s ‘considerable evidence that practitioners consider [Galois’s unsolvability proof] to be more explanatory than its predecessors’, but none of the sources he cites mentions anything about the proof; all of them talk only about Galois’s ideas or Galois theory in general.) In any case, the suggestion that a proof was Galois’s main explanatory contribution is problematic by itself. For one, as Leo Corry (, p. 26) observes, ‘Galois’s writings were highly obscure and difficult, and his proofs contained many gaps that needed to be filled’. Presumably, an argument as problematic and incomplete as the one Galois actually gave is a poor candidate for an explanatory proof. Presumably, also, this is why Pincock presents a modern field-theoretic version of the proof of Galois’s criterion, even though the reasoning is substantially different from what Galois himself could have had in mind. But this line of thought leads in some troubling directions. If we accept chauvinism, and if we also admit that Galois’s original proof was unexplanatory, then we apparently have to say that Galois’s work contained little or nothing of explanatory value. This is an unappealing view, and I doubt that Pincock would want to accept it. On the other hand, if we’re willing to bite the bullet and deny that Galois explained anything, it follows that a genuinely explanatory proof of Galois’s criterion appeared at some point after the 1830s and before the present day. Which version of the proof was this, exactly? (Or, if we think of explanatoriness as a matter of degree, what was the first reasonably explanatory version of the proof?) Although perhaps not unanswerable, these questions are at least uncomfortable, and Pincock says little to suggest how he might either respond to or avoid them. By contrast, the idea that Galois’s achievement was to prove a number of explanatory theorems suffers from none of these difficulties. For one, as we’ve seen, this proposal is squarely in line with what mathematicians actually say about the case. Those who identify specific explanantia almost invariably point to Galois’s results, rather than his proofs—in particular, they identify Galois’s criterion, and the theorems about the solvability of symmetric groups, as the bearers of explanatory value. Additionally, the view vindicates the consensus opinion that Galois achieved something of explanatory significance. After all, Galois was certainly the first to conceive of and state the theorems in question, but it’s much less clear that he discovered adequate (let alone explanatory) proofs for these theorems. Let me conclude by considering another suggestion in the chauvinist spirit, due to Lange. Like Pincock, Lange (, p. 440) thinks that Galois theory explains by virtue of containing an explanatory proof: I suggest that the distinction between an explanation and a mere proof of the quintic’s unsolvability is grounded in this result’s most striking feature: that in being unsolvable, the quintic differs from all lower-order polynomial equations (the quartic, cubic, quadratic, and linear), every one of which is solvable. In the context of this salient difference, we can ask why the [quintic] is unsolvable. Accordingly, an explanation is a proof that traces the quintic’s unsolvability to some other respect in which the quintic differs from lower-order polynomials. Therefore, Galois’s proof (unlike Abel’s, for example) explains the result. The main novel claim here is that Galois’s proof of the unsolvability of the quintic, though not Abel’s, works by identifying and exploiting some difference between fifth-degree and lower-degree equations. Hence only Galois’s proof is explanatory. This is, I think, mistaken. I can’t discuss Abel’s proof in detail here—for that, see (Pesic )—but the general idea is as follows. First Abel shows that any solution formula for an equation of degree m must have the form x=p+R1m+p2R2m+⋯+pm−1Rm−1m, where ‘ p,p2,… are finite sums of radicals and polynomials and R1m is in general an irrational function of the coefficients of the original equation’ (Pesic , p. 90). (The already-known formulas for lower-degree equations can easily be seen to have this form.) Hence, if there were a solution formula for the general quintic, it would look like x=p+R15+p2R25+p3R35+p4R45. The rest of the proof shows that this can’t occur. Abel’s main tool here is a theorem of Cauchy, which implies that R1m can have only two or five distinct values when the roots of the quintic are permuted. Abel shows that each of these possibilities leads to a contradiction; it follows that the general quintic is unsolvable. Pace Lange, this argument strikes me as ‘a proof that traces the quintic’s unsolvability to some other respect in which the quintic differs from lower-order polynomials’. The respect in question is the satisfiability of the equation x=p+R1m+p2R2m+⋯+pm−1Rm−1m for m < 5, as compared to its satisfiability for m≥5. By Lange’s criterion, then, it’s unclear why Galois’s proof should count as any more explanatory than Abel’s. 4 Conclusion The Galois theory case is interesting and important in its own right, and I think the above observations would be worth making even if nothing further was at stake. But in fact proof chauvinism has some more general philosophical risks. Let me close by mentioning a couple of them. First, theorizing about mathematical explanation under the influence of chauvinism is likely to lead to a distorted picture of the phenomena. If one is bent on finding explanatory proofs, and there are no such proofs on offer in a particular case, then one is liable to conclude that the case contains nothing of explanatory interest. But if chauvinism is false and many mathematical explanations don’t involve explanatory proofs, this approach will yield frequent false negatives. This is especially worrisome in a field in which progress still largely depends on assembling a representative stock of examples. As Mancosu () suggests, the theory of mathematical explanation will advance only when we’ve managed to ‘carefully analyze more case studies in order to get a better grasp of the varieties of mathematical explanations’. Second, proof chauvinism threatens to draw attention away from the broader epistemological contributions of other elements of mathematics. Explanation, after all, is closely linked to understanding, theory change, conceptual development, various cognitive benefits, and other phenomena of epistemological interest. So if one is convinced that proofs alone are explanatory, then one is a short step away from concluding (mistakenly) that only proofs play a meaningful role in these other phenomena. The theory of mathematical explanation is still in its infancy. But infancy is a crucial developmental phase, and an early mishap can lead to more serious problems later on. The philosophy of mathematics would do well, then, to inoculate itself against an unhealthy fixation on explanatory proofs. Footnotes 1 Near the end of the article, Steiner ([1978a], p. 148) also mentions explanations ‘of the “behavior” of a mathematical object’, and explanations obtained by regarding one mathematical object as another. It’s not clear what Steiner takes to be the explanantia in these cases. As best I can tell from Steiner’s discussion, the explanans in the first case involves a proof or at least some sort of argument. I’m unsure what the explanans in the second case is supposed to be. Steiner characterizes these cases as non-examples of ‘explanation by proof’, but it’s unclear how to interpret this remark in light of the surrounding discussion and the commitments he expresses elsewhere. 2 The comment about explanatory proof is made in the context of Steiner’s analysis of a particular example, and he doesn’t make it totally clear whether this feature of the example is supposed to generalize. But the whole discussion suggests that Steiner does endorse the generalization. Baker (), for instance, certainly reads Steiner this way. 3 For criticisms of Steiner’s view, see for example (Resnik and Kushner ; Hafner and Mancosu ; Pincock ). Baker () argues against Steiner’s account of mathematical explanations in science. Baker’s line is that some mathematical results contribute to scientific explanations even though no explanatory proofs of the results are known. (For instance, the perimeter-minimizing optimality of the hexagonal tiling of the plane partly explains why honeybees build hexagonal cells. But the only available proof of the optimality theorem is not at all explanatory.) As will become clear below, I agree with the idea that theorems without explanatory proofs can nevertheless be explanatory themselves. (Thanks to an anonymous referee for reminding me about Steiner ([1978b]) and Baker () and their relevance to the chauvinism issue.) 4 Thanks to an anonymous referee for prompting me to make this point more clear. 5 Or apparent mathematical explanations, anyway. I don’t mean to take a stand on whether each of the above explanatory claims is actually correct. 6 See (Lange , , Chapter 8) for more on Lange’s notions of mathematical coincidences and common proofs. 7 The type of context in question is one in which we find it noteworthy, or salient, that the theorem identifies some property that all its instances have in common. 8 Relatedly, an anonymous referee suggests that it may be useful to distinguish between explanations of specific facts and explanations of general theorems for the purposes of evaluating the plausibility of proof chauvinism. One might think, for instance, that we can often explain a specific fact just by citing a general theorem under which it falls. But when it comes to explaining a general theorem itself, our only recourse is usually to point to some explanatory features of its proof. Hence chauvinism might be false as a thesis about explanations of specific mathematical facts, but at least mostly true as a thesis about explanations of general results. Maybe something in the neighborhood of this view is right. But it’s impossible to say unless we’ve got some means to tell a specific fact from a general theorem, and I don’t know that there’s any good way to do this. For, of course, what seems to be a general result in one context often looks like a narrow special case from another viewpoint. Consider, for instance, the fact that all circles in the plane intersect the x-axis at most twice. Is it specific or general? On the one hand, it’s about all circles, not any one in particular. That seems to indicate generality. On the other hand, the result about circles can be viewed as a very special case of the Fundamental Theorem of Algebra. (And for that matter, the FTA is a particular case of Bézout’s theorem, which in turn ‘has many strengthenings, generalisations, and variants’ (Tao [unpublished]).) This sort of case seems very ordinary. So I seriously doubt that enough sense can be made of the specific/general distinction for it to do useful work in clarifying the scope of proof chauvinism. 9 Definitions: A graph G is t-colourable if, given a collection of t distinct colours, G’s vertices can be assigned colours in such a way that adjacent vertices never share the same colour. A graph H is a minor of a graph G if H can be obtained from G by deleting edges and vertices and by merging adjacent vertices. The notation Kt denotes the complete graph on t vertices (that is, the graph where every vertex is adjacent to all of the remaining t − 1 vertices) Km,n denotes the complete bipartite graph on m and n vertices (that is, the graph consisting of two vertex sets of sizes m and n, where each of the m vertices is adjacent to all and only the n vertices, and vice versa). 10 I don’t claim to know what a ‘general law’ of mathematics is, or what it would be if there were such things. One plausible idea is something like this: a general law is a true universal statement in which only sufficiently natural mathematical predicates appear. Since oddness and divisibility by a prime seem quite natural, the example I give would seem to involve a general law by this criterion. Another approach, suggested by an anonymous referee, is to identify general laws with axioms. This is an appealing idea, since axioms, like laws, are a special class of (typically general) truths that play a distinguished foundational and organizational role in the theories to which they belong. But this approach has problems too. One issue, noted by the referee, is that all proofs might be thought to rest ultimately on axioms, and hence to have the form of covering-law arguments. If this were right, then a covering-law theory of mathematical explanation would (wrongly) predict that all proofs are explanatory. I’m not so sure myself that all proofs should be viewed as proofs from axioms, but I do doubt that there’s any good principled way to distinguish the axiom-based proofs from the rest. Another obvious worry is that the distinction between axioms and non-axioms is relative to a choice of axiomatization. Since lots of mathematical theories can be axiomatized in more than one way, whether or not a given proof is explanatory would often turn out to depend on which statements we happened to be taking as axioms. This seems quite counterintuitive. 11 For an interesting discussion of the non-triviality and non-obviousness of FTA, see (Gowers [unpublished]). 12 A group G is solvable if it has subgroups {1}=G0<G1<⋯<Gk=G such that Gj−1 is normal in Gj, and Gj/Gj−1 is a commutative group, for j=1,…,k. 13 The condition that a group G is solvable is equivalent to the condition that G’s composition factors all have prime order. Earlier presentations of Galois theory, including, for example, Jordan’s influential Traité des Substitutions, tended to use the composition factor condition. Acknowledgements I’d like to thank two anonymous referees for this journal, Daniel Sutherland, Mahrad Almotahari, and especially Marc Lange for their excellent comments on earlier drafts. This article is part of the trio of essays making up my dissertation; I’m grateful to Lauren Woomer, and to my other committee members, Kenny Easwaran and Dave Hilbert, for the help and support they’ve given me over the course of the project. Last but not least, I wrote this article during a fellowship year at the Institute for the Humanities at the University of Illinois at Chicago, and many thanks are due to Susan Levine, Linda Vavra, the Institute staff, and my co-Graduate Fellows Lisa James, Lindsay Marshall, and Tim Soriano for making the Institute such a lovely place to work. References Artebani M. , Kondō S. [ 2011 ]: ‘ The Moduli of Curves of Genus Six and K3 Surfaces ’, Transactions of the American Mathematical Society , 363 , pp. 1445 – 62 . Google Scholar CrossRef Search ADS Baker A. [ 2010 ]: ‘ Mathematical Induction and Explanation ’, Analysis , 70 , pp. 681 – 9 . Google Scholar CrossRef Search ADS Baker A. [ 2012 ]: ‘ Science-Driven Mathematical Explanation ’, Mind , 121 , pp. 243 – 67 . Google Scholar CrossRef Search ADS Bender C. , Hook D. , Kooner K. [ 2009 ]: ‘Complex Elliptic Pendulum’, in Costin O. , Fauvet F. , Menous F. , Sauzin D. (eds), Asymptotics in Dynamics, Geometry and PDEs; Generalized Borel Summation , Pisa : Edizioni Della Normale , pp. 1 – 18 . Bolza O. [ 1891 ]: ‘ On the Theory of Substitution-Groups and Its Application to Algebraic Equations (Continued) ’, American Journal of Mathematics , 13 , pp. 97 – 144 . Google Scholar CrossRef Search ADS Brown J. R. [ 1997 ]: ‘ Proofs and Pictures ’, British Journal for the Philosophy of Science , 48 , pp. 161 – 80 . Google Scholar CrossRef Search ADS Cellucci C. [ 2008 ]: ‘ The Nature of Mathematical Explanation ’, Studies in History and Philosophy of Science , 39 , pp. 202 – 10 . Google Scholar CrossRef Search ADS Corry L. [ 2004 ]: Modern Algebra and the Rise of Mathematical Structures , Basel : Birkhäuser . Google Scholar CrossRef Search ADS Farjoun E. D. , Göbel R. , Segev Y. [ 2007 ]: ‘ Cellular Covers of Groups ’, Journal of Pure and Applied Algebra , 208 , pp. 61 – 76 . Google Scholar CrossRef Search ADS Gasarch W. [ 2014 ]: ‘Classifying Problems into Complexity Classes’, in Memon A. (ed.), Advances in Computers , Volume 95 , Cambridge, MA : Academic Press , pp. 239 – 92 . Gillett C. [ 2016 ]: Reduction and Emergence in Science and Philosophy , Cambridge : Cambridge University Press . Google Scholar CrossRef Search ADS Gowers T. [ unpublished ]: ‘Why Isn’t the Fundamental Theorem of Arithmetic Obvious?’, available at <gowers.wordpress.com/2011/11/13/why-isnt-the-fundamental-theorem-of-arithmetic-obvious/>. Gowers T. , Barrow-Green J. , Leader I. [ 2008 ]: The Princeton Companion to Mathematics , Princeton, NJ : Princeton University Press . Hafner J. , Mancosu P. [ 2005 ]: ‘The Varieties of Mathematical Explanation’, in Mancosu P. , Jørgensen K. , Pedersen S. (eds), Visualization, Explanation, and Reasoning Styles in Mathematics , Berlin : Springer , pp. 215 – 50 . Google Scholar CrossRef Search ADS Hempel C. , Oppenheim P. [ 1948 ]: ‘ Studies in the Logic of Explanation ’, Philosophy of Science , 15 , pp. 135 – 75 . Google Scholar CrossRef Search ADS Keshav S. [ 2012 ]: Mathematical Foundations of Computer Networking , Upper Saddle River, NJ : Addison-Wesley . Khovanskii A. [ 2014 ]: Topological Galois Theory: Solvability and Unsolvability of Equations in Finite Terms , Heidelberg : Springer . Lange M. [ 2009 ]: ‘ Why Proofs by Mathematical Induction Are Generally Not Explanatory ’, Analysis , 69 , pp. 203 – 11 . Google Scholar CrossRef Search ADS Lange M. [ 2010 ]: ‘ What Are Mathematical Coincidences (and Why Does It Matter)? ’, Mind , 119 , pp. 307 – 40 . Google Scholar CrossRef Search ADS Lange M. [ 2014 ]: ‘ Aspects of Mathematical Explanation: Symmetry, Unity, and Salience ’, Philosophical Review , 123 , pp. 485 – 531 . Google Scholar CrossRef Search ADS Lange M. [ 2015 ]: ‘ Explanation, Existence, and Natural Properties in Mathematics—A Case Study: Desargues’ Theorem ’, Dialectica , 69 , pp. 435 – 72 . Google Scholar CrossRef Search ADS Lange M. [ 2016 ]: Because without Cause: Non-causal Explanations in Science and Mathematics , New York : Oxford University Press . Google Scholar CrossRef Search ADS Mancosu P. [ 1999 ]: ‘ Bolzano and Cournot on Mathematical Explanation ’, Revue d’Histoire des Sciences , 52 , pp. 429 – 56 . Google Scholar CrossRef Search ADS Mancosu P. [ 2001 ]: ‘ Mathematical Explanation: Problems and Prospects ’, Topoi , 20 , pp. 97 – 117 . Google Scholar CrossRef Search ADS Mancosu P. [ 2011 ]: ‘Explanation in Mathematics’, in Zalta E. N. (ed.), The Stanford Encyclopedia of Philosophy , available at <plato.stanford.edu/archives/sum2015/entries/mathematics-explanation/>. Maor E. [ 2007 ]: The Pythagorean Theorem: A 4,000-Year History , Princeton, NJ : Princeton University Press . Nadis S. , Yau S. T. [ 2013 ]: A History in Sum: 150 Years of Mathematics at Harvard (1825–1975) , Cambridge, MA : Harvard University Press . Google Scholar CrossRef Search ADS Newman S. C. [ 2012 ]: A Classical Introduction to Galois Theory , Hoboken, NJ : John Wiley . Google Scholar CrossRef Search ADS Pantea C. , Gupta A. , Rawlings J. B. , Craciun G. [ 2014 ]: ‘The QSSA in Chemical Kinetics: As Taught and Practiced’, in Jonoska N. , Saito M. (eds), Discrete and Topological Models in Molecular Biology , Berlin : Springer , pp. 419 – 42 . Google Scholar CrossRef Search ADS Pesic P. [ 2013 ]: Abel’s Proof: An Essay on the Sources and Meaning of Mathematical Unsolvability , Cambridge, MA : MIT Press . Pincock C. [ 2015 ]: ‘ The Unsolvability of the Quintic: A Case Study in Abstract Mathematical Explanation ’, Philosophers’ Imprint , 15 , pp. 1 – 19 . Rav Y. [ 1999 ]: ‘ Why Do We Prove Theorems? ’, Philosophia Mathematica , 7 , pp. 5 – 41 . Google Scholar CrossRef Search ADS Resnik M. D. , Kushner D. [ 1987 ]: ‘ Explanation, Independence, and Realism in Mathematics ’, British Journal for the Philosophy of Science , 38 , pp. 141 – 58 . Google Scholar CrossRef Search ADS Salmon W. [ 1989 ]: Four Decades of Scientific Explanation , Pittsburgh, PA : University of Pittsburgh Press . Sandborg D. [ 1998 ]: ‘ Mathematical Explanation and the Theory of Why-Questions ’, British Journal for the Philosophy of Science , 49 , pp. 603 – 24 . Google Scholar CrossRef Search ADS Scriven M. [ 1962 ]: ‘Explanations, Predictions, and Laws’, in Feigl H. , Maxwell G. (eds), Scientific Explanation, Space, and Time , Minneapolis, MN : University of Minnesota Press , pp. 170 – 230 . Seymour P. [ 2016 ]: ‘Hadwiger’s Conjecture’, in Nash J. , Rassias M. (eds), Open Problems in Mathematics , Berlin : Springer , pp. 417 – 37 . Google Scholar CrossRef Search ADS Steiner M. [ 1978a ]: ‘ Mathematical Explanation ’, Philosophical Studies , 34 , pp. 135 – 51 . Google Scholar CrossRef Search ADS Steiner M. [ 1978b ]: ‘ Mathematics, Explanation, and Scientific Knowledge ’, Noûs , 12 , pp. 17 – 28 . Google Scholar CrossRef Search ADS Stetkær H. [ 2013 ]: Functional Equations on Groups , Singapore : World Scientific Publishing . Google Scholar CrossRef Search ADS Stillwell J. [ 1995 ]: ‘ Eisenstein’s Footnote ’, Mathematical Intelligencer , 17 , pp. 58 – 62 . Google Scholar CrossRef Search ADS Tao T. [ unpublished ]: ‘A Partial Converse to Bezout’s Theorem’, available at <terrytao.wordpress.com/tag/bezouts-theorem/>. van Fraassen B. C. [ 1980 ]: The Scientific Image , Oxford : Oxford University Press . Google Scholar CrossRef Search ADS © The Author(s) 2018. Published by Oxford University Press on behalf of British Society for the Philosophy of Science. All rights reserved. For Permissions, please email: journals.permissions@oup.com This article is published and distributed under the terms of the Oxford University Press, Standard Journals Publication Model (https://academic.oup.com/journals/pages/about_us/legal/notices) http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png The British Journal for the Philosophy of Science Oxford University Press

# Mathematical Explanation beyond Explanatory Proof

The British Journal for the Philosophy of Science, Volume Advance Article – Jan 16, 2018
23 pages    Loading next page...  /lp/ou_press/mathematical-explanation-beyond-explanatory-proof-Vpaniapdzm
Publisher
Oxford University Press
Copyright
© The Author(s) 2018. Published by Oxford University Press on behalf of British Society for the Philosophy of Science. All rights reserved. For Permissions, please email: journals.permissions@oup.com
ISSN
0007-0882
eISSN
1464-3537
D.O.I.
10.1093/bjps/axy009
Publisher site
See Article on Publisher Site

### Abstract

Abstract Much recent work on mathematical explanation has presupposed that the phenomenon involves explanatory proofs in an essential way. I argue that this view, ‘proof chauvinism’, is false. I then look in some detail at the explanation of the solvability of polynomial equations provided by Galois theory, which has often been thought to revolve around an explanatory proof. The article concludes with some general worries about the effects of chauvinism on the theory of mathematical explanation. 1 Introduction 2 Why I Am Not a Proof Chauvinist   2.1 Proof chauvinism and mathematical practice   2.2 Proof chauvinism and philosophy 3 An Example: Galois Theory and Explanatory Proof 4 Conclusion 1 Introduction Near the beginning of ‘Mathematical Explanation’—the founding document of the recent literature on the subject—Mark Steiner ([1978a], p. 135) writes: ‘Mathematical explanation exists. Mathematicians routinely distinguish proofs that merely demonstrate from proofs which explain’. Judging from his treatment of the subject in the rest of the article, Steiner seems to intend the second claim as something like an elaboration of the first, rather than as an example of one sort of mathematical explanation among others.1 That is, Steiner appears to endorse approximately the following view: Proof Chauvinism: All or most cases of mathematical explanation involve explanatory proofs in an essential way. Steiner’s ([1978b]) contemporaneous paper on mathematical explanations in science is perhaps even more explicitly committed to proof chauvinism. In that essay, Steiner ([1978b], p. 19) claims that we have a mathematical explanation of a physical phenomenon just in case ‘when we remove the physics, we remain with a mathematical explanation—of a mathematical truth’. A few lines later, Steiner seems to suggest that ‘remaining with a mathematical explanation’ amounts to obtaining an explanatory proof of the relevant theorem.2 On this view, then, an explanation of a mathematical fact just is an explanatory proof of that fact. Much has been written on the subject since Steiner’s work appeared, and his theory of mathematical explanation is no longer popular.3 For one reason or another, however, Steiner’s proof-chauvinist assumptions have taken deep root. Subsequent papers on mathematical explanation have almost invariably dealt with some issue in the theory of explanatory proofs—for instance, whether and why a particular proof explains its result (Sandborg ; Mancosu ; Lange ), whether certain general types of proof are explanatory or not (Cellucci ; Lange ; Baker ), or the factors that contribute to a proof’s being explanatory (Mancosu ; Lange ; Pincock ). Some authors admit that there might be other kinds of mathematical explanation, but they almost never say what these kinds might be or discuss specific examples. And it’s still common to see mathematical explanation in general run together with explanation-by-proof in particular, as in passages like the following: The topic of mathematical explanation seems to me a central one for an accurate understanding of mathematics. Mathematicians, as we have seen, do not simply struggle to obtain rigorous and compelling proofs. They often look for new proofs or consider old proofs unsatisfactory on account of their lack of ‘explanatoriness’. (Mancosu , p. 102) The impression given by all this is that mathematical explanations not involving explanatory proof are vanishingly rare, or not very interesting, or both. I aim to show that this view is mistaken, and importantly so. Proof chauvinism has already led to missteps in the theory of mathematical explanation, and its continued hegemony threatens to make things worse. (Hence it’s not merely, as one might have thought, that philosophers have focused on explanatory proofs just because they’re the most distinctively mathematical sort of mathematical explanation. Such an attitude might have led to an imbalanced distribution of research efforts, but it probably wouldn’t be so bad on the whole. Rather, I’ll argue that proof chauvinism has had more insidious effects—that it’s led to theoretical errors and misdiagnoses of important cases, for instance.)4 I’ll begin by considering the epistemic status of chauvinism. What sorts of reasons could there be for accepting it, as many philosophers apparently do? Neither Steiner nor anyone else, as far as I’m aware, has defended the principle explicitly, but its possible justifications seem to fall into two general categories. The first kind is something like this: We should accept chauvinism because it faithfully reflects mathematical practice. When mathematicians pursue explanations or make claims about what explains what, according to this line of thought, explanatory proofs are generally their targets. Hence, as philosophers striving to ground our theories in the realities of working mathematics, we should be chauvinists. The second sort of possible justification runs as follows: We should accept chauvinism because it has a compelling philosophical rationale. Whatever mathematicians might or might not say, the theory of explanation presents us with good reasons—perhaps emanating from general philosophy of science, or from elsewhere in the philosophy of mathematics—to think that explanatory proofs must be central to mathematical explanation. Hence, as philosophers striving to achieve a unified picture of the theoretical landscape, we should accept chauvinism. The next section discusses several arguments of the above kinds. Its conclusion is that philosophical considerations offer no support for proof chauvinism, and mathematical practice strongly suggests its falsity. The rest of the article provides some reasons for caring about the chauvinism issue. I look in some detail at the explanation of the solvability of polynomial equations provided by Galois theory, which has often been thought to revolve around an explanatory proof. I argue that this diagnosis is mistaken. The article concludes with some general worries about the effects of chauvinism on the theory of mathematical explanation. 2 Why I Am Not a Proof Chauvinist 2.1 Proof chauvinism and mathematical practice As suggested above, one reason for embracing proof chauvinism is that it might be thought to reflect mathematical practices of seeking and offering explanations. It’s not hard to see why this view might seem attractive. After all, mathematicians certainly do talk often about the explanatory virtues of various proofs (and proof methods)—the recent literature on mathematical explanation has shown at least that much beyond doubt. Generalizing from these cases, one might form the impression that proofs are the only sort of explanation that mathematicians care much about. But this impression is erroneous. Mathematicians often cite items other than proofs as the explanantia of mathematical explanations: for example, theories, diagrams and other sorts of pictures, and particular facts of various descriptions. Examples of each kind of attribution are easy to find. Here are just a few: The following theorem, which we give here without proof, provides a necessary and sufficient condition for a number to be the sum of two squares: An integer a is the sum of two squares if and only if any prime congruent to 3 (mod 4) in the prime factorization of a appears an even number of times in the factorization. This theorem explains why 12 is not the sum of two squares. (Maor , p. 224) The next lemma explains why certain degenerate cases, singled out by the condition χˇ=χ, sometimes simplify […] Let χbe a character on a group G such that χˇ=χ. If G is generated by its squares, and in particular if G is 2-divisible, then χ= 1. (Stetkær , p. 31) The fact that xm – 1 is reducible over Q […] explains why its roots do not all have the same algebraic properties over Q. (Newman , p. 92) The central limit theorem is the reason why the Gaussian distribution is the limit of the binomial distribution. (Keshav , p. 40) Complex analysis explains why the Taylor series for the function f(x)=1/(1+x2) converges in the finite domain −1<x<1 even though f(x) is smooth for all real x. (Bender et al. , p. 1) An arithmetic quotient of a bounded symmetric domain has several compactifications, that is, Satake-Baily-Borel’s, Mumford’s toroidal and Looijenga’s compactifications. A general theory explaining the relations between these types of compactifications and those of a geometric nature […] has been developed by Looijenga. (Artebani and Kondo , p. 1445) Let F be the field of rational numbers or the Galois field GF(p), where p is a prime. Let A be the underlying additive group of F. Pick an abelian group X [Then] Hom(A,X) is A-cellular. Also, the following diagram explains why the ‘evaluation at one’ map is an A-equivalence, where 1→ατ is the unique homomorphism taking 1 to ατ. (Farjoun et al. , p. 66) In these and many similar cases, we’re confronted with mathematical explanations in which proofs seem to play no obvious role.5 I think this impression is basically right. Hence I think mathematical practice lends no support to proof chauvinism. The chauvinist, however, has a number of options for trying to resist this conclusion. Let me present what I take to be the most pressing concerns; answering them will help clarify just what is and isn’t shown by examples like the above. An initial worry is whether diagrams can count as proofs, as some have argued that they can (for instance, Brown ). If so, then explanatory diagrams may just be explanatory proofs, so that these cases aren’t counterexamples to chauvinism after all. It may well be true that some diagrams are proofs. But the claim that every explanatory diagram is a proof is much stronger, and there’s no obvious reason to accept it. For instance, it’s doubtful that the commutative diagram above, taken by itself, proves anything about the map ev. (Compare the way in which, for example, an appropriate dot diagram might be thought to prove that the sum of the first n odd numbers is n2.) At any rate, even if it’s true that all explanatory diagrams are proofs, this doesn’t put any pressure on the other types of example. Similarly, it’s unclear whether claims about explanatory theories might not ultimately depend on facts about explanatory proofs. At the very least, it’s hard to deny that true claims about explanation-by-theories are sometimes grounded in facts about explanation-by-components-of-theories. In the empirical sciences, these components are sometimes facts or laws falling under the purview of the theory in question. Hence we might think that biological theory explains why the fox population increased at time t in virtue of the fact that the Lotka–Volterra equations explain why the fox population increased at t. (Compare van Fraassen’s (, p. 101) proposal that the claim ‘theory T explains fact F ’ is equivalent to the claim ‘there are facts which explain F relative to T ’.) In the mathematical setting, couldn’t the explanatory components of T just as well be proofs? I don’t deny that some claims about explanation-by-theories in mathematics are true in virtue of facts about explanation-by-proofs. But why think this is the typical case? Assuming that, say, theorems are often explanatory in their own right, we should expect many explanations-by-theory to rest instead on explanations-by-constituent-theorems. And perhaps there are cases in which theories are ‘irreducibly’ explanatory—that is, explanatory in a way that isn’t grounded in the explanatoriness of any of their components. Maybe so. Still, I admit that it’s usually hard to tell exactly what’s behind a given claim of the form ‘theory T explains why p’. In the above cases, and in most others, there isn’t any straightforward way to determine whether T is supposed to be explanatory in virtue of containing an explanatory proof, or an explanatory theorem, or an explanatory something-else, or in its own right. Since the cases of diagrams and theories involve the complications just discussed, and since they’re probably less important anyway, I’ll mostly set them aside in what follows. My focus for the rest of the article will largely be on the explanatoriness of theorems and other mathematical facts. (But I continue to maintain that explanatory diagrams and theories can’t be generally assimilated to explanatory proofs.) Another objection: Why assume that claims like the above should be taken literally? Mathematicians’ talk about explanations and reasons in such contexts, one might think, could just as well be understood as innocent façons de parler with no deep philosophical meaning. For instance, claims like ‘theorem T explains why p’ may just be stylized ways of expressing the thought that T implies p. As before, there’s no point in denying that some authors may sometimes use explanatory language in this way. But neither is there any reason to think this is always or usually the case. More to the point: if this suggestion is supposed to help the proof chauvinist, then she’d have to maintain that mathematicians generally speak literally when they refer to explanatory proofs, but non-literally when they make other sorts of explanatory claims. This idea seems quite ad hoc, and I can’t see how anyone would try to defend it. I’ve saved the next concern for last because it’s weightier than the others, and the response it requires is relatively involved. The worry is this: given only a list of decontextualized claims like those above, it’s difficult to tell whether proofs are in fact making some important explanatory contribution that the quoted text doesn’t make obvious. For instance, when mathematicians say things like ‘theorem T explains why p’, this might be a loose or elliptical way of pointing to the explanatoriness of some proof of p from T—one that’s offered or indicated elsewhere in the text, perhaps. Certainly this is possible, and perhaps it’s the right way to understand some cases. But typically there’s no evidence that anything like this is going on. If the explanations in the above cases involved proofs in some significant way, then one would expect the explanatory features of those proofs to be highlighted at some point during the proof presentations or in the surrounding discussions. Otherwise it’s hard to see what the point of the explanatory claims would be: if the intention is to communicate something about a proof, why say something about a theorem instead, and then fail to draw the reader’s attention to the features of the proof that one had in mind? This would be a strange and unhelpful expository choice, to say the least. Thus, if nothing about any proof is flagged as explanatory anywhere in the relevant text, I take this to be good evidence that no claim about explanatory proofs is intended. And this is in fact the situation in cases like the ones I’ve offered. There’s just no suggestion in these cases that an explanatory proof is somehow lying behind an assertion about an explanatory proposition, or diagram, or theory. Indeed, in some cases a proof isn’t so much as gestured at. This suggests that the examples in question are just what they appear to be: instances of mathematical explanation that don’t involve explanatory proofs. But perhaps this is too quick. Marc Lange has recently proposed a way of thinking about this issue that’s congenial to chauvinism, but that doesn’t seem to require that an explanatory proof be flagged in the way I’ve suggested. Lange’s view isn’t crudely chauvinist in the sense that it denies explanatory power to anything other than proofs. In fact it deserves credit for being, as far as I know, the only account of mathematical explanation that acknowledges that some theorems are genuinely explanatory. Regarding d’Alembert’s theorem on roots of polynomials, for instance, Lange (, pp. 241–2) writes: Why is it that in all of the cases I have examined of polynomials with real coefficients, their nonreal roots all fall into complex-conjugate pairs? Is it a coincidence, or are they all like that? […] In fact, as I have shown, d’Alembert’s theorem is the explanation; any polynomial with exclusively real coefficients has all of its nonreal roots coming in complex-conjugate pairs. Here we have a mathematical explanation that consists not of a proof, but merely of a theorem. So far I’m happy to agree. As it turns out, however, Lange’s theory about the nature of explanation-by-theorems is still chauvinist at heart. For Lange (, p. 345), ‘A theorem can explain [one of its instances] only if the theorem is no coincidence and hence only if it has a certain kind of proof’. The kind of proof in question is what Lange (, p. 287) calls a ‘common proof’ of all the theorem’s cases—that is, a proof that exploits some respect in which the cases are alike, and that ‘proceed[s] from there to arrive at the result by treating all of the (classes of) cases in exactly the same way’.6 Such proofs, Lange thinks, are necessarily explanatory, at least in the appropriate context.7 So even though he recognizes that some theorems genuinely explain, his proposal implies that the explanatory power of a theorem derives from the explanatory power of a proof. (If this is the case, why are the relevant features of the relevant proofs not always explicitly pointed out? Perhaps Lange would say that his theory is tacitly understood by mathematicians, and assumed to be understood by their readers. So when someone writes ‘theorem T explains why p’, it’s supposed to go without saying that this means ‘T has a “common proof” that exploits some respect in which its instances, including p, are all alike’.) There are a few things to say in response to Lange’s view. First of all, his account only applies to theorems that explain their instances by subsuming them under a more general fact. But not all explanatory theorems work this way.8 For instance, in the third example given above, the fact that the roots of xm − 1 don’t have all the same algebraic properties over Q isn’t an instance of the fact that xm − 1 is reducible over Q. And yet the latter fact is supposed to explain the former. So even if Lange is right, his account only applies to a limited class of explanations-by-theorems, and there’s no obvious way to generalize the proposal to cover other cases. So the strategy leads only to a partial vindication of chauvinism at best. Second, it’s doubtful whether Lange’s view is in fact correct. Consider that mathematicians also make claims about what a theorem would explain if it were true, even though its truth value is actually unknown, and hence even though no proof yet exists. For instance, in his discussion of the current state of evidence for P ≠ NP, William Gasarch (, p. 258) writes: If a theory explains much data, then perhaps the theory is true […] Are there a set of random facts that P ≠ NP would help explain? Yes. [For example,] Chvatal in 1979 showed that there is an algorithm for Set Cover that returns a cover of size (lnn)×OPT where OPT is the best one could do. Moshkovitz in 2011 proved that, assuming P ≠ NP, this approximation cannot be improved. Why can’t we do better than lnn? Perhaps because P ≠ NP. If this was the only example it would not be compelling. But there are many such pairs where assuming P ≠ NP would explain why we have approached these limits. This sort of case makes it hard to see how chauvinism, or Lange’s account in particular, could be right. We have no proof of P ≠ NP. Nor does anyone have much idea what a proof of P ≠ NP might look like. And yet it seems perfectly natural to say that P ≠ NP would explain all sorts of results in computability theory if it turned out to be true. Of course, this particular example doesn’t involve a case of explanation-by-subsumption, but similar remarks apply to cases that do. Consider, for instance, the famous Hadwiger conjecture in graph theory, which says that, for all t≥0, a graph is t-colourable if it has no Kt+1 minor.9 The conjecture is equivalent to the four-colour theorem when t = 4, but the general case is considered extremely difficult, and again nobody has much idea what to expect from a proof. Nevertheless, many mathematicians feel that the Hadwiger conjecture, if true, would explain the four-colour theorem. As Paul Seymour (, pp. 417–18.) writes: The four-colour conjecture (or theorem as it became in 1976) […] was the central open problem in graph theory for a hundred years; and its proof is still not satisfying, requiring as it does the extensive use of a computer. (Let us call it the 4CT.) We would very much like to know the ‘real’ reason the 4CT is true; what exactly is it about planarity that implies that four colours suffice? […] By the Kuratowski–Wagner theorem, planar graphs are precisely the graphs that do not contain K5 or K3, 3 as a minor; so the 4CT says that every graph with no K5 or K3, 3 minor is 4-colourable. If we are searching for the ‘real’ reason for the four-colour theorem, then it is natural to exclude K5 here, because it is not four-colourable; but why are we excluding K3, 3? What if we just exclude K5, are all graphs with no K5 minor four-colourable? And does the analogous statement hold if we change K5 to Kt+1 and four-colouring to t-colouring? That conjecture was posed by Hadwiger in 1943 and is still open. Seymour’s discussion strongly suggests that, if the Hadwiger conjecture turned out to be true, then it would explain (that is, give ‘the real reason’ for) the four-colour theorem. But neither Seymour nor anyone else is in a position to guess whether the conjecture has a ‘common proof’ in Lange’s sense. And even if there turned out to be no such proof, there’s no reason to think this would change anybody’s assessment of the situation. So it seems that the question whether a Langean common proof exists is irrelevant to the question whether the conjecture would be explanatory. Moreover, this is precisely the type of case that Lange’s account is designed to handle, since the four-colour theorem is a particular case of the Hadwiger conjecture. Hence Lange’s account appears not to work even for cases of explanation by subsumption under a theorem. I conclude that the verdict reached earlier was the right one. Many theorems are explanatory in a way that doesn’t involve or depend on their having explanatory proofs. So the first strategy for defending proof chauvinism seems to fail. Mathematical practice offers no support for the claim that explanatory proofs are at the centre of most instances of mathematical explanation. On the contrary, mathematicians regularly identify particular facts (as well as things like theories and diagrams) as explanantia, and they do so in ways that leave proofs entirely out of the picture. 2.2 Proof chauvinism and philosophy 2.2.1 An argument from philosophy of science I turn now to the second possible strategy for defending chauvinism. According to this line of thought, there are compelling philosophical reasons to think that proofs must be central to mathematical explanation—reasons that don’t directly involve mathematical explanation-seeking practices, but that hinge on general considerations about the nature of explanation, the role of proofs in mathematics, and the like. Here I’ll focus on two fairly natural ways that such an argument might go. The first argument appeals to the history of philosophy of science. As everyone knows, the most important early works on scientific explanation in the modern tradition were (Hempel and Oppenheim ) and its sequels, which defended a view according to which explanations are arguments. (More specifically—according to the ‘deductive-nomological’ version of the theory, which is the version that’s relevant here—an explanation is a deductive argument whose premises are antecedent conditions and general laws, and whose conclusion is the fact to be explained.) If one wanted to adapt this sort of view to the mathematical setting, the natural thing would be to identify explanations with proofs. And why not give this a shot? The Hempel–Oppenheim theory was enormously popular in philosophy of science for decades, after all, and in some ways it seems even more promising as an account of mathematical explanation. I’ll consider the merits of this idea shortly. But first, why do I say that the explanations-as-arguments view seems better off in the mathematical setting? Well, recall the main objections that eventually led many philosophers of science to abandon the view. Salmon (, p. 102) describes three such problems. The first is that irrelevant information is ‘harmless to arguments but fatal to explanations’—hence cases like that of ‘John Jones’ birth control pills’ are fine as deductive inferences, but unacceptable as pieces of explanatory reasoning. The second problem is that the explanations-as-arguments paradigm seems unable to account for explanations of low-probability events. The third problem is that legitimate explanations exhibit ‘temporal asymmetry’—meaning that the events or conditions appearing in the explanans always occur before those appearing in the explanandum—whereas arguments are subject to no such constraint. Salmon’s preferred solution to these problems, which has since become thoroughly mainstream, is to view scientific explanation as a matter of identifying causes rather than simply giving deductively valid arguments. In the mathematical context, however, things look quite different. Salmon’s second and third problems are no trouble at all for the view that mathematical explanations are arguments (that is, proofs), since the relevant issues about probability and temporality simply don’t arise. The first problem is a little more complicated, but perhaps one could say that arguments containing irrelevant information don’t qualify as fully satisfactory proofs in the first place. (A good proof, after all, is a piece of reasoning that actually is or would be accepted by the mathematical community, and mathematicians aren’t fond of arguments packed with irrelevancies.) In any case, even if we had doubts about the adequacy of the explanations-as-arguments model in mathematics, there’s no obvious move available corresponding to Salmon’s turn to causation. One could perhaps try to replace causal relations with some species of metaphysical grounding or dependence, but it’s not at all clear how to do this in a plausible way. Pincock () explores a view of this sort, but I think the proposal can be shown not to work.) Prima facie, then, the Hempel–Oppenheim approach may look pretty promising as an account of mathematical explanation. And since it identifies explanations with arguments, such an approach would vindicate a type of proof chauvinism. Let me now explain why we shouldn’t be convinced by this line of thought. The first thing to note is that the Hempel–Oppenheim model isn’t primarily motivated by the idea that explanations are arguments of some sort. Hempel and Oppenheim didn’t start with this conviction, and then proceed to investigate what sort of argument an explanation might be. The real motivation for the view is rather the ‘covering law’ conception of explanation. This is the thought that [an event] is explained by subsuming it under general laws, i.e., by showing that it occurred in accordance with those laws, by virtue of the realization of certain specified antecedent conditions […] Thus […] the question ‘Why does this phenomenon happen?’ is construed as meaning ‘according to what general laws, and by virtue of what antecedent conditions does the phenomenon occur?’. (Hempel and Oppenheim , p. 136) The identification of explanations with (deductive-nomological) arguments is offered, then, as a way of making the covering law picture more precise. But the latter is really the heart of the view. Why is this point relevant to the chauvinism issue? In the first place, because the covering law conception has no plausibility whatsoever as a theory of mathematical explanation. Even if we limit our attention to proofs—and even if we assume we can make sense of ‘antecedent conditions’ and ‘general laws’ in mathematics—the covering law picture gives plainly wrong conditions for explanatoriness. Subsumption under a law isn’t necessary, because many uncontroversially explanatory proofs just don’t have this form. Consider for instance the proof of Desargues’ theorem discussed by Lange, whose explanatoriness seems rather to lie in its ‘exploit[ing] [a] feature of the given case that is similar to the remarkable feature of the theorem’ (, p. 438). (One could also consider the many explanatory proofs that succeed by transferring a problem to a geometric setting, or by making it otherwise visualizable.) And subsumption isn’t sufficient, either. If it were, then countless proofs like the following would presumably be explanatory: ‘All odd numbers are divisible by some prime number; 9 is odd; hence 9 is divisible by some prime’.10 I take it we’d like to avoid this result. Perhaps contrary to first appearances, then, the motivation for the Hempel–Oppenheim view fails to transfer in any meaningful way to the mathematical setting. The ‘covering law’ conception of explanation, which the Hempel–Oppenheim theory is supposed to formalize, is a non-starter as an account of explanatory proof. And the fault doesn’t lie just with the deductive-nomological style of argument in particular. In fact, there seems to be no interesting formal structure of any kind that’s common to all explanatory proofs. So nothing even in the spirit of the Hempel–Oppenheim view looks promising. For these reasons, even if such a view was wildly successful as a theory of scientific explanation, this would provide no obvious support for the notion that mathematical explanations are proofs. But of course the Hempel–Oppenheim view is far from wildly successful. The current consensus is rather that it ‘jams an alien picture of explanation onto the scientific phenomena […] fails to fit swathes of explanations in the sciences, and has been consequently widely rejected in the philosophy of science as the truth about scientific explanation’ (Gillett , p. 48). Indeed, it’s worth remarking that—along with the objections due to Salmon described above—a longstanding complaint is that the deductive-nomological picture wrongly precludes singular facts from serving as explanantia. As Michael Scriven (, p. 68) wrote more than fifty years ago: If you reach for a cigarette and in doing so knock over an ink bottle which then spills onto the floor, you are in an excellent position to explain to your wife […] why the carpet is stained (if you cannot clean it off fast enough). You knocked the ink bottle over. This is the explanation of the state of affairs in question, and there is no nonsense about it being in doubt because you cannot quote the laws that are involved. I think this is right, and I think the same point is well taken in the mathematical setting. Not all legitimate explanations, whether mathematical or scientific, involve the deduction of a special case from a general law. In light of these issues, it’s very hard to see how the Hempelian paradigm could provide the proof chauvinist with any encouragement. 2.2.2 An argument from philosophy of mathematics I now turn to the second philosophical argument for chauvinism. The argument comes from philosophy of mathematics, and it appeals to the supposed epistemological primacy of proofs (as compared to axioms, theorems and the like). This type of proof-centred viewpoint is defended with vigour by Rav (, p. 20), who writes, for instance, that […] proofs rather than the statement-form of theorems are the bearers of mathematical knowledge. Theorems are in a sense just tags, labels for proofs, summaries of information, headlines of news, editorial devices. The whole arsenal of mathematical methodologies, concepts, strategies and techniques for solving problems, the establishment of interconnections between theories, the systematisation of results—the entire mathematical know-how is embedded in proofs. On this sort of picture, chauvinism looks almost inevitable, since a mere theorem is presumably too slender a reed to bear the weight of being explanatory. Only proofs seem epistemologically robust enough to handle the job. In defence of his view, Rav points out that some theorems (or conjectures) have generated proofs (or proof-attempts) that are much more interesting, useful and deep than the original statements themselves, such as Fermat’s last theorem and the Goldbach conjecture. Similarly, there are statements like the continuum hypothesis that turned out to be independent of the relevant axioms (and hence neither provable nor disprovable), but whose would-be proofs led to important kinds of progress. True enough, but such examples hardly vindicate Rav’s view. All that these cases show by themselves is that some theorems are less epistemologically valuable than their proofs. It’s quite another thing to claim that theorems in general occupy a lower rung on the epistemological ladder than do proofs in general. And indeed there’s plenty of reason to deny this. Mathematicians routinely identify theorems as profound, beautiful, powerful, deep, essential, and the like. High praise for mere tags! And just as some run-of-the-mill theorems have interesting proofs, the reverse is also true. The fundamental theorem of arithmetic (FTA), for instance, is a result worthy of its name: the unique prime factorization property of the natural numbers is a highly nontrivial feature that provides a foundation for much of what goes on in number theory.11 But the proof of FTA doesn’t seem noteworthy in any way. At least, it isn’t especially deep or revelatory, and its development didn’t lead to the invention of any groundbreaking new machinery: FTA could have been (and practically was) proved by Euclid, using just the modest number-theoretic resources at his disposal. (Euclid’s lemma, which is Elements VII.30, is the key ingredient of the proof.) Plenty of other results fit the same pattern. One could mention, for instance, Ramsey’s theorem in combinatorics, the intermediate value theorem in analysis, the binomial theorem in algebra, Brouwer’s fixed-point theorem in topology, and the five lemma in category theory as results that are more important and interesting than their proofs. (See also the discussion of Morley’s triangle theorem in (Lange , pp. 252–3). This result has been called ‘spectacular’, ‘amazing’, and ‘the marvel of marvels’, but its known proofs are all notably unenlightening.) So I don’t think we can get to proof chauvinism by way of a Rav-style view about the epistemological primacy of proofs. Rav is right to insist on proof’s distinctive value, and to remind us that mathematics wouldn’t get very far without the creative stimulus provided by the search for new problem-solving methods. But it doesn’t follow that proofs are the only things worth knowing. Far from being mere tags or labels, many theorems also have great epistemological significance in their own right. Indeed, it’s puzzling why anyone would go to the trouble of devising proofs in the first place if the statements to be proved had no intrinsic intellectual worth. This thought is corroborated by the section on the goals of mathematical research in the recent Princeton Companion to Mathematics (Gowers et al. , p. 73): The object of a typical paper is to establish mathematical statements. Sometimes this is an end in itself: for example, the justification for the paper may be that it proves a conjecture that has been open for twenty years. Sometimes the mathematical statements are established in the service of a wider aim, such as helping to explain a mathematical phenomenon that is poorly understood. But either way, mathematical statements are the main currency of mathematics. Indeed. Theorems are epistemologically valuable; more specifically, they have explanatory value, as I’ve been arguing. 3 An Example: Galois Theory and Explanatory Proof I’ve now finished making the case that proof chauvinism is false. But it’s not yet clear that its falsity should be any great concern. It would be useful to know how, if at all, chauvinist assumptions have actually done harm in the theory of mathematical explanation, and how they might do more in the future. In order to get clearer about the perils of chauvinism, then, let me now consider a particular case in somewhat more detail. One of the standard examples in the literature has long been Évariste Galois’s explanation of the solvability of polynomial equations. The case deserves the attention it gets; Galois’s work was a major explanatory achievement, and a watershed moment in the history of mathematics. I’ll argue, however, that explanatory proof plays no role in this case. What’s more, the prejudice in favour of identifying mathematical explanation with explanatory proof has led to some confusions about Galois’s work. First, a brief review of what Galois theory accomplished. The oldest and most famous problem in the theory of equations involves finding the set of solutions to a given equation ‘in radicals’, that is, as a function of the equation’s coefficients involving only basic arithmetical operations and nth roots. (The quadratic equation x=−b±b2−4ac2a is a familiar example of such a solution formula.) Solving a linear equation ax+b=0 in radicals is easy; the single root is given by x=−ba. The quadratic formula, or something essentially equivalent, was known already in antiquity. But the cubic and quartic cases are much harder. General solution formulas for these equations were found only in the sixteenth century, by a laborious trial-and-error process involving complicated substitutions. Following these discoveries, mathematicians sought to understand whether and why an arbitrary polynomial (of any degree) is solvable in radicals. After centuries of limited progress, Niels Henrik Abel proved the unsolvability of the quintic in 1824, and Galois put the general problem to rest shortly thereafter. The approach he developed, now known as Galois theory, involves the study of a certain algebraic object associated with a given polynomial (namely, its ‘Galois group’, a group of permutations of the roots). Galois’s major breakthrough was the discovery that, if the Galois group of a polynomial has a certain property (also known as ‘solvability’), then the polynomial is solvable in radicals; if not, then no solution formula exists. This result is ‘Galois’s criterion for solvability’.12 To obtain a complete picture of which equations are solvable and which aren’t, Galois combined this criterion with two other results. The first is that the Galois group of an nth-degree polynomial is a subgroup of the ‘symmetric group’ Sn, that is, the group of all permutations of an n-element set. (Moreover, Sn itself is the Galois group of the ‘general’ polynomial of degree n.) The second fact is that Sn and all its subgroups are solvable for n≤4, but not for n≥5. Together, these facts imply that an arbitrary equation of degree ≤4 is always solvable in radicals, but not so for equations of higher degrees. Many mathematicians and philosophers view Galois’s accomplishment as an important case of mathematical explanation. And so it is. Unfortunately, the chauvinist preoccupation with explanatory proof has led to some mistakes in the philosophical understanding of the case. For instance, Pincock () presents a theory of what he calls ‘abstract mathematical explanation’ motivated largely by Galois theory. I won’t go into the details of Pincock’s account here. For now I only want to note that, although little is said to justify either of these assumptions, Pincock takes it for granted that the case involves an explanatory proof, and he fixes on Galois’s proof of the unsolvability of the quintic as the relevant item. (Pincock (, p. 2) then suggests that this proof is a paradigmatic example of an abstract mathematical explanation, that is, a proof that explains ‘by appeal to an entity that is more abstract than the subject-matter or topic of the theorem’.) I think this is a mistake. Galois theory isn’t explanatorily successful by virtue of containing an explanatory proof. Instead, I claim that the explanantia in this case are theorems, notably Galois’s criterion itself and his results about the solvability of symmetric groups. There are a couple of reasons to think so. For one, my proposal reflects how mathematicians actually talk about the case—they simply don’t ever, as far as I can tell, mention any proof (or any aspect of any proof) in their discussions of Galois’s explanatory achievements. Instead, they identify Galois’s theorems, or sometimes Galois theory as a whole, as the bearers of explanatory value. The following sorts of remarks are typical: [Galois] showed that the group of the general nth degree equations is the symmetric group Sn and that solvability of an equation by radicals is reflected in a group-theoretic ‘solvability’ property, possessed by S3 and S4 but not by S5. This explains why the general cubic and quartic are solvable by radicals and the general quintic is not. (Stillwell , p. 58) The group of the general equation of the nth degree is the symmetric group [Sn] whose factors of composition [for n = 3] are 2, 3; for n = 4 they are 2, 3, 2, 2… all of them prime; this is the reason why the general equations of the third and fourth degree are solvable by radicals.13 (Bolza , pp. 138–9) In Section 2.1, we show that if the group G is solvable, then the elements of the field P are representable by radicals through the elements of the invariant subfield K of G […] When P is the field of rational functions of n variables, G is the symmetric group acting by permutations of the variables, and K is the subfield of symmetric functions of n variables, this result provides an explanation for the fact that algebraic equations of degrees 2, 3 and 4 in one variable are solvable by radicals. (Khovanskii , p. 48) An algebraic equation of the form [ anxn+⋯+a1x+a0=0] is solvable by radicals if and only if its Galois group is solvable […] In view of [this theorem], the nonsolvability by radicals of the general polynomial equation of degree ≥5 is then explained by the following result […] The symmetric group Sn is solvable if and only if n < 5. (Pantea et al. , p. 425) The quadratic formula for polynomials of second degree […] holds that an equation of the form ax2+bx+c=0 has two solutions […] Galois theory explains why there is no comparable formula for equations of degree 5 and higher. (Nadis and Yau , p. 170) So the mathematical literature provides no support for a proof-chauvinist interpretation of the Galois theory case. But it provides ample support for the idea that Galois’s theorems are explanatory. (Pincock (, p. 1) claims that there’s ‘considerable evidence that practitioners consider [Galois’s unsolvability proof] to be more explanatory than its predecessors’, but none of the sources he cites mentions anything about the proof; all of them talk only about Galois’s ideas or Galois theory in general.) In any case, the suggestion that a proof was Galois’s main explanatory contribution is problematic by itself. For one, as Leo Corry (, p. 26) observes, ‘Galois’s writings were highly obscure and difficult, and his proofs contained many gaps that needed to be filled’. Presumably, an argument as problematic and incomplete as the one Galois actually gave is a poor candidate for an explanatory proof. Presumably, also, this is why Pincock presents a modern field-theoretic version of the proof of Galois’s criterion, even though the reasoning is substantially different from what Galois himself could have had in mind. But this line of thought leads in some troubling directions. If we accept chauvinism, and if we also admit that Galois’s original proof was unexplanatory, then we apparently have to say that Galois’s work contained little or nothing of explanatory value. This is an unappealing view, and I doubt that Pincock would want to accept it. On the other hand, if we’re willing to bite the bullet and deny that Galois explained anything, it follows that a genuinely explanatory proof of Galois’s criterion appeared at some point after the 1830s and before the present day. Which version of the proof was this, exactly? (Or, if we think of explanatoriness as a matter of degree, what was the first reasonably explanatory version of the proof?) Although perhaps not unanswerable, these questions are at least uncomfortable, and Pincock says little to suggest how he might either respond to or avoid them. By contrast, the idea that Galois’s achievement was to prove a number of explanatory theorems suffers from none of these difficulties. For one, as we’ve seen, this proposal is squarely in line with what mathematicians actually say about the case. Those who identify specific explanantia almost invariably point to Galois’s results, rather than his proofs—in particular, they identify Galois’s criterion, and the theorems about the solvability of symmetric groups, as the bearers of explanatory value. Additionally, the view vindicates the consensus opinion that Galois achieved something of explanatory significance. After all, Galois was certainly the first to conceive of and state the theorems in question, but it’s much less clear that he discovered adequate (let alone explanatory) proofs for these theorems. Let me conclude by considering another suggestion in the chauvinist spirit, due to Lange. Like Pincock, Lange (, p. 440) thinks that Galois theory explains by virtue of containing an explanatory proof: I suggest that the distinction between an explanation and a mere proof of the quintic’s unsolvability is grounded in this result’s most striking feature: that in being unsolvable, the quintic differs from all lower-order polynomial equations (the quartic, cubic, quadratic, and linear), every one of which is solvable. In the context of this salient difference, we can ask why the [quintic] is unsolvable. Accordingly, an explanation is a proof that traces the quintic’s unsolvability to some other respect in which the quintic differs from lower-order polynomials. Therefore, Galois’s proof (unlike Abel’s, for example) explains the result. The main novel claim here is that Galois’s proof of the unsolvability of the quintic, though not Abel’s, works by identifying and exploiting some difference between fifth-degree and lower-degree equations. Hence only Galois’s proof is explanatory. This is, I think, mistaken. I can’t discuss Abel’s proof in detail here—for that, see (Pesic )—but the general idea is as follows. First Abel shows that any solution formula for an equation of degree m must have the form x=p+R1m+p2R2m+⋯+pm−1Rm−1m, where ‘ p,p2,… are finite sums of radicals and polynomials and R1m is in general an irrational function of the coefficients of the original equation’ (Pesic , p. 90). (The already-known formulas for lower-degree equations can easily be seen to have this form.) Hence, if there were a solution formula for the general quintic, it would look like x=p+R15+p2R25+p3R35+p4R45. The rest of the proof shows that this can’t occur. Abel’s main tool here is a theorem of Cauchy, which implies that R1m can have only two or five distinct values when the roots of the quintic are permuted. Abel shows that each of these possibilities leads to a contradiction; it follows that the general quintic is unsolvable. Pace Lange, this argument strikes me as ‘a proof that traces the quintic’s unsolvability to some other respect in which the quintic differs from lower-order polynomials’. The respect in question is the satisfiability of the equation x=p+R1m+p2R2m+⋯+pm−1Rm−1m for m < 5, as compared to its satisfiability for m≥5. By Lange’s criterion, then, it’s unclear why Galois’s proof should count as any more explanatory than Abel’s. 4 Conclusion The Galois theory case is interesting and important in its own right, and I think the above observations would be worth making even if nothing further was at stake. But in fact proof chauvinism has some more general philosophical risks. Let me close by mentioning a couple of them. First, theorizing about mathematical explanation under the influence of chauvinism is likely to lead to a distorted picture of the phenomena. If one is bent on finding explanatory proofs, and there are no such proofs on offer in a particular case, then one is liable to conclude that the case contains nothing of explanatory interest. But if chauvinism is false and many mathematical explanations don’t involve explanatory proofs, this approach will yield frequent false negatives. This is especially worrisome in a field in which progress still largely depends on assembling a representative stock of examples. As Mancosu () suggests, the theory of mathematical explanation will advance only when we’ve managed to ‘carefully analyze more case studies in order to get a better grasp of the varieties of mathematical explanations’. Second, proof chauvinism threatens to draw attention away from the broader epistemological contributions of other elements of mathematics. Explanation, after all, is closely linked to understanding, theory change, conceptual development, various cognitive benefits, and other phenomena of epistemological interest. So if one is convinced that proofs alone are explanatory, then one is a short step away from concluding (mistakenly) that only proofs play a meaningful role in these other phenomena. The theory of mathematical explanation is still in its infancy. But infancy is a crucial developmental phase, and an early mishap can lead to more serious problems later on. The philosophy of mathematics would do well, then, to inoculate itself against an unhealthy fixation on explanatory proofs. Footnotes 1 Near the end of the article, Steiner ([1978a], p. 148) also mentions explanations ‘of the “behavior” of a mathematical object’, and explanations obtained by regarding one mathematical object as another. It’s not clear what Steiner takes to be the explanantia in these cases. As best I can tell from Steiner’s discussion, the explanans in the first case involves a proof or at least some sort of argument. I’m unsure what the explanans in the second case is supposed to be. Steiner characterizes these cases as non-examples of ‘explanation by proof’, but it’s unclear how to interpret this remark in light of the surrounding discussion and the commitments he expresses elsewhere. 2 The comment about explanatory proof is made in the context of Steiner’s analysis of a particular example, and he doesn’t make it totally clear whether this feature of the example is supposed to generalize. But the whole discussion suggests that Steiner does endorse the generalization. Baker (), for instance, certainly reads Steiner this way. 3 For criticisms of Steiner’s view, see for example (Resnik and Kushner ; Hafner and Mancosu ; Pincock ). Baker () argues against Steiner’s account of mathematical explanations in science. Baker’s line is that some mathematical results contribute to scientific explanations even though no explanatory proofs of the results are known. (For instance, the perimeter-minimizing optimality of the hexagonal tiling of the plane partly explains why honeybees build hexagonal cells. But the only available proof of the optimality theorem is not at all explanatory.) As will become clear below, I agree with the idea that theorems without explanatory proofs can nevertheless be explanatory themselves. (Thanks to an anonymous referee for reminding me about Steiner ([1978b]) and Baker () and their relevance to the chauvinism issue.) 4 Thanks to an anonymous referee for prompting me to make this point more clear. 5 Or apparent mathematical explanations, anyway. I don’t mean to take a stand on whether each of the above explanatory claims is actually correct. 6 See (Lange , , Chapter 8) for more on Lange’s notions of mathematical coincidences and common proofs. 7 The type of context in question is one in which we find it noteworthy, or salient, that the theorem identifies some property that all its instances have in common. 8 Relatedly, an anonymous referee suggests that it may be useful to distinguish between explanations of specific facts and explanations of general theorems for the purposes of evaluating the plausibility of proof chauvinism. One might think, for instance, that we can often explain a specific fact just by citing a general theorem under which it falls. But when it comes to explaining a general theorem itself, our only recourse is usually to point to some explanatory features of its proof. Hence chauvinism might be false as a thesis about explanations of specific mathematical facts, but at least mostly true as a thesis about explanations of general results. Maybe something in the neighborhood of this view is right. But it’s impossible to say unless we’ve got some means to tell a specific fact from a general theorem, and I don’t know that there’s any good way to do this. For, of course, what seems to be a general result in one context often looks like a narrow special case from another viewpoint. Consider, for instance, the fact that all circles in the plane intersect the x-axis at most twice. Is it specific or general? On the one hand, it’s about all circles, not any one in particular. That seems to indicate generality. On the other hand, the result about circles can be viewed as a very special case of the Fundamental Theorem of Algebra. (And for that matter, the FTA is a particular case of Bézout’s theorem, which in turn ‘has many strengthenings, generalisations, and variants’ (Tao [unpublished]).) This sort of case seems very ordinary. So I seriously doubt that enough sense can be made of the specific/general distinction for it to do useful work in clarifying the scope of proof chauvinism. 9 Definitions: A graph G is t-colourable if, given a collection of t distinct colours, G’s vertices can be assigned colours in such a way that adjacent vertices never share the same colour. A graph H is a minor of a graph G if H can be obtained from G by deleting edges and vertices and by merging adjacent vertices. The notation Kt denotes the complete graph on t vertices (that is, the graph where every vertex is adjacent to all of the remaining t − 1 vertices) Km,n denotes the complete bipartite graph on m and n vertices (that is, the graph consisting of two vertex sets of sizes m and n, where each of the m vertices is adjacent to all and only the n vertices, and vice versa). 10 I don’t claim to know what a ‘general law’ of mathematics is, or what it would be if there were such things. One plausible idea is something like this: a general law is a true universal statement in which only sufficiently natural mathematical predicates appear. Since oddness and divisibility by a prime seem quite natural, the example I give would seem to involve a general law by this criterion. Another approach, suggested by an anonymous referee, is to identify general laws with axioms. This is an appealing idea, since axioms, like laws, are a special class of (typically general) truths that play a distinguished foundational and organizational role in the theories to which they belong. But this approach has problems too. One issue, noted by the referee, is that all proofs might be thought to rest ultimately on axioms, and hence to have the form of covering-law arguments. If this were right, then a covering-law theory of mathematical explanation would (wrongly) predict that all proofs are explanatory. I’m not so sure myself that all proofs should be viewed as proofs from axioms, but I do doubt that there’s any good principled way to distinguish the axiom-based proofs from the rest. Another obvious worry is that the distinction between axioms and non-axioms is relative to a choice of axiomatization. Since lots of mathematical theories can be axiomatized in more than one way, whether or not a given proof is explanatory would often turn out to depend on which statements we happened to be taking as axioms. This seems quite counterintuitive. 11 For an interesting discussion of the non-triviality and non-obviousness of FTA, see (Gowers [unpublished]). 12 A group G is solvable if it has subgroups {1}=G0<G1<⋯<Gk=G such that Gj−1 is normal in Gj, and Gj/Gj−1 is a commutative group, for j=1,…,k. 13 The condition that a group G is solvable is equivalent to the condition that G’s composition factors all have prime order. Earlier presentations of Galois theory, including, for example, Jordan’s influential Traité des Substitutions, tended to use the composition factor condition. Acknowledgements I’d like to thank two anonymous referees for this journal, Daniel Sutherland, Mahrad Almotahari, and especially Marc Lange for their excellent comments on earlier drafts. This article is part of the trio of essays making up my dissertation; I’m grateful to Lauren Woomer, and to my other committee members, Kenny Easwaran and Dave Hilbert, for the help and support they’ve given me over the course of the project. Last but not least, I wrote this article during a fellowship year at the Institute for the Humanities at the University of Illinois at Chicago, and many thanks are due to Susan Levine, Linda Vavra, the Institute staff, and my co-Graduate Fellows Lisa James, Lindsay Marshall, and Tim Soriano for making the Institute such a lovely place to work. References Artebani M. , Kondō S. [ 2011 ]: ‘ The Moduli of Curves of Genus Six and K3 Surfaces ’, Transactions of the American Mathematical Society , 363 , pp. 1445 – 62 . Google Scholar CrossRef Search ADS Baker A. [ 2010 ]: ‘ Mathematical Induction and Explanation ’, Analysis , 70 , pp. 681 – 9 . Google Scholar CrossRef Search ADS Baker A. [ 2012 ]: ‘ Science-Driven Mathematical Explanation ’, Mind , 121 , pp. 243 – 67 . Google Scholar CrossRef Search ADS Bender C. , Hook D. , Kooner K. [ 2009 ]: ‘Complex Elliptic Pendulum’, in Costin O. , Fauvet F. , Menous F. , Sauzin D. (eds), Asymptotics in Dynamics, Geometry and PDEs; Generalized Borel Summation , Pisa : Edizioni Della Normale , pp. 1 – 18 . Bolza O. [ 1891 ]: ‘ On the Theory of Substitution-Groups and Its Application to Algebraic Equations (Continued) ’, American Journal of Mathematics , 13 , pp. 97 – 144 . Google Scholar CrossRef Search ADS Brown J. R. [ 1997 ]: ‘ Proofs and Pictures ’, British Journal for the Philosophy of Science , 48 , pp. 161 – 80 . Google Scholar CrossRef Search ADS Cellucci C. [ 2008 ]: ‘ The Nature of Mathematical Explanation ’, Studies in History and Philosophy of Science , 39 , pp. 202 – 10 . Google Scholar CrossRef Search ADS Corry L. [ 2004 ]: Modern Algebra and the Rise of Mathematical Structures , Basel : Birkhäuser . Google Scholar CrossRef Search ADS Farjoun E. D. , Göbel R. , Segev Y. [ 2007 ]: ‘ Cellular Covers of Groups ’, Journal of Pure and Applied Algebra , 208 , pp. 61 – 76 . Google Scholar CrossRef Search ADS Gasarch W. [ 2014 ]: ‘Classifying Problems into Complexity Classes’, in Memon A. (ed.), Advances in Computers , Volume 95 , Cambridge, MA : Academic Press , pp. 239 – 92 . Gillett C. [ 2016 ]: Reduction and Emergence in Science and Philosophy , Cambridge : Cambridge University Press . Google Scholar CrossRef Search ADS Gowers T. [ unpublished ]: ‘Why Isn’t the Fundamental Theorem of Arithmetic Obvious?’, available at <gowers.wordpress.com/2011/11/13/why-isnt-the-fundamental-theorem-of-arithmetic-obvious/>. Gowers T. , Barrow-Green J. , Leader I. [ 2008 ]: The Princeton Companion to Mathematics , Princeton, NJ : Princeton University Press . Hafner J. , Mancosu P. [ 2005 ]: ‘The Varieties of Mathematical Explanation’, in Mancosu P. , Jørgensen K. , Pedersen S. (eds), Visualization, Explanation, and Reasoning Styles in Mathematics , Berlin : Springer , pp. 215 – 50 . Google Scholar CrossRef Search ADS Hempel C. , Oppenheim P. [ 1948 ]: ‘ Studies in the Logic of Explanation ’, Philosophy of Science , 15 , pp. 135 – 75 . Google Scholar CrossRef Search ADS Keshav S. [ 2012 ]: Mathematical Foundations of Computer Networking , Upper Saddle River, NJ : Addison-Wesley . Khovanskii A. [ 2014 ]: Topological Galois Theory: Solvability and Unsolvability of Equations in Finite Terms , Heidelberg : Springer . Lange M. [ 2009 ]: ‘ Why Proofs by Mathematical Induction Are Generally Not Explanatory ’, Analysis , 69 , pp. 203 – 11 . Google Scholar CrossRef Search ADS Lange M. [ 2010 ]: ‘ What Are Mathematical Coincidences (and Why Does It Matter)? ’, Mind , 119 , pp. 307 – 40 . Google Scholar CrossRef Search ADS Lange M. [ 2014 ]: ‘ Aspects of Mathematical Explanation: Symmetry, Unity, and Salience ’, Philosophical Review , 123 , pp. 485 – 531 . Google Scholar CrossRef Search ADS Lange M. [ 2015 ]: ‘ Explanation, Existence, and Natural Properties in Mathematics—A Case Study: Desargues’ Theorem ’, Dialectica , 69 , pp. 435 – 72 . Google Scholar CrossRef Search ADS Lange M. [ 2016 ]: Because without Cause: Non-causal Explanations in Science and Mathematics , New York : Oxford University Press . Google Scholar CrossRef Search ADS Mancosu P. [ 1999 ]: ‘ Bolzano and Cournot on Mathematical Explanation ’, Revue d’Histoire des Sciences , 52 , pp. 429 – 56 . Google Scholar CrossRef Search ADS Mancosu P. [ 2001 ]: ‘ Mathematical Explanation: Problems and Prospects ’, Topoi , 20 , pp. 97 – 117 . Google Scholar CrossRef Search ADS Mancosu P. [ 2011 ]: ‘Explanation in Mathematics’, in Zalta E. N. (ed.), The Stanford Encyclopedia of Philosophy , available at <plato.stanford.edu/archives/sum2015/entries/mathematics-explanation/>. Maor E. [ 2007 ]: The Pythagorean Theorem: A 4,000-Year History , Princeton, NJ : Princeton University Press . Nadis S. , Yau S. T. [ 2013 ]: A History in Sum: 150 Years of Mathematics at Harvard (1825–1975) , Cambridge, MA : Harvard University Press . Google Scholar CrossRef Search ADS Newman S. C. [ 2012 ]: A Classical Introduction to Galois Theory , Hoboken, NJ : John Wiley . Google Scholar CrossRef Search ADS Pantea C. , Gupta A. , Rawlings J. B. , Craciun G. [ 2014 ]: ‘The QSSA in Chemical Kinetics: As Taught and Practiced’, in Jonoska N. , Saito M. (eds), Discrete and Topological Models in Molecular Biology , Berlin : Springer , pp. 419 – 42 . Google Scholar CrossRef Search ADS Pesic P. [ 2013 ]: Abel’s Proof: An Essay on the Sources and Meaning of Mathematical Unsolvability , Cambridge, MA : MIT Press . Pincock C. [ 2015 ]: ‘ The Unsolvability of the Quintic: A Case Study in Abstract Mathematical Explanation ’, Philosophers’ Imprint , 15 , pp. 1 – 19 . Rav Y. [ 1999 ]: ‘ Why Do We Prove Theorems? ’, Philosophia Mathematica , 7 , pp. 5 – 41 . Google Scholar CrossRef Search ADS Resnik M. D. , Kushner D. [ 1987 ]: ‘ Explanation, Independence, and Realism in Mathematics ’, British Journal for the Philosophy of Science , 38 , pp. 141 – 58 . Google Scholar CrossRef Search ADS Salmon W. [ 1989 ]: Four Decades of Scientific Explanation , Pittsburgh, PA : University of Pittsburgh Press . Sandborg D. [ 1998 ]: ‘ Mathematical Explanation and the Theory of Why-Questions ’, British Journal for the Philosophy of Science , 49 , pp. 603 – 24 . Google Scholar CrossRef Search ADS Scriven M. [ 1962 ]: ‘Explanations, Predictions, and Laws’, in Feigl H. , Maxwell G. (eds), Scientific Explanation, Space, and Time , Minneapolis, MN : University of Minnesota Press , pp. 170 – 230 . Seymour P. [ 2016 ]: ‘Hadwiger’s Conjecture’, in Nash J. , Rassias M. (eds), Open Problems in Mathematics , Berlin : Springer , pp. 417 – 37 . Google Scholar CrossRef Search ADS Steiner M. [ 1978a ]: ‘ Mathematical Explanation ’, Philosophical Studies , 34 , pp. 135 – 51 . Google Scholar CrossRef Search ADS Steiner M. [ 1978b ]: ‘ Mathematics, Explanation, and Scientific Knowledge ’, Noûs , 12 , pp. 17 – 28 . Google Scholar CrossRef Search ADS Stetkær H. [ 2013 ]: Functional Equations on Groups , Singapore : World Scientific Publishing . Google Scholar CrossRef Search ADS Stillwell J. [ 1995 ]: ‘ Eisenstein’s Footnote ’, Mathematical Intelligencer , 17 , pp. 58 – 62 . Google Scholar CrossRef Search ADS Tao T. [ unpublished ]: ‘A Partial Converse to Bezout’s Theorem’, available at <terrytao.wordpress.com/tag/bezouts-theorem/>. van Fraassen B. C. [ 1980 ]: The Scientific Image , Oxford : Oxford University Press . Google Scholar CrossRef Search ADS © The Author(s) 2018. Published by Oxford University Press on behalf of British Society for the Philosophy of Science. All rights reserved. For Permissions, please email: journals.permissions@oup.com This article is published and distributed under the terms of the Oxford University Press, Standard Journals Publication Model (https://academic.oup.com/journals/pages/about_us/legal/notices)

### Journal

The British Journal for the Philosophy of ScienceOxford University Press

Published: Jan 16, 2018

## You’re reading a free preview. Subscribe to read the entire article.

### DeepDyve is your personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just \$49/month

### Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

### Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

### Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

### Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods. DeepDyve

DeepDyve

### Pro

Price

FREE

\$49/month
\$360/year

Save searches from
Google Scholar,
PubMed

Create folders to
organize your research

Export folders, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off