The Age of Euler: Study Notes

Leonhard Euler: The Life of a Prolific Mathematician

• Biographical Overview: Leonhard Euler was born on April 15, 1707, in Basel, Switzerland, and passed away in 1783. He is widely regarded as the most prolific mathematician in the history of the field.

• Contemporary Reputation: His contemporaries referred to him as "analysis incarnate," noting that he performed calculations as effortlessly as men breathe or eagles fly.

• Early Education: Euler's primary instruction came from his father, Paul Euler, a Calvinist minister who had studied mathematics under Jacob Bernoulli. In 1720, at just 14 years of age, Euler was sent to the University of Basel to prepare for the ministry in accordance with his father's wishes.

• Academic Progression:

  • At age 15, he earned his Bachelor’s degree.

  • At age 16 (1723), he completed a Master’s degree in philosophy, producing a thesis that compared and contrasted the philosophical frameworks of Descartes and Newton.

  • Despite his father's demand that he study theology, Euler transitioned to mathematics after Johann Bernoulli (Jacob’s brother) intervened and persuaded Paul Euler of his son's talent.

  • In 1726, he completed his university studies, having mastered works by Varignon, Galileo, Descartes, Taylor, Wallis, Newton, and the Bernoullis.

• Early Professional Milestones: By 1727, Euler had published papers on isochronous curves and entered the Grand Prize competition of the French Academy regarding the placement of masts on ships. Though he did not win (receiving an honorable mention), he later won this prestigious prize 12 times despite never having been on a ship.

The Intellectual and Social Context of the Eighteenth Century

• The Scientific Revolution and Communication: The 18th century saw a rapid acceleration of progress due to the rise of mathematical and scientific journals, a late outgrowth of the 15th-century printing revolution. This functioned as an early predecessor to the modern information age.

• Educational Standards: During this era, knowledge of mathematics was considered the foundation of all learning and a prerequisite for any educated individual.

• The Role of Royal Academies: Unlike modern times, universities were not the primary centers of research. Instead, progress was fostered by royal academies supported by monarchs like Frederick the Great of Prussia and Catherine the Great of Russia. These institutions paid leading members to produce research while allowing them significant freedom once results were demonstrated.

• Practical Applications influencing Theory:

  • Navigation: Controlling the seas required accurate navigation, which depended on astronomical observations.

  • The Three-Body Problem: Calculated positions for the Moon were notoriously difficult because they involved the gravitational interactions between the Moon, Earth, and Sun. Euler was the first to derive an approximate solution to this problem.

Career in Russia and Germany

• St. Petersburg Academy: Euler's friends Daniel and Nicholas Bernoulli secured him a position in the medical section at Catherine I’s court in St. Petersburg. Euler prepared for the post by attending medical lectures at Basel and arrived in Russia in 1727.

• Shift in Focus: Following Nicholas Bernoulli’s death, Euler became the head of the Natural Philosophy department. When Daniel Bernoulli returned to Switzerland in 1733, the 26-year-old Euler was appointed the senior chair of mathematics.

• Scientific Output: Euler's productivity was characterized by both high quality and extreme quantity. He eventually held royal appointments in several courts, primarily dividing his time between St. Petersburg (under Catherine the Great) and Berlin (under Frederick the Great).

• Physiology and Sound: Even in medical departments, Euler applied mathematical rigor. His study of the physiology of the ear led to classic research on sound propagation and waves.

Major Mathematical Publications

• Mechanica (1736–1737): A two-volume work and the first textbook where Newton's dynamics of a mass point were developed using analytical methods rather than geometric ones.

• Theoria motus corporum solidorum seu rigidorum (1765): A sequel treating the mechanics of solid bodies, containing the "Eulerian" equations for rotating bodies.

• Introductio in Analysin infinitorum (1748): A foundational textbook divided into two parts covering algebra, trigonometry, theory of equations, and analytical geometry. It introduced current abbreviations for trigonometric functions and the identity $e^{i \theta} = \cos(\theta) + i \sin(\theta)$.

• Institutiones calculi differentialis (1755): A key work on differential calculus.

• Institutiones calculi integralis (1768–1774): A three-volume set detailing integral calculus, double integrals, Taylor’s theorem, and differential equations. In this work, Euler invented Beta and Gamma functions.

• Vollstndige Anleitung zur Algebra (1770): An algebra textbook (later translated into French with additions by Lagrange) containing a proof of Fermat's Last Theorem for cases where $n = 3$ and $n = 4$.

• Methodus inveniendi lineas curvas (1744): A work on isoperimetrical curves, geodesics, and the brachistochrone in a resisting medium, which laid the foundation for the calculus of variations.

Achievements in Notation and General Contributions

• Creator of Modern Expression: Euler standardized much of the notation used today, including:

  • $\pi$ for the ratio of a circle's circumference to its diameter.

  • $i = \sqrt{-1}$ for imaginary units.

  • $\Delta y$ to represent a change in value.

  • $f(x)$ for function notation.

  • $\Sigma$ for summation.

• The Magnitude of His Work: Euler authored more than 500 books and papers during his life, averaging 800 pages per year. After his death, it took 40 years to publish his backlog of approximately 400 additional publications. His collective works, the Opera Omnia, currently occupy 73 large volumes.

• Breadth of Knowledge: He enriched calculus, geometry, algebra, mechanics, number theory, acoustics, engineering, astronomy, and optics.

Intellectual Abilities and Anecdotes

• Phenomenal Memory: Euler memorized Virgil’s Aeneid as a boy and could recite it his entire life. He memorized the first 100 prime numbers and their powers up to the sixth degree.

• Mental Calculation: He could perform complex mental calculations with up to 50 decimal places of accuracy. He was known to write a complete mathematical paper in the half-hour between dinner calls.

• Resilience: Euler lost sight in one eye in 1735 and became completely blind in 1766. This did not slow his productivity; he dictated his research to students for the remainder of his life.

• Euler and the Atheist: A famous (though perhaps apocryphal) tale describes Catherine the Great asking Euler to challenge the atheist philosopher Denis Diderot. Euler allegedly presented Diderot with the nonsensical formula $\frac{a+b^n}{z} = x$ and stated: "Sir, hence God exists; reply!" Diderot, ignorant of mathematics, was humiliated by the court's laughter and fled to France.

The Foundations of Graph Theory

• Origin: Euler became the father of graph theory while solving the "Seven Bridges of Knigsberg" problem in 1736.

• The Knigsberg Problem: The city had four landmasses connected by seven bridges across the Pregel River. The goal was to find a route crossing each bridge exactly once and returning to the start.

• Euler’s Insight: Euler proved it was impossible. He noted that the specific geometry (distances, bridge shapes) was irrelevant; only the connections (topology) mattered. He established that for such a journey to be possible, each landmass must have an even number of bridges (edges) attached to it.

• Geometria Situs: Euler identified this as a "geometry of position" (topology) that Leibniz had previously envisioned, which does not rely on metrics like length or volume.

Graph Theory Definitions and Classifications

• Graph Basics: A graph $G = (V, E)$ consists of a set of vertices (dots) and edges (lines linking them).

• Adjacency and Incidence: Two vertices are adjacent if an edge connects them. An edge is incident with the vertices it links.

• Degree of a Vertex: The degree $deg(v)$ is the number of edges incident with a vertex.

  • Isolated Vertex: A vertex with degree $0$.

  • Endvertex/Endpoint: A vertex with degree $1$.

• Degree Sequence: A non-increasing sequence of the degrees of the vertices in a graph.

• Handshaking Theorem: The sum of all vertex degrees in a graph is twice the number of edges: $\sum_{v \in V} \text{deg}(v) = 2|E|$. A corollary is that every graph contains an even number of vertices with an odd degree.

• Types of Graphical Structures:

  • Simple Graph: No loops (edges joining a node to itself) and no multiple edges between the same two nodes.

  • Multigraph: Allows multiple edges between the same nodes, but no loops.

  • Pseudograph: Allows both multiple edges and self-loops.

  • Digraph (Directed Graph): Edges have a specific direction (arcs).

  • Directed Handshaking Theorem: $\sum \text{deg}^{-}(v) = \sum \text{deg}^{+}(v) = |E|$.

Special Classes of Graphs

• Complete Graphs ($K_n$): Every node is adjacent to every other node. It has $\frac{n(n-1)}{2}$ edges.

• Cycles ($C_n$): For $n \geq 3$, a simple closed path where each node has degree 2.

• Regular Graphs: Every vertex has the same degree $r$ ($r$-regular). $C_n$ is 2-regular; $K_n$ is $(n-1)$-regular.

• Paths ($P_n$): A sequence of distinct vertices; $P_n$ has $n-1$ edges.

• Wheels ($W_n$): Created by joining a central "hub" vertex to every vertex of a cycle $C_{n-1}$.

• Hypercubes ($Q_n$): Simple graphs representing an $n$-dimensional cube with $2^n$ vertices.

• Bipartite Graphs: The vertex set can be partitioned into two subsets $V_1$ and $V_2$ such that no edge joins vertices within the same subset. A graph is bipartite if and only if it contains no odd cycles.

• Complete Bipartite Graphs ($K_{m,n}$): A bipartite graph containing every possible edge between the two subsets.

Graph Operations and Representations

• Representation Methods:

  • Adjacency List: Lists each vertex and its neighbors.

  • Adjacency Matrix: A square matrix $A = [a_{ij}]$ where $a_{ij} = 1$ if an edge exists between vertex $i$ and $j$, and $0$ otherwise.

  • Incidence Matrix: A matrix with rows for vertices and columns for edges; a value of $1$ denotes incidence.

• Subgraphs: A graph whose vertices and edges are subsets of a larger graph.

• Graph Unions: The combination of two graphs where the vertex and edge sets are the unions of the originals.

• Graph Complement ($\bar{G}$): A graph with the same vertices where an edge exists if and only if it does not exist in the original graph.

• Isomorphism: Two graphs are isomorphic if there is a mapping (bijection) that makes them identical by renaming vertices while preserving adjacencies.

Connectivity, Planarity, and Polyhedra

• Walks, Trails, and Paths:

  • Walk: Sequence of vertices and edges.

  • Trail: A walk with distinct edges.

  • Path: A walk with distinct vertices.

• Connectivity: A graph is connected if a path exists between every pair of nodes.

  • Cutpoint: A node whose removal increases the number of connected components.

  • Bridge: An edge whose removal increases the number of connected components.

• Planar Graphs: Graphs that can be drawn in a plane without any edges crossing.

• Euler's Polyhedron Formula: For any finite planar graph or convex polyhedron: $V - E + F = 2$. This value is the Euler Characteristic.

• Non-Planar Graphs: $K_5$ and $K_{3,3}$ are not planar. This is proved using the inequality $kF \leq 2E$, where $k$ is the length of the shortest cycle.

• Kuratowski's Theorem: A graph is non-planar if and only if it contains a subgraph that is a homeomorph of $K_5$ or $K_{3,3}$.

Traversability: Circuits and Cycles

• Eulerian Graphs: A graph that contains a closed trail (Eulerian circuit) traversing every edge exactly once. This is possible if and only if every vertex has an even degree.

• Fleury's Algorithm: A method to find an Eulerian circuit by erasing edges as they are chosen, avoiding bridges unless no other option exists.

• Hamiltonian Graphs: A graph containing a cycle (Hamiltonian cycle) that visits every vertex exactly once. Examples include the graph of the dodecahedron and all complete graphs $K_n$.

• Famous Problems:

  • Chinese Postman Problem: Finding the shortest route that covers every edge of a graph at least once.

  • Traveling Salesman Problem: Finding the shortest route that visits every vertex exactly once and returns to the start.