SearcharxivSearch

arXiv subjects

Colin McLarty

Publications and source records attributed to Colin McLarty.

6 recordsLinked to original sources

On the depth of Wiles's proof of Fermat's Last Theorem

What constitutes depth in a mathematical proof? This paper addresses this foundational question through a close case study of Andrew Wiles's proof of Fermat's Last Theorem. We propose a five-criteria framework: Difficulty, Originality, Fruitfulness, Unity, and Explanatory Power. By critically examining the limitations of each criterion and the intricate interrelations among them, we show that they do not merely coexist but capture genuinely complementary aspects of proof depth. Applying this framework to Wiles's proof, we then demonstrate that its celebrated depth does not reside in any single virtue, but rather emerges from a synthesis of all five criteria. Our analysis thus offers not only a novel lens for understanding Wiles's achievement, but also a flexible framework for evaluating depth across mathematical proofs more broadly.

math.HO

The finiteness theorem for invariants of a finite group (translation of Emmy Noether's "Der Endlichkeitsatz der Invarianten endlicher Gruppen")

A translation of Emmy Noether's paper "Der Endlichkeitsatz der Invarianten endlicher Gruppen" (Mathematische Annalen, vol. 77, 1920, pages 89--92). In Noether's words, the paper gives "an entirely elementary finiteness proof---using only the theory of symmetric functions---for the invariants of a finite group, which at once supplies an actual statement of a complete system of invariants while the usual proof using the Hilbert basis theorem is only an existence proof."

math.HO

A univalent universe in finite order arithmetic

Homotopy Type Theory with a univalent universe $\,\mathcal{U}_0$ is interpreted at the strength of finite order arithmetic. We eliminate Grothendieck universes, avoid the axiom of replacement, and bound all uses of separation.

math.LO

The large structures of Grothendieck founded on finite order arithmetic

Such large-structure tools of cohomology as toposes and derived categories stay close to arithmetic in practice, yet existing foundations for them go beyond the strong set theory ZFC. We formalize the practical insight by founding the theorems of EGA and SGA, plus derived categories, at the level of finite order arithmetic. This is the weakest possible foundation for these tools since one elementary topos of sets with infinity is already this strong.

math.LO

Interpreting set theory in higher order arithmetic

A folk theorem says higher order arithmetic has the proof theoretic strength of set theory with limited power set. This paper makes the theorem precise in terms of several axiom system based on ZF.

math.LO

Zariski cohomology in second order arithmetic

The cohomology of coherent sheaves and sheaves of Abelian groups on Noetherian schemes are interpreted in second order arithmetic by means of a finiteness theorem. This finiteness theorem provably fails for the etale topology even on Noetherian schemes.

math.LO