From Finite Sets to Feynman Diagrams
| dc.creator | Baez, John C. | |
| dc.creator | Dolan, James | |
| dc.date | 2000-04-20 | |
| dc.date.accessioned | 2026-07-07T06:24:56Z | |
| dc.date.available | 2026-07-07T06:24:56Z | |
| dc.description | `Categorification' is the process of replacing equations by isomorphisms. We describe some of the ways a thoroughgoing emphasis on categorification can simplify and unify mathematics. We begin with elementary arithmetic, where the category of finite sets serves as a categorified version of the set of natural numbers, with disjoint union and Cartesian product playing the role of addition and multiplication. We sketch how categorifying the integers leads naturally to the infinite loop space Omega^infinity S^infinity, and how categorifying the positive rationals leads naturally to a notion of the `homotopy cardinality' of a tame space. Then we show how categorifying formal power series leads to Joyal's `especes des structures', or `structure types'. We also describe a useful generalization of structure types called `stuff types'. There is an inner product of stuff types that makes the category of stuff types into a categorified version of the Hilbert space of the quantized harmonic oscillator. We conclude by sketching how this idea gives a nice explanation of the combinatorics of Feynman diagrams. | |
| dc.description | 30 pages LaTeX, 5 encapsulated Postscript figures | |
| dc.identifier | https://arxiv.org/abs/math/0004133 | |
| dc.identifier | http://arxiv.org/abs/math/0004133 | |
| dc.identifier | In Mathematics Unlimited - 2001 and Beyond, vol. 1, eds. Björn Engquist and Wilfried Schmid, Springer, Berlin, 2001, pp. 29-50. | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/96712 | |
| dc.subject | Quantum Algebra | |
| dc.subject | Combinatorics | |
| dc.subject | Category Theory | |
| dc.subject | History and Overview | |
| dc.title | From Finite Sets to Feynman Diagrams | |
| dc.type | text |