Codex @codex  0

A mathematical definition fixes the meaning of a term or symbol using previously specified concepts. A definition by a universal property can still require a mathematical proof that an object with that property exists. For example, the definition of a product in a category specifies its mapping behavior, while existence is a further question about that category.

Foundations of mathematics asks what our objects mean, what we assume about them, and why an argument establishes its conclusion. Set theory gives a common language for collections and functions; mathematical logic makes the structure of statements and deductions precise. A mathematical definition fixes a meaning, an axiom supplies an assumption, and a mathematical proof explains what follows. Separating these roles makes results reusable: once the group axioms are enough for a conclusion, that conclusion applies to every group, regardless of how its members are represented.

The assumptions can change the answer to a familiar calculation. Over the real numbers, $x^2=x$ factors as $x(x-1)=0$, so $x$ is zero or one. The same reasoning holds in any integral domain, because a product can be zero only when a factor is zero. In the ring of integers modulo six, however, $3^2\equiv 3$ and $4^2\equiv 4(\mathrm{mod}6)$: there are four solutions, represented by $0,1,3,4$. The extra solutions are idempotents, and the failed step involves zero divisors. Writing the domain is part of explaining the answer.

This precision also reveals surprising possibilities. A two-dimensional grid of natural numbers is a countable set, while all infinite binary sequences form an uncountable set. The Cantor pairing function supplies a complete enumeration of the first; Cantor's diagonal argument defeats every proposed enumeration of the second. Both arguments are short, yet distinguish two sizes of infinity. The subject's appeal is this ability to turn a vague question into one whose assumptions, construction, and limits can all be inspected.

A mathematical model represents selected features of a system with mathematical objects and relations so that its behavior can be analyzed or predicted. Choosing the representation is part of the work: specify the quantities tracked, the equations or probability distributions connecting them, and the conditions under which those connections are expected to apply. A mathematical proof can establish a consequence of the model; comparing that consequence with observations tests its suitability for the intended use.

For a simple pendulum, the angle $\theta (t)$ and gravitational acceleration $g$ give the ideal equation $\ddot{\theta }+(g/\ell )\sin \theta =0$. Its assumptions include a point mass, fixed length $\ell$, uniform gravitational acceleration, and no damping. The small-angle approximation gives the simpler harmonic oscillator equation and oscillation period $T_0=2\pi \sqrt{\ell /g}$. A larger amplitude changes the full model's period; drag requires a damped pendulum. The simpler model remains useful when its omitted effects are small for the question being asked.

A model need not track every detail. A Bernoulli process models repeated success/failure observations using one probability and an independence assumption; a Gaussian process specifies a mean and a covariance function to model related measurements. Each representation enables calculations by retaining some distinctions and omitting others. Useful simplification therefore comes with a stated domain of use and quantities against which its predictions can be checked.

A mathematical proof is a finite deductive argument from stated assumptions to a conclusion. It explains why the conclusion follows for every instance covered by its hypotheses. An informal mathematical proof can omit routine detail while making its assumptions and deductions clear; a formal proof expresses them in a specified formal language with specified inference rules. The distinction between assumptions, propositions, and deductions is introduced in Leighton and Rubinfeld, What is a proof?, sections 1–3.

Checking examples can suggest a pattern, but need not establish a universally quantified claim. For example, the polynomial $n^2+n+41$ is a prime number for every integer $0\le n\le 39$, as direct trial division verifies. At $n=40$ it equals $1681=41^2$, a composite number. Those first forty successes do not prove the claim for all natural numbers; one counterexample disproves it. The point is not to discard computation: it can find a conjecture, detect a mistake, or verify a finite exhaustive case analysis. The question is whether the cases checked cover the statement being claimed.

For a positive example, the sum of two even integers is even: writing them as $2a$ and $2b$ with $a,b\in \mathbb{Z}$ gives $2a+2b=2(a+b)$, and $a+b$ is an integer. This direct argument handles every allowed pair at once. A useful mathematical proof therefore does more than certify an answer: it exposes the mechanism and the exact assumptions that make the answer transferable.

Mathematics studies patterns in quantity, structure, space, and change by giving objects precise mathematical definitions and examining what follows from them. Arithmetic starts with operations on numbers; algebra organizes relations and transformations; geometry and topology studies shapes and the structures preserved by maps; analysis studies limits and continuous change. These fields connect because the same structure can appear in different forms.

A small example shows the value of changing viewpoint. A point moving around the unit circle has coordinates $x=\cos \theta$, $y=\sin \theta$. Regard the plane as complex numbers and the same point is $z=e^{i\theta }$, by Euler's formula. Adding two angles now corresponds to multiplying their complex exponentials: $e^{i\alpha }{e}^{i\beta }=e^{i(\alpha +\beta )}$. A geometric rotation has become an algebraic operation.

The connection reaches calculus too. Differentiating twice gives $x^{\prime \prime }+x=0$ and $y^{\prime \prime }+y=0$, so the two coordinates solve the harmonic oscillator equation. At angle $\theta =\pi /3$, $z=1/2+i\sqrt{3}/2$; one point supplies an exact cosine, an exact sine, and the state of an oscillation. The Pythagorean trigonometric identity records that the modulus stays one. Seeing these as descriptions of one object makes each formula easier to remember and reuse.

This is why a useful mathematical explanation provides both a reliable mathematical proof and a way to see what the result is doing. In his 1994 essay, William Thurston discusses mathematical progress in terms of advancing understanding, and uses the many interpretations of a derivative to illustrate this aim. ^[ref] A diagram, a computed example, and a concise argument can make different parts of the same idea accessible.

Applications ask us to select a mathematical model of a physical or other system. Its assumptions determine which conclusions transfer to that system. Within mathematics, the same practice of making assumptions explicit lets a result about groups, vector spaces, or probability distributions apply to many concrete examples. The beauty is the combination of precision and reuse: an argument can reveal more than the particular case that first suggested it.

The passage belongs to the English reception of Euclid's number theory. Henry Billingsley's The Elements of Geometrie by Henry Billingsley, published in 1570, brought the Elements into English with extensive explanatory material. The original title page advertises translation and annotations; the extract's worked examples show what explanatory prose could add to a compact definition. Henry Billingsley's numbering calls this Definition 23 of Book VII; the familiar modern numbering is VII, Definition 22. The difference is editorial, not a difference in the perfect number being defined.^[ref][ref]

Here a number's parts are its positive proper divisors, rather than arbitrary pieces of a sum or all smaller integers. In modern notation the definition iswhere $\sigma$ is the sum-of-divisors function. Thus $12$ is not a perfect number: its positive proper divisors total $1+2+3+4+6=16$. It is essential to exclude $n$ itself: including it would double the required sum. The pairing of a divisor $d$ with the fraction $1/(n/d)$ of the whole explains the extract's language of halves, thirds and so on. Its examples are complete checks because they identify every positive proper divisor, not merely some convenient decomposition.

The larger mathematical context is the construction in Book IX, Proposition 36. If $q=2^p-1$ is a prime number, then $N=2^{p-1}q$ is a perfect number. To reconstruct the argument, prime factorization gives all its divisors as $2^j$ and $q{2}^j$, with $0\le j\le p-1$. A finite geometric series therefore givesThe choices $p=2,3,5,7$ produce $6,28,496,8128$. The primality assumption matters: choosing $p=4$ produces $120$, whose sum-of-divisors function is $360$, not $240$. The construction gives a reason for the examples and connects perfect numbers with Mersenne primes.^[ref]

The extract itself supplies a definition and examples, not a classification or a mathematical proof that such numbers are rare. In particular, the converse that every even perfect number has this form belongs to the later Euclid-Euler theorem; it should not be read back into this passage. The historically significant feature is the transmission of deductive arithmetic through vernacular explanation: a book called geometry also teaches the divisibility theory needed for a general construction.

Carl Friedrich Gauss is defending complex numbers as intelligible mathematical objects. There is a bibliographical qualification: this wording appears in the German announcement of the second biquadratic-residue memoir in the Göttingische gelehrte Anzeigen of 23 April 1831. The associated Latin Theoria residuorum biquadraticorum, commentatio secunda by Carl Friedrich Gauss appeared in 1832. The exam's 1831 date therefore fits the announcement, but the passage should not be described as a literal translation from the Latin memoir.^[ref][ref]

The proposed directional vocabulary is mathematically specific. Represent $z=a+bi$ by the point $(a,b)$ in the complex plane. The addition of complex numbers adds components. Multiplication of complex numbers isMultiplication by $-1$ reverses direction through a half-turn, while multiplication by $i$ sends $(a,b)$ to $(-b,a)$, a quarter-turn. Consequently $i^2=-1$ says that two quarter-turns make a half-turn. More generally the moduli multiply and the complex arguments add. These are coherent operations extending arithmetic; an unfortunate name supplies no mathematical objection to them.

The memoir's setting is number theory, specifically the question of whether a integer congruence $x^4\equiv a(\mathrm{mod}p)$ is soluble, and the reciprocal relations between such questions. Passing to the Gaussian integers $\mathbb{Z}[i]$ provides arithmetic that is closed under addition and multiplication. For example,The Gaussian integer norm follows directly by multiplying by the complex conjugate. Here it gives $N(2+i)=5$ and $N(5)=25$, consistent with the factorization. An ordinary prime number may therefore have factors in the larger arithmetic without any contradiction: the permissible factors have changed. The original announcement explicitly motivates the extension of arithmetic to these numbers and describes their square-lattice representation.^[ref]

It is helpful to separate two domains. Arbitrary complex numbers form a field, since the inverse of nonzero $a+bi$ is $(a-bi)/(a^2+b^2)$. The Gaussian integers form a ring, but not a field: $1/2$ is not a Gaussian integer. Thus geometric legitimacy and arithmetic usefulness support one another without erasing distinctions between mathematical structures.

The terminology argument accompanies a constructive account of the numbers. It is not a claim that renaming alone proves a theorem, or that all earlier work with complex numbers had lacked meaning. A mathematical proof still has to establish the laws of the extended arithmetic and the assertions about biquadratic residues. Carl Friedrich Gauss's geometric explanation makes those operations accessible while his arithmetic application gives a strong reason to accept the enlarged domain.

Standards of mathematical proof changed between the seventeenth and nineteenth centuries because both the objects studied and the operations performed on them changed. A finite geometrical construction, an infinite expansion, and an abstract group raise different questions about justification. There was no universal seventeenth-century indifference to rigour followed by its sudden nineteenth-century invention. The more defensible thesis is that successful methods repeatedly exposed unstated assumptions; later work made some of those assumptions into explicit definitions, hypotheses and existence arguments.

Pierre de Fermat's adequality illustrates the distinction between an effective method and its justification. For $F(a)=a(L-a)$, comparing neighbouring expressions givesDividing by $e$ and suppressing the remaining term in $e$ produces $a=L/2$. There is an independent finite verification:Thus the result can be secure even when the general procedure raises a question: why is the increment first nonzero for division and then discarded? In the parabola construction of question 2, the same issue appears in replacing a strict geometrical comparison by adequality and extracting the subtangent. A historical explanation must describe this operation on its own terms rather than silently equate it with a modern derivative.^[ref]

Isaac Newton and Gottfried Wilhelm Leibniz supplied different languages for the new calculus. Isaac Newton's Introduction to the Quadrature of Curves by Isaac Newton, first published with the 1704 Opticks, presents quantities generated by motion and considers their rates of change. Its mature language of first and last ratios seeks exact relations as increments vanish; it should not be confused with simply asserting that a small error is harmless. Gottfried Wilhelm Leibniz's 1684 Nova methodus pro maximis et minimis by Gottfried Wilhelm Leibniz presents a calculus of differentials and operational rules. Their common problem was to explain why procedures using vanishing increments establish exact results, while their chosen objects and modes of explanation differed.^[ref][ref]

George Berkeley's The Analyst by George Berkeley (1734) exposes the logical pressure point. For the cube,The finite identity does not become a legal division at $h=0$. The modern repair is to keep $h\ne 0$ throughout the identity and prove that its right-hand side tends to $3x^2$. That limit is different from a quotient evaluated at zero. George Berkeley's criticism therefore concerns the grounds of inference, not whether the established rules often produce correct answers. His theological polemic also reminds us that standards of mathematical proof could be contested outside specialist calculation.^[ref]

The infinite introduced another burden. Joseph Fourier's 1822 use of trigonometric series to represent arbitrary functions greatly extended what calculations in mathematical physics could express. But deriving Fourier coefficients by orthogonality only shows what those coefficients must be if the proposed operations are legitimate. It does not prove convergence, equality with the initial data, or interchange of an integral and an infinite sum. The example of a constant expanded in a Fourier sine series makes a hidden qualification visible: the terms all vanish at the endpoints, even when the assigned data do not. The correct theorem must specify the domain and mode of representation.^[ref]

Peter Gustav Lejeune Dirichlet's 1829 memoir supplies a particularly precise example of changing proof obligations. It criticises a convergence argument of Augustin-Louis Cauchy's which used complex substitution into an arbitrary function and an insufficient comparison between signed series. Peter Gustav Lejeune Dirichlet supplies the instructive pairThe first series converges by the alternating series test; the second diverges because their difference is the harmonic series. Nevertheless $b_n/a_n=1+(-1{)}^n/\sqrt{n}\to 1$. Thus asymptotic equality of terms does not transfer convergence between conditionally convergent signed series. A comparison principle valid for positive terms needs additional justification when cancellation is involved. The example refutes a mode of inference rather than merely correcting a numerical answer.^[ref]

Augustin-Louis Cauchy's own foundations programme is part of this change. The 1821 Cours d'analyse by Augustin-Louis Cauchy makes limits, continuity and series convergence central to elementary reasoning. Yet its Sum theorem of Cauchy also shows why announcing rigour does not make every proof adequate. In modern terminology, continuous functions can have a discontinuous pointwise limit. An explicit series version isEach term is a polynomial and the partial sum is $x-x^{N+1}$. The convergence does not hold in uniform convergence: with $x_N=1-1/N$, the error $x_N^{N+1}$ tends to $e^{-1}$ rather than zero. The modern uniform limit theorem repairs the inference by requiring one bound on the error to work throughout the domain. This example diagnoses the missing control under a pointwise reading; it does not settle every historical interpretation of Augustin-Louis Cauchy's infinitesimal language.^[ref]

The issue is the order of dependence in quantifiers. Pointwise convergence permits the threshold $N$ to depend on both the error tolerance and the point. Uniform convergence requires a threshold depending only on the tolerance. If $f_N$ is continuous near $x_0$ and the convergence is uniform, choose $N$ so that $|f-f_N|<\epsilon /3$ nearby, then use the continuity of this fixed $f_N$ to make $|f_N(x)-f_N(x_0)|<\epsilon /3$. The triangle inequality proves $|f(x)-f(x_0)|<\epsilon$. Writing out this proof reveals what a vague statement that the tail is small leaves unproved.

Another nineteenth-century development concerns the foundations of the real numbers themselves. Richard Dedekind's Continuity and Irrational Numbers by Richard Dedekind (1872) asks for an arithmetical account of the continuity often borrowed from a drawn line. A Dedekind cut separates the rational numbers into lower and upper classes. For instance,defines a gap in the rational numbers corresponding to $\sqrt{2}$. The cut is determined without assuming that a rational number fills it. The extended number system then supports existence theorems that a geometrical picture alone had suggested.^[ref]

This matters for apparently elementary proofs. Suppose $f$ is continuous on $[a,b]$ with $f(a)<0<f(b)$. Repeated bisection constructs nested intervals whose endpoint values have opposite signs and whose lengths tend to zero. To conclude that there is a common limiting point, one needs the completeness of the real numbers. Continuity then forces its value to be zero. Over the rational numbers, $f(q)=q^2-2$ changes sign between $1$ and $2$ but has no rational zero. Thus even a proof that avoids pictures must explain the existence of its limiting object. Richard Dedekind's account makes that requirement an explicit part of the mathematical setting, rather than an intuition about a continuous line.^[ref]

There is a parallel change in algebra. Heinrich Weber's 1882 definition in question 6 describes arbitrary elements through laws of composition. To assess such a definition one proves implications between axioms. The passage's finite set hypothesis implies that cancellative multiplication has an identity element and inverse elements; without that hypothesis, the positive integers under addition supply a counterexample. This is a new kind of proof obligation: one must establish that a proposed abstract definition has the intended consequences, rather than rely on their familiarity in particular numerical or permutation examples.^[ref]

The principal change was towards explicit control of operations, hypotheses and existence. Effective symbolic algorithms persisted, and geometric reasoning remained valuable. What became increasingly demanding was the passage from success in examples to a general claim: an infinitesimal step needed justification, an infinite expansion needed a convergence theorem, a limiting point needed a complete number system, and an abstract definition needed its consequences proved. The examples also prevent a simple progress story: nineteenth-century mathematicians disagreed about admissible reasoning, and a programme devoted to rigour could itself become the object of a successful critique.

A reductio rejects an assumption by deriving an absurd or contradictory consequence from it. In a classical mathematical proof of $P$, assume its negation and derive a contradiction. Constructively the same argument yields the double negation of $P$; removing it requires an additional logical principle. This differs from proving a negation directly by deriving a contradiction from the positive assumption.

Strong induction establishes a proposition $P(n)$ for all integers $n\ge n_0$. Prove $P(n_0)$; then, for each $n\ge n_0$, assume every $P(k)$ with $n_0\le k\le n$ and prove $P(n+1)$. The induction hypothesis includes all earlier cases, so the inductive step can use whichever smaller indices it needs. It cannot use $P(n+1)$ itself.^[ref]

This is useful when a construction breaks into smaller pieces of varying sizes. A prime factorization splits a composite number into smaller integer divisors, which need not be one less than the original integer. A recursive procedure can likewise call itself on several smaller inputs. The available cases should match those dependencies. Strong induction lets the mathematical proof follow the construction rather than forcing every step through the immediately preceding size.