Cover of the summary of “What is mathematics?”

Book summary “What is mathematics?”: summary

Richard Courant

5,914 words · 33 min read

You often view mathematics as a cold set of rigid rules and tedious calculations that you must memorize without understanding. This dry presentation strips the subject of its creative spirit, leaving you with the false impression that mathematics is a completed monument rather than a living science.

Summary text

5,914 words · 33 min read

Introduction

You often view mathematics as a cold set of rigid rules and tedious calculations that you must memorize without understanding. This dry presentation strips the subject of its creative spirit, leaving you with the false impression that mathematics is a completed monument rather than a living science. You struggle to see the connection between elementary arithmetic and advanced calculus, missing the unifying philosophy that binds these domains together.

Richard Courant and Herbert Robbins reveal that mathematics is an organic whole driven by the continuous tension between opposing forces. You discover that true mathematical science requires the synthesis of intuition and logic, analysis and construction, and generality and individuality. The authors guide you past mechanical technique to help you grasp the underlying ideas and motivations that animate mathematical thought.

The book takes you on a comprehensive journey from the foundations of number systems to the frontiers of modern geometry and analysis. You begin with natural numbers and progress through number theory, the algebra of sets, geometrical constructions, and projective geometry. You then explore topology, functions, limits, maxima and minima, and the calculus.

As you read, you will find answers to several fundamental questions:

  • How do you construct the entire number system starting from the simple integers?
  • Why were ancient Greek problems like squaring the circle proved impossible?
  • What properties remain invariant when you continuously deform geometrical figures?
  • How do limits bridge the gap between finite calculations and infinite processes?
  • What principles govern optimization and the calculus of variations?

1. The Natural Numbers

All mathematical statements should ultimately reduce to statements about natural numbers, which obey fundamental arithmetic laws and positional notation systems.

Leopold Kronecker pointed out this philosophical foundation. He stated that God created the natural numbers and everything else is human handiwork, providing a safe ground for the structure of mathematics.

Calculation with Integers

The basic laws of arithmetic apply to integers, but they may fail when applied to other entities such as chemical substances. Addition and multiplication of integers obey five fundamental laws: commutative, associative, and distributive laws. Colloquial addition of chemical substances like sulphuric acid and water does not obey the commutative law. Mixing them in different orders yields completely different results.

Adding sulphuric acid to water yields a dilute solution, whereas adding water to pure sulphuric acid can result in disaster. Positional notation uses digit position to represent any integer efficiently with a small set of symbols. In the decimal system, the meaning of a digit depends on its position representing units, tens, or hundreds, corresponding to powers of ten. The remainders left after successive divisions by the base yield the digits from right to left. The number 372 is represented as $3 \cdot 10^2 + 7 \cdot 10 + 2$.

Any integer greater than one can serve as a base for a positional number system instead of ten. Different cultures and theoretical needs utilize bases other than ten, such as the septimal system, the duodecimal system, and the dyadic system. To convert from base ten to any other base $B$, you perform successive divisions of the number by $B$. In the septimal system, the number $265$ multiplied by $24$ equals $10,416$, which checks out to $2,610$ in the decimal system.

The Infinitude of the Number System

Mathematical induction rigorously proves a sequence of statements for all infinite integers through two verified conditions. Unlike empirical induction in natural sciences, mathematical induction requires showing that if a statement is true for an integer $r$, it holds for $r$ plus one. You must also verify that it is true for the first statement. You prove formulas for the sum of the first $n$ integers, geometric progressions, or the sum of the first $n$ squares.

Pascal's triangle provides a triangular array of numbers to form coefficients in the expansion of a binomial power. Each number in the triangle is the sum of the two numbers on each side of it in the preceding row. This structure generates the coefficients for the binomial theorem expansion. Expanding $(a + b)^7$ yields $a^7 + 7a^6b + 21a^5b^2 + 35a^4b^3 + 35a^3b^4 + 21a^2b^5 + 7ab^6 + b^7$.

Every non-empty set of positive integers contains a smallest member, a principle logically equivalent to mathematical induction. This principle states that any non-empty set of positive integers possesses a minimum element, a property that does not hold for sets of fractions. Assuming a set of positive integers where a statement is false contains a smallest integer leads to a logical contradiction.

2. The Theory of Numbers

Number theory explores prime numbers, unique prime factorization, congruences, Fermat's theorems, and the Euclidean algorithm.

The Prime Numbers

Euclid used an indirect method to demonstrate that the class of prime numbers contains infinitely many members. By assuming a finite set of primes, a new number can be constructed by multiplying them all together and adding one. This number is either a new prime itself or divisible by a prime not in the original finite set, creating a contradiction.

The sieve of Eratosthenes provides a systematic method to filter out composite numbers and list all primes up to any given integer. Complete tables of primes up to about 10,000,000 have been computed using refinements of this method.

Every integer greater than one can be factored into a product of primes in only one way, disregarding the order of factors. For example, 360 can be factored into primes as $2^3 \cdot 3^2 \cdot 5$.

Gauss observed empirically that the ratio of the number of primes to $n$ is asymptotically equal to $1 / \log n$. Hadamard and de la Vallée Poussin proved this prime number theorem rigorously in 1896 using probability calculations across $10^9$ integers.

Goldbach's conjecture posits that every even number greater than two can be expressed as the sum of two primes. Schnirelmann proved an upper limit of 300,000 primes in 1931, while Vinogradoff later proved an upper limit of 4 primes for sufficiently large integers. For example, 100 can be represented as $97 + 3$, and 48 can be represented as $29 + 19$.

Congruences

The concept of congruence modulo $d$ simplifies the analysis of integer divisibility by grouping integers that leave the same remainder. Two integers $a$ and $b$ are congruent modulo $d$ if their difference is a multiple of $d$, denoted as $a \equiv b \pmod d$.

You encounter practical systems of congruence every day:

  • the hands on a clock indicate the hour modulo 12;
  • a car mileage indicator works modulo 100,000.

Fermat's theorem states that if $p$ is any prime not dividing an integer $a$, then raising $a$ to the power of $p$ minus one leaves a remainder of one modulo $p$. For $p = 7$ and $a = 10$, $10^6 \equiv 1 \pmod 7$.

Legendre and Gauss established the Law of Quadratic Reciprocity to describe the deep relationship between quadratic residues and quadratic non-residue classes of two different primes. For $p = 5$ and $q = 11$, 11 is a quadratic residue modulo 5, and 5 is a quadratic residue modulo 11.

Pythagorean Numbers and Fermat's Last Theorem

Solving the equation $a^2 + b^2 = c^2$ in integers leads to parametric expressions where side lengths depend on two coprime integers $u$ and $v$ with different parities. Setting $u = 2$ and $v = 1$ yields the primitive Pythagorean triple 3, 4, 5 as basic triangle sides.

Fermat asserted that the equation $a^n + b^n = c^n$ has no positive integer solutions for any integer exponent $n$ greater than two. A prize of 100,000 marks was once held in trust at the Royal Academy at Göttingen for the first solution before inflation wiped out its value.

The Euclidean Algorithm

The Euclidean algorithm provides a systematic computational method to find the greatest common divisor of two integers through repeated division. Applying the algorithm to 1804 and 328 yields a greatest common divisor of 164.

Linear Diophantine equations with integer coefficients can be fully solved using the Euclidean algorithm to find integer solutions for unknowns. An equation of the form $ax + by = c$ has integer solutions if and only if $c$ is a multiple of the greatest common divisor of $a$ and $b$. The equation $7x + 11y = 13$ has a particular solution at $x = -39$ and $y = 26$ using 13 as the value for $c$.

3. The Number System of Mathematics

Expanding the number system from rationals to irrationals, real numbers, and complex numbers provides an algebraically closed field for analysis.

Rational and Irrational Numbers

You discover that natural numbers alone cannot support measurement or make division unrestricted. Fractions like 3/2 solve equations of the form ax equals b when a is not a factor of b. A closed domain where rational operations can be performed without restriction is called a field. The fraction 1/3 is greater than 0.333...33 but less than 0.333...34.

The Pythagorean theorem shows that the diagonal of a square with unit side has length equal to the square root of 2. Proving by contradiction that this length cannot be expressed as a ratio of two integers p and q in lowest terms reveals that simple geometric constructions yield segments incommensurable with the unit. The diagonal of a square of side 1 is proven incommensurable with its side, showing x squared equals 2 has no rational solution.

The Number Continuum

Points not corresponding to finite decimal fractions can be enclosed in a nested sequence of decimal intervals whose lengths tend to zero. The limit concept explains how infinite geometrical series represent exact numbers. Richard Dedekind published Stetigkeit und irrationale Zahlen in 1872 and Was sind und was sollen die Zahlen? in 1887.

Dedekind cuts define irrational numbers by dividing all rational numbers into two classes where the cut defines an irrational number if there is neither a largest element in the first class nor a smallest in the second. Class A contains negative numbers, zero, and positive rational numbers with squares less than 2, while Class B contains those with squares greater than 2. Cantor proved that infinite sets can have different cardinal numbers. Arranging all positive fractions in a grid and tracing a continuous broken line proves that the set of rational numbers is denumerable.

Analytic Geometry

Fermat and Descartes established analytic geometry in 1629 and 1637 respectively by assigning coordinates to points on perpendicular axes. Geometric curves are completely characterized by algebraic equations satisfied by the coordinates of their points.

  • Cartesian coordinates assign position vectors to geometric points;
  • coordinate geometry turns geometric problems into algebraic calculations;
  • the distance between two points is given by the Pythagorean theorem.

Complex Numbers

Extending the number system with the imaginary unit i allows equations like x squared equals minus one to be solved. Complex numbers take the form a plus bi, obeying standard arithmetic laws with i squared defined as minus one. Gauss published his doctoral thesis in 1799 proving the fundamental theorem of algebra. De Moivre's formula allows calculating powers of complex numbers and finding the n different nth roots of unity, which form regular polygons on the unit circle. Algebraic numbers can be ordered by their height, leading to transcendental numbers.

4. The Algebra of Sets

Set theory provides a general framework of operations that applies directly to mathematical logic and the calculation of probabilities.

Sets can be combined through logical operations analogous to numerical addition and multiplication. Operations like union and intersection follow several formal laws that mirror ordinary numbers.

  • universal set
  • empty set
  • union
  • logical sum
  • intersection
  • logical product
  • complement

If set A contains {1, 2, 3} and set B contains {2, 3, 4}, their union A + B is {1, 2, 3, 4} and their intersection AB is {2, 3}. The subset relation determines a partial ordering among sets. Any two real numbers can always be compared, but arbitrary sets may be completely incomparable. For sets A = {1, 2, 3} and B = {2, 3, 4}, neither A is a subset of B nor B is a subset of A. Interchanging specific symbols yields valid alternative laws of duality.

Application to Mathematical Logic

George Boole published An Investigation of the Laws of Thought in 1854 during his lifetime of 1815-1864. You can deduce the entire algebra of sets axiomatically from a set of three equations, giving rise to Boolean algebras. A completely different mathematical system satisfying all these formal laws can be constructed using eight specific divisors of thirty:

  • 1, 2, 3, 5, 6, 10, 15, 30

Traditional logical reasoning and syllogisms translate directly into the algebra of logic and mathematical logic. Logical connectors correspond precisely to set operations, turning classical principles like the law of contradiction and the law of excluded middle into equations. The classical syllogism Barbara is expressed algebraically as if A subset B and B subset C, then A subset C.

The algebra of sets provides a rigorous framework for calculating the probabilities of complex combined events. When outcomes are equally likely, the probability of a union of sets can be computed directly.

  • calculate probabilities of complex combined events
  • sum individual probabilities
  • add or subtract intersection probabilities

Consider a standard deck with 52 cards where the heart subset contains 13 cards. When digits 1, 2, and 3 are written in random order, you calculate the probability that at least one digit occupies its proper place using set union formulas. Further calculations yield a probability of 5/8 or 0.6250 for four digits. The value of 1/e reaches .36788 to five decimal places, while the limit of the probability as n tends to infinity approaches .63212.

5. Geometrical Constructions and Number Fields

Geometrical construction problems using ruler and compass alone can be translated into algebra, where constructible numbers correspond to values generated through rational operations and square root extractions.

Impossibility Proofs and Algebra

Basic operations like addition, subtraction, multiplication, division, and extracting square roots match specific ruler and compass procedures. Repeated extensions through square roots form extension fields of constructible numbers, and all constructible numbers are algebraic.

Constructing segments like a + b, a - b, rational multiples, ratios like a/b, and square roots using right triangles and intersecting circles.

  • fields $F_k$ generated through $k$ square root extensions
  • equations where numbers have a degree equal to $2^k$

The Three Greek Problems

Doubling a cube using only ruler and compass is theoretically impossible because its algebraic equivalent leads to a cubic equation without rational roots. The edge of a doubled cube with unit volume satisfies the cubic equation $x^3 - 2 = 0$. Proof by contradiction shows that its root cannot lie within any field obtained by successive quadratic extensions from the rational numbers.

Finding the edge of a cube whose volume is twice that of a given cube.

Trisecting an arbitrary angle with ruler and compass alone is impossible because it reduces to solving a cubic equation lacking rational roots. Trisecting a 60-degree angle leads to the cubic equation $8z^3 - 6z = 1$, or substituting $v = 2z$, the equation $v^3 - 3v = 1$. Testing possible rational roots proves none satisfy the equation.

Constructing a regular heptagon with ruler and compass alone is impossible because its side length corresponds to the roots of a cubic equation with no rational solutions. The vertices of a regular heptagon relate to the roots of $z^7 - 1 = 0$. Factoring out $z - 1$ and setting $y = z + 1/z$ yields a cubic equation $y^3 + y^2 - 2y - 1 = 0$, which has no rational roots.

At age seventeen, Gauss discovered that a regular $p$-gon (where $p$ is prime) is constructible by ruler and compass if and only if $p$ is a Fermat prime number. Gauss proved that constructible regular $p$-gons occur precisely when $p$ takes the form of a Fermat number, such as 3, 5, 17, 257, and 65537. This discovery inspired his lifelong dedication to mathematics.

Gauss's construction of the regular 17-gon, commemorated on his bronze statue pedestal in Goettingen.

Geometrical Transformations

Inversion in a circle is a geometric transformation that maps straight lines and circles into straight lines and circles while preserving angles between intersecting curves. In an inversion with center $O$ and radius $r$, points $P$ and $P'$ on ray $OP$ satisfy $OP \cdot OP' = r^2$. Lines through $O$ map to lines through $O$, lines not through $O$ map to circles through $O$, and circles not through $O$ map to other circles.

Transforming intersecting circles and lines while keeping their angles of intersection invariant.

Constructions with Other Tools

Mascheroni proved that all geometric constructions doable with straightedge and compass can be performed using the compass alone. Although a straight line cannot be drawn directly without a straightedge, a line is defined by any two points on it. Basic operations like finding intersections of circles, lines and circles, and two lines can be achieved using compass inversions.

Bisecting arcs, doubling segments, and finding circle centers using only a compass.

Mechanical linkages can convert circular motion into exact rectilinear motion without using a straightedge. Peaucellier's linkage uses seven rigid rods connected in a configuration based on circle inversion to trace a true straight line. Hart's inversor accomplishes the same task using five rods.

Peaucellier's 1864 invention of a linkage enabling a point to move precisely on a straight line.

6. Projective Geometry and Axiomatics

Branches of geometry are classified by Felix Klein's Erlanger program according to the properties that remain invariant under specific classes of transformations.

In 1872, Felix Klein proposed that geometry can be categorized by what properties survive transformations instead of relying on synthetic or analytic proofs. Rigid motions preserve metric properties. Projective transformations preserve incidence, collinearity, and cross-ratios even when lengths and angles are distorted.

Compressing a rectangular wooden block with a circle and perpendicular diameters deforms the circle into an ellipse and changes the right angles, but the center still bisects each diameter.

Projective Geometry

The cross-ratio of four points on a straight line is a fundamental invariant that remains unchanged under any projective transformation. While lengths and simple ratios of three points change during projection, the cross-ratio defined as the ratio of two segments remains constant. You express this quantity using signed distances or angles subtended from a center of projection.

Several distinct values characterize specific configurations:

  • -1 when points divide a segment harmonically;
  • 1 when two of the points coincide;
  • 24 for the number of different permutations when ordering four points.

Parallelism and Infinity

Adding ideal points and lines at infinity to geometry eliminates exceptional cases like parallel lines by ensuring every pair of lines intersects. To maintain the rule that any two lines intersect in exactly one point, a single ideal point is added to each family of parallel lines. An ideal line at infinity contains all these ideal points in a plane.

Projective geometry exhibits a profound duality where every true theorem concerning points and lines has a dual counterpart where points and lines are interchanged. Pascal's theorem from 1640 regarding the collinearity of opposite sides of an inscribed hexagon and Brianchon's theorem from 1806 regarding the concurrence of diagonals of a circumscribed hexagon are dual theorems. Replacing points with tangents and lines with points translates a point curve theorem into a line curve theorem.

Axiomatics and Non-Euclidean Geometry

Non-Euclidean hyperbolic geometry is constructed consistently by replacing Euclid's parallel postulate with an axiom allowing infinitely many parallels through an external point.

Efforts to prove Euclid's parallel postulate failed because it is independent of the other axioms. Felix Klein and others proved its consistency by building models, such as using the interior of a circle as a non-Euclidean plane and chords as straight lines. In this model, multiple non-intersecting lines pass through a point.

Elliptic geometry represents a non-Euclidean system where lines are finite and closed, meaning no parallel lines exist. Introduced by Bernhard Riemann after his 1851 inaugural address, this geometry can be visualized on a sphere where straight lines are great circles. Every pair of straight lines intersects, eliminating parallels entirely.

Higher-dimensional spaces are defined analytically through ordered n-tuples of numbers or constructed combinatorially by identifying boundaries of lower-dimensional figures. Although spatial intuition is limited to three dimensions, algebraic equations and combinatorial rules extend seamlessly to n dimensions. A point in R^n is an ordered set of n real numbers.

7. Topology

Topology investigates geometrical properties preserved under continuous biunique deformations, including polyhedral Euler formulas and surface classifications.

Also known as analysis situs, topology studies geometrical properties that remain invariant under continuous biunique transformations which do not tear the figure. A triangle can be deformed into a circle or an ellipse, making them topologically equivalent, but a circle cannot be deformed into a line segment. Unlike elementary or projective geometry, topological transformations only require a biunique and continuous correspondence in both directions between points of the figures.

Euler's Formula for Polyhedra

For any simple polyhedron, the number of vertices minus the number of edges plus the number of faces always equals two. You can picture this property by imagining the polyhedron as a hollow rubber shell, removing one face, flattening it onto a plane, and then triangulating the network to systematically remove triangles along the boundary until one triangle remains.

For a non-regular simple polyhedron from the text, V minus E plus F equals 9 minus 18 plus 11, which totals 2. A non-simple polyhedron with 16 vertices, 32 edges, and 16 faces yields V minus E plus F equal to 0.

Topological Properties of Figures

Plane domains are classified by their connectivity, determined by the number of non-intersecting cuts required to reduce them to a simply connected domain. A domain is simply connected if any closed curve within it can be shrunk to a single point. If it contains holes that prevent this, it is multiply connected, requiring n minus 1 cuts to become simply connected.

  • The interior of a circle is simply connected.
  • The annular region between two concentric circles requires a cut along a radius to become simply connected.

Camille Jordan first stated the theorem that a simple closed curve in the plane divides the plane into exactly two distinct domains: an inside and an outside. Determining whether a point is inside or outside a twisted polygon like Figure 128 relies on counting how many times a ray from the point intersects the curve.

Any geographical map in the plane or on a sphere can be colored using at most four colors such that no adjacent regions share the same color. An island containing four countries, each of which touches the other three, requires at least four colors to properly color it. The four color theorem has been proved for all maps containing fewer than 38 regions.

The Jordan Curve Theorem

Poincare introduced an inductive definition of dimension to resolve ambiguities in complex point sets like Cantor's set or rational points. The dimension of any set is a topological invariant. Cantor's point set is formed by repeatedly removing middle thirds of intervals on a unit segment, leaving a set of points with dimension zero. The total length of the segments removed in constructing Cantor's set is 1, and the sum of the geometric series representing removed intervals is 3.

Any continuous transformation of a circular disk into itself leaves at least one point completely fixed. If the liquid in a glass is stirred so that surface particles move to new positions, at any given instant at least one particle remains in its exact original position. Brouwer proved this using index theory of transformation vectors on concentric circles.

Classification of Surfaces

Closed two-dimensional surfaces can be topologically classified by their genus p, with their Euler characteristic given by V minus E plus F equals 2 minus 2p. The genus represents the maximum number of non-intersecting simple closed curves that can be drawn on the surface without separating it. A torus has genus 1, yielding an Euler characteristic of 2 minus 2 times 1, which equals 0, matching the vertex, edge, and face count of a flat polygonal torus model.

Certain surfaces possess only one side and a single boundary curve. A bug crawling along the middle of a Moebius strip will return to its starting position upside down. Discovered by Moebius, these surfaces defy ordinary intuition. Cutting a Moebius strip along its center line does not separate it into two pieces because it possesses only a single continuous side. Closed one-sided surfaces of genus p follow the Euler characteristic relation 2 minus p.

8. Functions and Limits

Variable interdependence is captured by functions and rigorously analyzed through static epsilon-delta limit definitions.

Variable and Function

Leibniz originally identified functions with simple mathematical formulas during his lifespan from 1646 to 1716. Physical applications required a broader generalization of the concept as a correspondence between variables. You can describe this dependence using the terms independent variable, dependent variable, variable, and domain.

Radian measure defines the size of an angle by the arc length it cuts on a unit circle, offering analytic advantages over degree measure. By describing a circle of radius 1 about the vertex, the arc length s serves as the radian measure. This connects the 360 degree measure of a full angle to the 2pi radian measure of a full angle, yielding 57.2957 degrees in 1 radian.

Limits

The limit of a sequence is defined rigorously using an epsilon-N formulation rather than dynamic motion. A sequence has a limit if, for any positive epsilon, an integer N can be found such that all terms beyond N fall within an interval of width 2 epsilon centered at the limit.

  • A sequence is convergent if its terms approach a limit.
  • A sequence is divergent if it fails to converge.

Any monotone increasing sequence that is bounded above must converge to a limit. This principle relies on the real number system and the introduction of irrational numbers.

Euler's number $e$ is defined as the limit of a monotone increasing and bounded sequence involving factorials. The sequence uses $3$ as an upper bound and converges to the approximate value of $e$ to eight digits of $2.7182818$.

Limits by Continuous Approach

The limit of a function of a continuous variable is defined statically using delta and epsilon neighborhoods. Cauchy formulated this static definition where a function approaches a limit if an appropriate delta margin can be found for any chosen epsilon margin.

Continuous Functions

Bolzano's theorem states that a continuous function taking positive and negative values in an interval must equal zero at some intermediate point. Weierstrass' Theorem on Extreme Values establishes that a continuous function on a closed interval must attain a largest and a least value.

9. Maxima and Minima

Optimization problems in geometry and calculus are resolved through extremal principles, soap films, and the calculus of variations.

Problems in Elementary Geometry

You can solve optimization questions using geometric reflections. Heron's theorem establishes that a light ray reflecting from a plane mirror takes the path that minimizes the total distance between the starting and ending points.

Reflecting one point across the mirror reveals the shortest path where the connecting straight line intersects the mirror at equal angles.

Schwarz proved the minimum property of the altitude triangle using a reflection method across the sides of the original triangle. The inscribed triangle with the least possible perimeter in an acute-angled triangle is the altitude triangle, formed by the foot-points of the altitudes.

Jacob Steiner studied the problem of finding a point that minimizes the sum of distances to three given points. Three villages A, B, and C connected by a system of roads of minimum total length illustrate Steiner's problem.

If all angles of the triangle are less than $120$ degrees, the optimal point is where each side subtends an angle of $120$ degrees. If an angle equals or exceeds $120$ degrees, the minimum point is the vertex of that obtuse angle.

The Isoperimetric Problem

You find that the geometric mean of two positive quantities is never greater than their arithmetic mean, with equality holding only when the quantities are equal. This inequality helps determine that finding the rectangle with the largest area for a prescribed perimeter always yields a square.

Among all closed plane curves of a given length, the circle encloses the maximum area. Steiner proved that the optimal curve must be convex and symmetrical.

An isoperimetric inequality establishes that the area $A$ and length $L$ satisfy $A \le L^2 / (4 \pi)$.

The Calculus of Variations

The calculus of variations deals with optimization problems where the independent variable is an entire curve or function rather than numerical values. In 1696, Johann Bernoulli proposed the brachistochrone problem asking for the curve of quickest descent under gravity between two points.

The solution is the cycloid, a curve generated by a point on the circumference of a rolling circle. Huygens discovered that a mass point oscillating on a vertical cycloid has a period independent of amplitude, leading to its role as a tautochrone and brachistochrone.

Soap Film Experiments

You can solve minimal surface problems using physical experiments instead of equations. Plateau's problem asks for the surface of smallest area bounded by a given closed contour in space.

Dipping a cubic wire frame into a soap solution produces thirteen nearly plane surfaces meeting at $120$-degree angles. Soap films spanning wire frames physically solve complex minimal surface problems by minimizing surface tension and potential energy.

10. The Calculus

The calculus unites differentiation and integration as inverse operations that govern rates of change and accumulation.

The Integral

Archimedes computed curvilinear areas like the circle and parabolic segment using an exhaustion process with inscribed polygonal domains. You define the integral as the exact limit of a sum of rectangular approximations under a curve as the width of the rectangles approaches zero. By subdividing an interval under a curve into narrow strips and replacing each strip with a rectangle, you form an approximate area sum. As the number of subdivisions increases indefinitely and the maximum width of the rectangles tends to zero, the sequence of sums approaches a precise limit called the integral.

The Derivative

To find the slope at a point on a curve, you choose a nearby point to form a secant line with a slope given by a difference quotient. As the second point moves closer and the interval approaches zero, the secant approaches the tangent as its limiting position, and the difference quotient yields the derivative. The derivative of a function at any point represents the slope of the tangent line to its curve, obtained as the limit of the slope of a secant line.

The Fundamental Theorem of the Calculus

The fundamental theorem of calculus establishes that differentiation and integration are inverse operations to one another.

By treating the integral with a variable upper limit as a function, you find that differentiating this indefinite integral yields the original integrand value. Consequently, evaluating a definite integral simplifies to finding a primitive function and computing the difference between its values at the upper and lower limits. Integrating the geometric series expansion for one over one plus $x$ squared yields Leibniz's famous alternating series formula for pi divided by four.

  • $\pi / 4 = 1 - 1/3 + 1/5 - 1/7 + \dots$
  • natural logarithm defined as the definite integral of $1/u$ from $1$ to $x$

Differential Equations

Functions satisfying a specific differential equation grow or decay exponentially to model natural phenomena such as radioactive disintegration, continuous compound interest, and population growth. The half-life period for radium is about $1550$ years, yielding a decay constant coefficient of $-0.0000447$.

By equating mass times acceleration components to external forces such as elasticity and friction, you reduce complex physical systems to standard differential equations. The resulting equations describe pure harmonic oscillations or vibrations damped by an exponential factor. Kepler's laws of planetary motion are explained by Newton's gravitational force field equations where attraction is inversely proportional to the square of the distance.

11. Recent Developments

Modern mathematics has resolved historic open problems, including Fermat's Last Theorem, the Four Color Theorem, and advances in knot theory.

Andrew Wiles proved Fermat's Last Theorem in 1994 by linking it to the Taniyama conjecture regarding elliptic curves and modular functions. Gerhard Frey associated a hypothetical solution of Fermat's equation with an elliptic curve. Kenneth Ribet then proved that this Frey curve could not exist if the Taniyama conjecture were true. Wiles proved a semistable case of the Taniyama conjecture for specific elliptic curves, creating a contradiction that established the truth of Fermat's Last Theorem.

Wiles's paper length spanned $100$ pages. He repaired a serious gap concerning an Euler system with the help of Karl Rubin and earlier approaches.

The Four Color Theorem

The Four Color Theorem was proved by using a computer to verify that an unavoidable set of thousands of configurations is reducible. Building on Kempe's method of minimal criminals and Heesch's discharging method, Kenneth Appel and Wolfgang Haken constructed an unavoidable set of configurations. They utilized a computer to check every configuration for reducibility, establishing that four colors suffice for any planar map.

In June 1976 Kenneth Appel and Wolfgang Haken completed their computer-assisted proof after testing roughly $2000$ configurations over several thousand hours of computation. Franklin had set a $26$-region limit for four-colorability proofs in 1922, and Heesch estimated the configuration count at $10,000$.

Fractals and Dimension

The fractal dimension measures how rough a geometric object is and can take non-integer values based on scaling behavior. Generalizing the integer dimensions of Euclidean hypercubes via scaling equations, the Hausdorff-Besicovitch dimension evaluates how many scaled copies are required to reconstitute a shape. This metric quantifies space-filling properties for irregular objects like fractals.

Mitsuhiro Shishikura proved in 1991 that the fractal dimension of the boundary of the Mandelbrot set is exactly $2$. The Cantor set uses a scaling size of $3$ and $2$ copies, while the Sierpinski gasket uses a scaling size of $2$ and $3$ copies.

Knots and Networks

Knot polynomials like the Jones and HOMFLY polynomials serve as powerful topological invariants to distinguish inequivalent knots. Traditional tools like the Alexander polynomial failed to distinguish certain knots, such as left-handed and right-handed trefoils or reef and granny knots. Vaughan Jones derived a new polynomial invariant from trace functions on operator algebras, leading to generalized multivariable polynomials that solve these identification problems.

In 1984 Vaughan Jones discovered his polynomial invariant while studying operator algebras and braid theory, which was soon generalized into the multi-variable HOMFLY polynomial.

10 Key Ideas

  1. All mathematical statements should ultimately reduce to statements about natural numbers, which obey fundamental arithmetic laws and positional notation systems.
  2. Number theory explores prime numbers, unique prime factorization, congruences, Fermat's theorems, and the Euclidean algorithm.
  3. Expanding the number system from rationals to irrationals, real numbers, and complex numbers provides an algebraically closed field for analysis.
  4. Set theory provides a general framework of operations that applies directly to mathematical logic and the calculation of probabilities.
  5. Geometrical construction problems using ruler and compass alone can be translated into algebra, where constructible numbers correspond to values generated through rational operations and square root extractions.
  6. Branches of geometry are classified by Felix Klein's Erlanger program according to the properties that remain invariant under specific classes of transformations.
  7. Topology investigates geometrical properties preserved under continuous biunique deformations, including polyhedral Euler formulas and surface classifications.
  8. Variable interdependence is captured by functions and rigorously analyzed through static epsilon-delta limit definitions.
  9. Optimization problems in geometry and calculus are resolved through extremal principles, soap films, and the calculus of variations.
  10. The calculus unites differentiation and integration as inverse operations that govern rates of change and accumulation.

A summary is an independent retelling, not the text of the book.

Cover of the summary of “The Last Whalers” 20 min read

The Last Whalers

Doug Bock Clark
Cover of the summary of “Confess” 21 min read

Confess

Rob Halford
Cover of the summary of “Toast” 17 min read

Toast

Nigel Slater
Cover of the summary of “Ace Voices” 24 min read

Ace Voices

Eris Young
Cover of the summary of “For Small Creatures Such as We” 17 min read
Cover of the summary of “Two Trees Make a Forest” 16 min read
Cover of the selected audiobook Choose a chapter The player is ready
0:00 0:00

Volume