abacus| n. (pl. abaci) |none|none|none| An ancient calculator consisting of a frame, rods, and beads.

A horizontal beam separates the frame into an upper deck and a lower deck, and a place notation is used to represent numbers and calculations by sliding the beads into various positions on the two decks. The abacus illustrated is the Chinese or "2/5" abacus (having 2 beads on each rod on the upper deck and 5 beads on each rod on the lower deck); the Japanese abacus is "1/4".
Abel, Henrik Neils|(1802 1829)|biograph|none|none| |
| Abel |
Norwegian algebraist who proved the unsolvability of the general quintic (fifth degree) equation by radicals. He published this landmark result when he was 22, but had great difficulty in getting contemporary establishment mathematicians (including Gauss and Cauchy) to notice his work. Suffering from tuberculosis, he returned to Norway from Paris, but continued to publish papers in Crelles Journal. He died in 1829, just as the mathematical world was beginning to wake up to his achievements.
Abelian group| n. |algebr|none|none| A group in which the group operation is commutative.
abscissa| n. |calculu|none|none| The first element of an ordered pair. Compare: ordinate.
absolute geometry| n. |geometr|none|none| Euclidean geometry without the parallel postulate.
absolute value| n. |none|none|none| For a real number x, the absolute value of x, denoted abs(x) or I x I, is defined by I x I = x if x >= 0, and I x I = x if x <= 0. Equivalently, the absolute value of x is the distance between x and 0 on the real number line. If z is a complex number, then I z I denotes the modulus of z, which is the distance between z and 0 in the Argand plane.
absolutely continuous| adj. |analysi|none|none| (Of measures:) Given a measurable space (X, M) and two signed measures m and n on X, then n is said to be absolutely continuous with respect to m, denoted by

if for any E in M such that m(E) = 0 we have n(E) = 0. (Of functions:) If f is a function with domain the set of real numbers and range the set of complex numbers, then f is absolutely continuous if for any positive e there is some d greater than zero such that for any finite set of disjoint intervals we have:

It is a theorem that f is absolutely continuous if and only if its derivative is integrable and the fundamental theorem of calculus holds for f.
abundant number| n. |numthry|none|none| A natural number whose proper factors have a sum greater than the number. For example, the proper factors of 12 are 1, 2, 3, 4, and 6, which sum to 16, so 12 is abundant. A number whose proper factors sum to less than the number is called deficient. Compare: perfect number.
accumulation point| n. |topolog|none|none| Given a set X, an accumulation point of X is a point p (which may or may not be in X) such that every neighborhood of p contains points of X different from p.
actual infinite| n.|none|none|none| An infinite set considered as a completed whole, e.g., the natural numbers in modern set theory. Aristotle distinguished the actually infinite from the potential infinite, and considered that only the latter was permissible to thought.
a.e.| adj. |analysi|none|none| See: almost everywhere.
algebra| n. |algebr|none|none| The term algebra has broadened enormously in modern mathematics from its original meaning as the abstract study of the laws of arithmetic, in which letters or other symbols are used in place of specific numbers in equations or other arithmetic statements. The term algebra should now be understood to denote any set of objects together with a collection of finitary operations defined on it. Thus, we may have an algebra of sets, an algebra of numbers, an algebra of functions, and so on. See the following entries for many particular uses of the words "algebra" and "algebaic."
algebra of functions| n. |analysi|none|none| Given a topological space X, an algebra of functions on X is a subset A of the space of all continuous functions on X such that for all functions f and g we have:- fg is in A,
- f + g is in A, and
- for all constants c, cf is in A
whenever f and g are in A.
algebra of sets| n. |analysi|none|none| Given a set X, an algebra on X is a collection of subsets of X which is closed under finite unions and complements. Such an algebra always includes the empty set and X itself. An algebra may also be defined as a ring of sets which includes X. An algebra of sets which is closed under countable unions is called a s-algebra.
algebraic function| n. |calculu|none|none| A function which operates on its variable(s) by addition, subtraction, multiplication, division, raising to a power, or extraction of roots. Compare: transcendental function.
algebraic number| n. |algebr|none|none| A real number or complex number which is the root of a polynomial with rational coefficients. Numbers that cannot be so expressed are called transcendental numbers. The algebraic numbers are countable.
almost everywhere| adj. |analysi|none|none| Given a measure m on a measure space X, a condition (e.g., continuity of functions, etc.) is said to hold almost everwhere if it holds on X N, i.e., on the set difference of X and N, where N is a null set. This is often abbreviated by "a.e."
alternating series test| n. |calculu|serie|none| A test for the convergence of a series. See the article for a complete description.
antinomy| n. |foundtns|none|none| A formal paradox such as the Russell Paradox or the Banach-Tarski Paradox.
anxiety, math| n.|none|none|anxiety| A fear or emotional dislike of mathematics, characterized by difficulty learning or mastering mathematical techniques or concepts, poor performance on exams despite careful preparation, etc.
Archimedes|(287 212 b.c.)|biograph|none|none| |
| Archimedes |
Greek geometer and applied mathematician who lived at Syracuse, a Greek settlement on the coast of Sicily. He is famous both for his profound mathematical work and for his ingenious mechanical inventions, which at the end of his life he used to defend his city against the Romans during the Second Punic War. When he discovered the hydrostatic principle that a floating body of a given weight displaces a volume of liquid having an equal weight he is reputed to have jumped from his bath and run naked through the streets shouting Eureka! (I have found it!) Archimedes is credited with many brilliant mathematical discoveries, especially in properties of geometrical figures, areas and volumes of conics, and principles of trigonometry. (He is thought to have known Heron's formula several centuries before Heron.) He found areas of plane figures by the method of exhaustion, prefiguring modern integral calculus. He was killed by a Roman soldier during the sack of Syracuse.
Aristotle|(384 322 b.c.)|biograph|none|none| |
| Aristotle |
Greek philosopher and scientist who developed syllogistic logic as a formal scholastic discipline. He defined the syllogism as a discourse in which certain things having been stated, something else follows of necessity from their being so. Aristotles philosophy of the infinite, in which he held that only the potential infinite, and not any collection which was actually infinite, could be entertained by the reason, held great authority for 2,000 years, until Georg Cantor introduced his theory of transfinite sets in the 19th century. Aristotle wrote widely on every field of learning, interpreted and disagreed with the writings of his teacher Plato, and served as tutor to Alexander the Great.
Ascoli-Arzelà Theorem| n. |topolog|none|none| If {X} is a compact Hausdorff space and F is an equicontinuous, pointwise bounded subset of the space C(X) of continuous functions on X, then F is totally bounded in the uniform metric and the closure of F in C(X) is compact. Also, if X is a s-compact, locally compact Hausdorff space and if (fn} is an equicontinuous, pointwise bounded sequence in C(X), then there exists a subsequence and an f in C(X) such that the subsequence converges to f uniformly on compact sets.
associative| adj. |algebr|none|none| An operation * on a set A is associative if for all a, b, and c in A, (a*b)*c = a*(b*c). Cf. commutative, distributive.
associative property| n. |algebr|none|none| A property of numbers which states that the operations of addition and multiplication are associative.
axiom| n. |foundtns|none|none| In formal logic, a formula or schema of formulas stipulated as true in the system, i.e., not standing in need of proof. Axioms are the counterpart in formal logic of suppositions, assumptions, or premises in ordinary syllogistic logic.
axiom of choice| n. |foundtns|none|none| An axiom of set theory, particularly ZFC, which asserts that from any (infinite) family of sets a new set may be created containing exactly one element from each set in the family. This axiom has been shown to be independent of the other axioms of ZFC (ZF). It is equivalent to: 1) Zorn's Lemma; 2) the Hausdorff Maximality Theorem; 3) the well-ordering principle; and 4) the statement that the cartesian product of an infinite family of sets is non-empty. Because the axiom of choice permits non-constructive proofs, it is rejected by intuitionism, and careful mathematicians refer explicitly to its use in proofs which require it.
Baire Category Theorem| n. |analysi|none|none| If X is a complete metric space, then the intersection of a countable collection of dense open subsets of X is also dense. Equivalently, the union of a countable collection of closed, nowhere dense subsets of X is nowhere dense.
Banach space| n. |analysi|none|none| A complete normed space.
Banach-Tarski Paradox| n. |foundtns|none|none| Given two bounded subsets of 3-dimensional Euclidean space, provided each has interior points, then the first may be decomposed into finitely many pieces and translated by rigid motions into a subset congruent to the second subset. For instance, a ball of unit radius can be decomposed into finitely many pieces, and then reassembled into two balls of unit radius. This shocking result is a consequence of the axiom of choice.
base| n. |topolog|none|none| Given a topological space X, a base is a class B of sets such that, for every x in X and every neighborhood U of x, there is a set b in B such that x is contained in b and b is contained in U.
bijective| adj. |analysi|none|none| A function is bijective if it is both injective and surjective, i.e., both one-to-one and onto.
Bolzano-Weierstrass property| n. |topolog|none|none| A topological space X is said to have the Bolzano-Weierstrass property if every infinite sequence in X has a convergent subsequence. It is a theorem that every compact space has the Bolzano-Weierstrass property.
Borel measure| n. |analysi|none|none| A measure m on a metric space X defined on a s-algebra of sets which contains the Borel sets is called a Borel measure. See also: Lebesgue measure.
Borel set| n. |analysi|none|none| If X is a topological space, then the s-algebra of sets generated by the open sets of X is called the Borel s-algebra, and its members are called Borel sets. The Borel subsets of the real line are generated by the open intervals (equivalently, by the closed intervals, half-open intervals, and rays).
bound| n. |none|none|none| A lower bound of any subset of a linear order (linearly ordered set) is an element which is less than or equal to every element of the subset. The greatest lower bound is the largest of its lower bounds. An upper bound of any subset of a linear order is an element which is greater than or equal to every element of the subset. The least upper bound is the smallest of the upper bounds. See also: infimum, supremum.
bounded| adj. |none|none|none| A sequence of values is called bounded if there is a value M such that the values are never bigger than M and never smaller than M. A function is bounded if its values are bounded. A sequence of functions is pointwise bounded if at every domain element x the sequence of values of the functions at x is bounded. A subset E of a locally compact topological space is bounded if there exists a compact set C such that E is contained in C. Such a subset is called s-bounded if there exists a sequence of compact sets Ci such that E is contained in their union. See also: totally bounded.
bounded variation| n. |analysi|none|none| A function on the real numbers with range in the complex numbers is said to be of bounded variation if its total variation is finite. The space of all such functions is denoted by BV. If in addition f is right continuous and its limit at negative infinity is zero, then f is said to be of normalized bounded variation. The space of such functions is denoted by NBV.
Bourbaki, Nicolas| (1935 ) |biograph|none|none|Although the myth of an actual French mathematician named Bourbaki was maintained for many years, it became generally known in 1952 that Bourbaki is the nom de plume of a private congress of young French mathematicians which formed in 1935, with the purpose of writing a comprehensive exposition of modern mathematics in many volumes, called Elements. Bourbaki's original members included André Weil, Henri Cartan, Claude Chevalley, and Jean Dieudonné. Other mathematicians have been recruited into Bourbaki in the years since, including G. de Rham, A. Grothendieck, S. Lang, and R. Thom. A principle motivation for the activity of the Bourbaki group is the felt need to unify the entire corpus of mathematical work in the face of accelerating diversification and specialization of mathematics.
Cantor, Georg| (1845 1918) |biograph|none|none|  |
| Georg Cantor |
German mathematician and founder of modern set theory. Cantor's concern with the set-theoretic nature of the real numbers began while he was working on certain properties of trigonometric series during the early 1870s. Inspired by the work of his friend Dedekind, Cantor proved in 1873 that the rational numbers are countable, and later the same year proved that the real numbers themselves are uncountable. These proofs introduced important methods, including the notion of a one-to-one correspondence and the method of diagonalization. (See the Infinity Minitext for a full treatment of these ideas.) Cantor's results were counterintuitive and broke with established dogma about the nature of infinity. Consequently, he became a controversial figure, opposed by some mathematicians (e.g., Kronecker) who used their influence to stifle Cantor's career as much as possible. This opposition exacerbated Cantor's predisposition to severe depression, and he ultimately died, of a heart attack, in a sanitorium.
Cantor set| n. |foundtns|cantset|none| A subset of the unit interval (on the real number line) which is a perfect set, nowhere dense, and uncountable. See the article for a complete exposition.
Cantor's Theorem| n. |foundtns|cantor_theorem|none| Given any set, a new set may be constructed which is cardinally larger, i.e., whose size is represented by a larger cardinal than the size of the initial set. More specifically, for no set X is there a bijection of X onto its power set. This theorem establishes both that there are different sizes of infinity, and that there is no greatest such size. Cantor's proof was the first use of a diagonalization argument to derive a contradiction.
Cantor-Bendixson Theorem| n. |topolog|none|none| Every closed subset of the real numbers is the disjoint union of a perfect set and a countable set. See: derived set.
Carathéodory's Theorem| n. |analysi|none|none| See: outer measure.
cardinal| n. |foundtns|none|none| A cardinal number represents the size of a set irrespective of the order or structure of its elements. A cardinal is an initial ordinal, i.e., an ordinal for which there does not exist a bijection onto any lesser ordinal. Thus, all finite ordinals are cardinals, but most transfinite ordinals are not cardinals.
cardinality| n. |foundtns|none|none| Two sets X and Y have the same cardinality if there exists a bijection between them. Specifically, the cardinality of X may be understood as a canonical object meant to represent the proper class of sets to which X is bijective. If the axiom of choice is assumed, then the cardinality of X is the unique cardinal number having the same cardinality as X
Carrolls Paradox| n. |foundtns|carroll|none| Paradox published by Lewis Carroll as What the Tortoise Said to Achilles. See the article for a full exposition. See also: Dodgson, Charles Lutwidge.
Cartesian plane| n. |calculu|none|none| The Cartesian product R2, represented graphically by two real number lines at right angles to one another, with the point (0,0) at the intersection.

Used for graphing functions from the set of real numbers to itself. The quadrants, numbered I - IV as shown, indicate the regions of the plane where the x and y axes are positive and negative. Compare: Argand plane.
Cartesian product| n. |analysi|none|none| For any collection {Ai}, i = 1, 2, 3, ..., n, of sets, the Cartesian product

is the set of ordered n-tuples (a1,a2, ... ,an) with a1 an element of A1, a2 an element of A2, etc. The Cartesian product R2 of the set of real numbers is called the Cartesian plane, and in general n-dimensional real space is the Cartesian product Rn. The assertion that the Cartesian product of an infinite collection of non-empty sets is non-empty is equivalent to the axiom of choice.
Cauchy sequence| n. |analysi|none|none| A sequence (x1, x2, x3, ... ) of elements of a metric space X with metric d(x, y) is Cauchy if for any e greater than zero there is some natural number N such that

CH| n. |foundtns|none|none| See: continuum hypothesis.
characteristic function| n. |analysi|none|none| Given a subset E of a space X, the characteristic function cE is defined by cE(x) is equal to 1 if x is in E, and 0 otherwise. All properties of sets and set operations may be expressed by means of characteristic functions.
choice, axiom of| n. |foundtns|none|none| See: axiom of choice.
circle| n. |geometr|none|none| In a plane, the locus of all points equidistant from a given point, called the center. The general equation for a circle in the Cartesian plane is given by (x - h) 2 + (y - k) 2 = r 2, where r is the radius of the circle (distance from the center of the locus of points), and (h, k) are the coordinates of the center.
closed interval| n. |calculu|none|none| An interval of the real number line which includes its endpoints. An interval containing only one of its endpoints is called half-open. Compare: open interval.
closed set| n. |topolog|none|none| A subset E of a topological space X is closed if X - E (set difference) is open. In a metric space, E is closed if every convergent sequence in E converges in E; equivalently, if every accumulation point of X is in X.
closed set system| n. |foundtns|none|none| If X is a set (or class) and F is a family of subsets of X, then F is called a closed set system provided- X is a member of F, and
- F is closed under arbitrary intersections.
Compare: filter.
closure| n. |topolog|none|none| The closure of a subset E of a topological space is the smallest closed set containing E. It may also be expressed as the union of E with its accumulation points. If E is closed, then it is equal to its closure.
closure operator| n. |foundtns|none|none| If X is a set, then a function C from P(X) into P(X) (i.e., a function on the power set of X) is called a closure operator provided- Y is an element of C(Y) for every subset Y of X,
- C(C(Y)) = C(Y) for every subset Y of X, and
- If Y and Z are both subsets of X, with Y a subset of Z, then C(Y) is a subset of C(Z).
Closure operators induce closed set systems.
combination| n. |none|none|none| A subselection of a set of r elements from a set of n elements. The number of such combinations, i.e., the number of ways in which r elements may be chosen from a set of n elements, is given by the formula

This operation is also sometimes denoted by nC r, and is read n choose r. Compare: permutation. See also: factorial.
common logarithm| n. |none|none|none| A logarithm with base 10.
commutative| adj. |algebr|none|none| An operation * on elements of a set A is commutative if for all elements a, b in A, a*b = b*a. Cf. commutative property.
commutative property| n. |algebr|none|none| A property of numbers which states that the operations of addition and multiplication are commutative. Cf. distributive, associative.
compact| adj. |topolog|none|none| In a topological space, a set E is compact if every open covering of E has a finite subcover, i.e., a finite subcollection which also covers E. A space X is compact if and only if every collection of closed sets with the finite intersection property has a non-empty intersection. E is called s-compact if there exists a sequence of compact sets Ci such that E is contained in their union. See also: locally compact, Bolzano-Weierstrass property, Heine-Borel property.
comparison test| n. |calculu|serie|none| A test for the convergence of a series. See the article for a complete description.
complete| adj. |analysi|none|none| A metric space X is complete if every Cauchy sequence in X converges in X.
complete measure| n. |analysi|none|none| See measure.
complex number| n. |none|none|none| An element of the set C of numbers of the form a + bi, where a and b are real numbers and i 2 = -1. The number i is called the imaginary number.
conditional| n. |foundtns|none|none| A statement of the form if A then B, or A implies B. A conditional is equivalent to its contrapositive, not B implies not A. See also: inverse and converse.
cone| n. |geometr|conics|none| The infinite surface of revolution generated as shown:

The term also refers to the solid bounded by one of the nappes and a flat elliptical base. If in this case the base is circular (i.e., at right angles to the axis), the cone is called a right circular cone. The surface area S (excluding the base) and volume V of a right circular cone are given by

See also: conic section.
conic section| n. |geometr|conics|none| A plane curve, either the ellipse, parabola, or hyperbola, which results from the intersection of a plane with a cone. See the article for a full exposition. See also: Dandelins Spheres.
connected| adj. |topolog|none|none| A topological space X is connected if there are no two open sets of X whose union is X and whose intersection is empty.
constant| n. |none|none|none| An unvarying quantity, usually represented notationally by an alphabetic letter such as k, c, etc.
constant function| n. |none|none|none| A constant function f is one whose value is the same at all points of its domain.
continuous| adj. |analysi|none|none| (Analysis) A function f is continuous at a point x of its domain if, whenever we are given a number e greater than 0, we may find a d greater than 0 so that whenever y is within a d-neighborhood of x, then f(y) is within an e-neighborhood of f(x). (Topology) A transformation of one topological space into another is continuous if the inverse image of every open set is open, or equivalently if the inverse image of every closed set is closed. See also: uniformly continuous, equicontinuous, absolutely continuous.
continuum| n. |foundtns|godel|infinity| In mathematics, the real numbers or "real number line."
continuum hypothesis| n. |foundtns|godel|infinity| The claim that there is no set of intermediate cardinality between the natural numbers and the power set of the natural numbers (i.e., the continuum, or set of real numbers). See: generalized continuum hypothesis.
contrapositive| n. |foundtns|none|none| Given a conditional, i.e., a statement of the form if A then B, or A implies B, its contrapositive is not B implies not A. A conditional and its contrapositive are logically equivalent. Consequently, in mathematics, to prove a conditional it is a good strategy (and often easier) to prove its contrapositive instead. See also: inverse and converse.
convergent sequence| n. |calculu|none|none| See sequence.
convergent series| n. |calculu|serie|none| See series.
converse| n. |foundtns|none|none| Given a conditional, i.e., a statement of the form if A then B, or A implies B, its converse is B implies A. A conditional neither implies nor is implied by its converse. However, the converse of a conditional and its inverse are logically equivalent, since they are contrapositives of each other.
countable| adj. |foundtns|none|infinity| A set is countable if it is either finite or countably infinite.
countably infinite| adj. |foundtns|none|infinity| A set is countably infinite if it is bijective to the set of natural numbers (finite ordinals), i.e., if there exists a complete one-to-one mapping of the set in question onto the set N. Georg Cantor proved that sets may be uncountably infinite, for example the set of real numbers.
cube| n. |geometr|none|none| A regular polyhedron having six square faces. More generally, an n-dimensional cube in the first quadrant of a Euclidean space with one vertex at the origin is given by the collection of all n-tuples of the form (e1,e2, ... , en), with each ei an element of the set {0,1}. See platonic solid.
Dandelins Spheres| n. |geometr|dandelin|none| A proof by the 17th century French mathematician Germinal Dandelin of the equivalence of the plane geometry and conic section definitions of the ellipse, parabola, and hyperbola. See the article for a full exposition.
deficient number| n. |numthry|none|none| See: abundant number.
definite integral| n. |calculu|none|none| See: integral.
dense| adj. |topolog|none|none| Given a space X and a subset A of X, we say that A is dense if the intersection of every open set of X with A is non-empty. E.g., the rational numbers are dense in the real numbers.
denumerable| adj.|foundtns|none|infinity| See countably infinite.
derivative| n. |calculu|none|none| For a function f of a single real variable x, the derivative is defined as the limit of the difference quotient

provided this limit exists. In practice, the derivative is interpreted as the instantaneous rate of change of the function at x. Graphically, the derivative returns the slope of the tangent at x. See differentiation rules.
derived set| n. |topolog|none|none| Given a set X, the derived set of X is the set of accumulation points of X. The second derived set is the derived set of the derived set, and so on. See: Cantor-Bendixson Theorem.
Descartes, René|(1596 1650)|biograph|none|none| |
| René Descartes |
French mathematician who is generally considered to have laid the foundations for modern mathematics. His greatest achievement was the invention of analytic geometry, in which the methods of algebra and those of geometry are used together. He is also a central figure in the history of modern philosophy; his treatises Meditations and Discourse on Method laid the groundwork both for modern rationalism and modern skepticism. Descartes did not actually use the rectangular coordinate system associated with the Cartesian plane (this was developed by Leibniz and others), and he permitted only positive values for his variables. Nonetheless, his development of algebraic methods in geometry made possible an explosion of analytic discoveries by his successors, the most important of which was the discovery of the calculus less than a generation after Descartes' death.
descriptive statistics| n. |statisti|none|none| Those statistics used to describe a sample or population. Cf. inferential statistics.
differentiation rule| n. |calculu|dif_rule|none| A rule permitting easy differentiation of functions having certain forms. See the article for a complete description. See also: derivative.
Diophantine equation| n. |numthry|none|none| A polynomial equation with integer coefficients. (Named after the 3rd century Greek mathematician Diophantus of Alexandria.) See: Hilberts Problems (the tenth problem), Fermats Last Theorem.
discrete| n. |topolog|none|none| A topology on a set X is discrete if every subset of X is open, or equivalently, if every one-point set of X is open. So-called "Discrete Mathematics" consists of those branches of mathematics which are concerned with the relations among fixed rather than continuously varying quantities, e.g., combinatorics and probability.
disjoint| adj. |none|none|none| Two sets are disjoint if they have empty intersection.
disjoint union| n. |none|none|none| A union of sets which are disjoint.
distance| n. |calculu|none|none| The distance between two points in a space is given by the length of the geodesic joining those two points. In Euclidean space, the geodesic is given by a straight line, and the distance between two points is the length of this line. The distance between two points a and b on a real number line is the absolute value of their difference, i.e., d(a, b) = abs(a b). In two (or more) dimensions, the distance is given by the (generalized) Pythagorean theorem, i.e., in a Cartesian coordinate system of n dimensions, where a = (a1, ... ,an) and b = (b1, ... ,bn), the distance d(a, b) is given by

The concept of distance may be generalized to more abstract spaces such a distance concept is referred to as a metric.
distributive|none|algebr|none|none| See distributive property.
distributive property| n. |algebr|none|none| An algebraic property of numbers which states that for all numbers a, b, and c, a(b+c) = ab+ac. Compare: commutative, associative.
dodecahedron| n. [pl. dodecahedrons or dodecahedra]|geometr|none|none| A regular solid having twelve similar pentagonal sides. See also platonic solids, polyhedron.
Dodgson, Charles Lutwidge|(1832 1898)|biograph|carroll|none| |
| C. L. Dodgson |
Oxford mathematician most famous for the books Alice in Wonderland and Through the Looking Glass, which he wrote under the pseudonym Lewis Carroll. However, he also wrote several mathematics textbooks, and delighted in inventing bizarre and humorous syllogisms for exercises in Aristotelian logic. These syllogisms commonly appear in introductory texts on logic to this day. He also formulated what is now called Carrolls Paradox (see the article), which shows the need for formal rules of inference in any system of logic.
domain| n. |calculu|none|none| (1) A universe of discourse. (2) (functions) The domain of a function is the set of elements which the function maps to its range set.
dot product| n. |analysi|none|none| See scalar product.
e| n. |none|none|none| See Euler number.
ellipse| n. |geometr|conics|none| The locus of points in the plane, the sum of whose distances from two fixed points, called the foci, remains constant.

Like the hyperbola and parabola, the ellipse is a conic section. See the article for a full exposition.
empty set| n. |foundtns|none|none| The unique set having no elements, generally denoted by a circle with a forward dash through it.
Epimenides Paradox| n. |foundtns|none|none| See Liar Paradox.
equicontinuous| adj. |analysi|none|none| Let C[a,b] denote the space of all continuous functions on the real interval [a,b]. A subset S of C[0,1] is called equicontinuous at x in [a,b] if for any e greater than zero there is some d greater than zero such that for every function f in S we have:

equilateral triangle| n. |geometr|none|none| A triangle with equal sides and equal angles.

Escher, M.C.|(1898 1972)|biograph|none|escher| (Maurits Cornelis Escher) Dutch graphic artist whose works exhibit many mathematical concepts, including tessellations, infinity, and polyhedra.
Euclidean geometry| n. |geometr|none|none| The theory of geometry arising from the five postulates (axioms) of Euclid: - That any two points determine a line;
- That any line may be extended indefinitely;
- That a circle may be drawn with any center and radius;
- That all right angles are equal to one another;
- That, if a straight line falling on two straight lines makes the interior angles on the same side less than two right angles, the two straight lines, if produced indefinitely, meet on that side on which the angles are less than two right angles.
Euclidean geometry is characterized by the 5th postulate, also called the parallels postulate, which may be restated as; given a line and a point not on the line, exactly one line may be drawn through the given point parallel to the given line. Theories of geometry which reject the 5th postulate form the subject of non-Euclidean geometry. Euclid recorded his theory of geometry in his 13-book opus titled Elements, c. 300 b.c., and his theory was considered the only true theory of geometry until the 18th century, when non-Euclidean geometry was discovered independently by Nikolai Lobachevsky, Janos Bolyai, and Karl Friedrich Gauss. Euclids axioms were found to be deficient in the 19th century, and Euclidean geometry was re-axiomatized by David Hilbert with the addition of a between-ness axiom, and the relegation of the concepts of point and line, which Euclid had defined, to the status of undefined terms.
Euclidean space| n. |geometr|none|none| A space satisfying the axioms of Euclidean geometry. Specifically, a space in which the parallel postulate holds; equivalently, a space in which the distance between points is given by a straight line. Compare: Euclidean geometry, non-Euclidean geometry.
Euler number| n. |none|none|none| The transcendental number e, approximately 2.71828... It may be defined as the limit

or as the infinite sum

The function ex is called the exponential function, and has the property that it is its own derivative.
Euler phi function| n. |numthry|none|none| Given a natural number n, this function returns the number of integers between 1 and n which are relatively prime to n.
even function| n. |calculu|none|none| A real-valued function y = f(x) is even if f(x) = f(x) for all x in the domain of f. The graph of an even function in the Cartesian plane is symmetric with respect to the y-axis. Cf. odd function.
exp| n. |none|none|none| See exponential function.
exponent| n. |none|none|none| Also called index, a number or expression applying to another number or expression, called the base, and indicating that the base is to be raised to the power of the exponent. For integers, this corresponds to the operation of repeated self-multiplication the number of times specified by the exponent. The exponent is written to the right of, and superscripted to, the base. See also: rational exponent, laws of exponents.
exponential function| n. |none|none|none| The function ex. We say that an expression is expontiated when it is used as an exponent on e. See also: Euler number.
factorial| n. |none|none|none| An operation on natural numbers, denoted n! and given by n! = 1 × 2 × 3 × ... × n. Thus 3! = 1 × 2 × 3 = 6, and 4! = 24. By convention, 0! = 1 and 1! = 1.
fallacy| n. |foundtns|fallac|none| An unjustified step in logic, or incorrect form of reasoning, leading to an invalid conclusion. See the article for a complete description.
Fermats Last Theorem| n. |numthry|none|none| The Diophantine equation x n + y n = z n has no non-trivial solutions in integers x, y, and z for any n greater than 2. (There are infinitely many solutions in integers for n = 2, and these are called the Pythagorean triples.) Fermat penned this theorem in the margin of his copy of the Arithmetica of Diophantus of Alexandria, and added, I have discovered a remarkable proof of this theorem, which unfortunately this margin is too small to contain. He died without ever writing down the proof, and the theorem remained unproved for 300 years, until Andrew Wiles presented a proof at a Cambridge lecture in 1992.
Fermats Little Theorem| n. |numthry|none|none| For any integer n and prime number p that does not divide n, n p - 1 is congruent to 1 modulo p. See: Euler phi function.
Fibonacci| (1170 1250) |biograph|none|none|  |
| Fibonacci |
Medieval Italian mathematician, whose real name was Leonardo of Pisa. (Fibonacci is a nickname meaning son of Bonaccio.) Although best known for the number-sequence which bears his name, his most important contribution to mathematics was introducing the Arabic numerals to Europe through his book Liber Abaci (pub. 1202), a treatise on algebraic methods of arithmetic, and the application of these methods in business. Fibonacci was a businessman and the son of a businessman, educated in North Africa, and it was on his extensive travels in the near east and Africa that he became familiar with the notation which made practical commerce so much easier, since it was a place notation and hence made algorithmic arithmetic calculations possible. It was in the Liber Abaci that the problem which leads to his famous sequence was posed and solved:How many pairs of rabbits will be produced in a year, beginning with a single pair, if in every month each pair bears a new pair which becomes productive from the second month on?
The solution gives rise to the sequence beginning 1, 1, ..., and in which each succeeding term is given by adding the previous two. See: Fibonacci sequence.
Fibonacci sequence| n. |none|fibonac|none| The sequence discovered by the medieval mathematician Fibonacci, and described in his book Liber Abaci. See the article for a complete description.
field| n. |algebr|none|none| A set together with two binary operations (called addition and multiplication) defined on its elements, and satisfying - the set is an Abelian group under the addition operation,
- the set is a commutative ring with addition as the group operation and multiplication as the ring operation, and
- every element except the additive identity has a multiplicative inverse (i.e., the set is a division ring).
In other words, a field is a commutative division ring. If in addition the field is linearly ordered, it is called an ordered field. An ordered field is complete if every subset of the field with an upper bound has a least upper bound. The real numbers are fully characterized by the fact that they form a complete ordered field, that is, every complete ordered field is isomorphic to the real numbers.
filter| n. |foundtns|none|none| If X is a set (or class) and F is a family of subsets of X, then F is called a filter provided- F is closed under intersections, i.e., for any sets A, B in F their intersection is also in F, and
- F is closed under supersets (upwardly closed), i.e., if A is any set in F and B is any set in X containing A, then B is in F.
If X and F are as above, and if in addition for every subset Y of X either Y or its complement is in F, then F is called an ultrafilter (or maximal filter). Equivalently, an ultrafilter is a filter that is not the proper subset of any filter. A free ultrafilter is an ultrafilter which contains the complement of every finite set. If A is any subset if X, then the collection of supersets of A together with all finite intersections of supersets of A is called the filter generated by A. More generally, if U is any family of subsets of X that is closed unter finite intersections, then the family F of subsets which includes precisely U and all of the intersections of supersets of members of U is the filter generated by U, and U is called its filter base. If a filter F is generated by a singleton set, then it is called a principal filter.
finite intersection property| adj. |analysi|none|none| A collection of sets has the finite intersection property if every finite subcollection has non-empty intersection.
finite measure| n. |analysi|none|none| See measure.
Frege, Gottlob| (1848 1925) |biograph|none|none|  |
Gottlob Frege |
German philosopher and logician, and the founder of mathematical logic. He wrote Begriffsschrift (1879) and Grundlagen der Arithmetik (1884), in which he formulated the principles of the propositional calculus and the logical foundations of arithmetic, respectively. In the course of his work Frege developed other branches of logic, including the predicate calculus, second-order logic, and a version of naive set theory. He believed that arithmetic itself could be shown to be a branch of logic, and his chief concern was to determine whether proofs in arithmetic rest on logic alone, or need empirical facts for their support. Frege was a realist, as is demonstrated by his thesis that concepts are denotations of their extensions. The number two, for example, is a concept denoting its extension the class of all collections having two elements. This is contrasted with Bertrand Russells conception of number as having no referent, but existing only as a contextual definition.
function| n. |calculu|none|none| Given a binary relation R on sets A and B, we say that the R is a function if each element of A is paired with at most one element of B. In this case we call A the domain set, and we call B the range set. If f is such a function and the ordered pair (x,y) is an element of the function, we typically write f(x) = y. More generally, if R is an n-place relation, then R is a function of n-1 variables if each (n-1)-tuple is matched with at most one element of the range set (i.e., the nth set of the Cartesian product on which the relation is defined). If in addition there is at most one element of the domain set matched with any given element of the range set, then the function is called one-to-one or injective. If the function maps at least one element of the domain set to every element of its range set, then it is called onto or surjective. A function which is both injective and surjective is called bijective. Functions with range in the real numbers or complex numbers are called real-valued or complex-valued respectively.
functional calculus| n. |foundtns|none|none| See: predicate calculus.
Fundamental Theorem of Arithmetic| n. |numthry|fta|none| Every natural number is either prime or may be decomposed uniquely into prime factors.
Gallilei, Galileo|(1564 1642)|biograph|none|none| |
| Galileo Galilei |
Italian mathematician, physicist, and astronomer who is generally associated with the birth of modern science. Such discoveries as that bodies of different size and weight fall at the same speed (i.e., that gravitational acceleration is independent of mass), overthrew two millenia of Aristotelian doctrines. They also greatly annoyed certain factions within the Church, which was only just coming to terms with the birth of science, and ultimately brought about a showdown with ecclesiastical authorities that effectively silenced Galileo at the end of his life. Galileo's importance in the history of mathematics stems less from his purely mathematical work than from his promulgation of an outlook, especially in the sciences, that intellectual inquiry must not be fettered by prejudice if it is to bear fruit.
g.c.d.| n. |none|none|none| Abbreviation for greatest common divisor.
GCH| n. |foundtns|none|none| See: generalized continuum hypothesis.
Gelfond-Schneider Theorem| n. |numthry|none|none| For complex numbers a that are also algebraic numbers, and irrational numbers b, a b is a transcendental number.
generalized continuum hypothesis| n. |foundtns|godel|infinity| The claim that there is no set of intermediate cardinality between any given set and its power set. The GCH is independent of (i.e., cannot be proved true or false by) the known axioms of set theory. See: continuum hypothesis.
geodesic| n. |geometr|none|none| A curve on a space is a geodesic if given any two points on the curve the segment of the curve joining the points is the shortest such curve. In Euclidean space, geodesics are straight lines. On a sphere, the geodesics are the great circles of the sphere.
geometric series| n. |calculu|serie|none| An infinite series such that the ratio of consecutive terms is constant. Such a series may be denoted

where r is the common ratio. A geometric series converges if and only if the common ratio is less than 1, in which case the sum of the series is given by

g.l.b.| n. |none|none|none| Abbreviation for greatest lower bound.
Godel, Kurt| (1906 1978) |biograph|godel|none|  |
| Kurt Gödel |
The foremost logician of the 20th century. He is famous for many deep results in the foundations of mathematics, including the Godel Completeness Theorem, the Godel Incompleteness Theorem(s), and that the generalized continuum hypothesis and the axiom of choice are consistent with the other axioms of set theory. He moved from Austria to the Institute for Advanced Study at Princeton, New Jersey, in 1940. He was a lifelong friend of Albert Einstein, and in the 1950s formulated versions of Einsteins relativity theories that permitted the logical possibility of time travel.
graph| n. |none|none|none| (1) A picture or diagram representing one or more relationships among certain quantities. (2) The graph of a function: this is the collection of ordered tuples (x,y), consisting of domain elements x (possibly also tuples) and corresponding range elements y. Although informally we often mean the picture when we speak of the graph of a function, the graph should always be formally thought of as a set of tuples. (3) (graph theory) A collection of nodes, together with a set of edges joining the nodes. See Konigsberg Bridge Problem.
greatest common divisor| n. |numthry|none|none| The greatest common divisor of two natural numbers a and b is the largest natural number c such that c divides a and c divides b.
greatest lower bound| n. |none|none|none| A lower bound which is greater than or equal to every other lower bound.
Greek| n. |none|greek|none| Letters of the Greek alphabet are used throughout mathematics. See the article for a full description.
group| n. |algebr|none|none| A set together with a binary operation defined on its elements, satisfying - The group operation is associative,
- There is an identity element, i.e., an element e of the group so that for any other element a of the group we have ea = ae = a, and
- for every element a of the group there is an element a', called the inverse of a, so that aa' = a'a = e.
If the group operation is commutative, the group is called Abelian. If the condition that every element have an inverse is dropped, the set is called a semigroup. A semigroup with an identity element is called a monoid. A set with a binary operation which is not associative is called a groupoid. See also: field, module, ring.
groupoid| n. |algebr|none|none| See group.
harmonic series| n. |calculu|serie|none| The infinite series whose terms are the reciprocals of the natural numbers:

This series diverges, i.e., the sum does not exist. See the article for details.
Hausdorff space| n. |topolog|none|none| A topological space is Hausdorff is every pair of distinct points have disjoint neighborhoods. Two disjoint compact sets in a Hausdorff space have disjoint neighborhoods. A compact subset of a Hausdorff space is closed.
Heine-Borel property| n. |topolog|none|none| Every closed and bounded subset of the real numbers is compact.
Hempels Ravens Paradox| n. |foundtns|paradox_raven|none| A paradox of induction described by the philosopher C.G. Hempel. See the article for a complete exposition.
hexagon| n. |geometr|none|none| A regular polygon having six equal sides and six equal angles. Hexagons can be used to tile the plane, and do so more efficiently than any other polygon. See: tesselation.
Hilbert's Problems| n. |none|hilbert_prob|none| 23 problems posed by Hilbert to the community of mathematicians at the Paris conference of 1900. See the article for details.
homeomorphic| adj. |topolog|none|none| Two sets are homeomorpic if there exists a homeomorphism between them.
homeomorphism| n. |topolog|none|none| A homeomorphism is an injective (one-to-one), continuous transformation of one topological space onto another whose inverse is also continuous.
hyperbola| n. |geometr|conics|none| The locus of points in the plane, the difference of whose distances from two fixed points, called the foci, remains constant.

Like the ellipse and parabola, the hyperbola is a conic section. See the article for a full exposition.
hyperset| n. |foundtns|none|none| A set which is not well-founded, i.e., which involves self-membership or, equivalently, an infinite descending membership chain. Example: the Quine atom x = {x}.
i| n. |none|none|none| See imaginary number.
icosahedron| n. [pl. icosahedrons, icosahedra]|geometr|none|none| A regular solid having 20 similar triangular faces. See Platonic solid.
imaginary number| n. |none|none|none| By definition, the square root of 1, i.e., i 2 = 1. See complex number.
indeterminate form| n. |calculu|limits|none| A limit of an expression is said to be indeterminate, or in indeterminate form, if when evaluated directly it resolves to one of the forms

Such limits may often be evaluated by manipulating them algebraically before applying the limit, or, in the case of the first two indeterminate forms shown, by applying LHospitals Rule.
inf| n. |analysi|none|none| Abbreviation of infimum.
inferential statistics| n. |statisti|none|none| Those statistical methods that are used to make inferences about a population from a sample chosen to represent that population. Cf. descriptive statistics.
infimum| n. |analysi|none|none| The infimum of any subset of a linear order (linearly ordered set) is the greatest lower bound of the subset. In particular, the infimum of any set of numbers is the largest number in the set which is less than or equal to every other number in the set. In a complete linear order the infimum of any bounded set always exists. Compare: supremum, least upper bound axiom.
infinity| n. |none|none|infinity| Infinity is a concept understood in different ways depending upon the context in which the word is used. In particular, infinity is not a number in the ordinary sense. The so-called extended real numbers include either a positive or a negative infinity (but not both). When this is done, the algebraic forms "infinity plus negative infinity", "infinity times zero", and "infinity divided by infinity" are undefined. Infinite ordinals may be countable or uncountable. Whether actually infinite totalities may be admitted, used, or analyzed remains a contentious issue in the philosophy of mathematics. See the minitext for a thorough treatment.
injective| adj. |analysi|none|none| A function is injective, also called one-to-one, if to each element of the range at most one element of the domain is mapped by the function. Compare: surjective, bijective.
integer| n. |none|none|numbers| An element of the set Z consisting of the natural numbers, zero, and the additive inverses (negatives) of the natural numbers. I.e., Z = { ... -3, -2, -1, 0, 1, 2, 3, ... }. The notation Z is from the German word zahlen, which means to count.
integral| n. |calculu|none|none| (1) An antiderivative of a function. E.g., if f(x) is a real valued-function, an antiderivative F(x) of f(x) has the property that the derivative of F with respect to x is f. (2) (definite integral, Riemann integral) The definite integral of a real-valued function f(x) from x = a to x = b is the limit of the Riemann sum

assuming this limit exists, where ci is in the i th subinterval of the partition of (a, b), and where a is the lower limit, and b is the upper limit, of the integral.

See: Riemann sum, Lebesgue integral.
integral test| n. |calculu|serie|none| A test for the convergence of a series. See the article for a complete description.
integration formulas| n. |calculu|int_form|none| See the article for a complete list of common integration formulas. See: integral.
interior| n. |topolog|none|none| The interior of a subset E of a topological space is the largest open set contained in E. It may also be expressed as the intersection of E with the closure of its complement. If E is open, then it is equal to its interior. If E contains no open sets we say that it has empty interior, and this equivalent to saying that E is nowhere dense.
intersection| n. |none|none|none| The intersection of two sets A and B is the set of those elements common to both A and B. The intersection of two or more sets is sometimes called the meet of the sets. Compare: union.
interval| n. |calculu|none|none| The set of all real numbers lying between two given real numbers a and b. If both a and b are included in the set it is called a closed interval. If neither a nor b is included it is called an open interval. If only one of a or b is included the interval is called half-open. Intervals may be denoted using either interval notation or set notation, as follows:
inverse| n. |foundtns|none|none| Given a conditional, i.e., a statement of the form if A then B, or A implies B, its inverse is not A implies not B. A conditional neither implies nor is implied by its inverse. However, the converse of a conditional and its inverse are logically equivalent, since they are contrapositives of each other.
irrational number| n. |none|none|numbers| A real number which is not a rational number, i.e., which cannot be expressed as a ratio of integers. Examples: pi (the ratio of the circumference of a circle to its diameter) and the square root of two (ratio of the length of the diagonal of a square to the length of one side) (
). The irrational numbers are uncountably infinite.
Jordan Decomposition Theorem| n. |analysi|none|none| If m is a signed measure, there exist unique positive measures m+ and m such that m = m+ m, with m+ and m mutually singular. This is called the Jordan decomposition of m, and the measures m+ and m are called the positive and negative variations of m. The total variation of m is defined to be the sum of the positive and negative variations of m.
Kepler, Johannes|(1571 1630)|biograph|none|none| |
| Johannes Kepler |
German astronomer and mathematician who discovered that planetary motion is elliptical. Early in his life, Kepler set about to prove that the universe obeyed Platonistic mathematical relationships; that for instance the planetary orbits were circular and at distances from the sun proportional to the Platonic solids. However, when his friend the astronomer Tycho Brahe died he bequeathed to Kepler his immense collection of astronomical observations. After decades of studying these observations, Kepler realized that his earlier surmises about planetary motion were naive, and he formulated his three laws of planetary motion. (See Keplers Laws.) He did not have a unifying theory for these laws, however; this had to wait another generation, until Newton formulated his laws of gravity and motion.
Keplers Laws|n.|calculu|kepler|none|The laws of planetary motion discovered by Johannes Kepler. See the article for an exposition. See also: Kepler, Johannes.
Konigsberg Bridge Problem| n. |none|none|none| A seminal problem in graph theory, solved by Leonhard Euler: In the Prussian town of Königsberg there were seven bridges over the River Pregel, as shown in the figure. The Königsberg Bridge Problem was the question of whether these seven bridges could be traversed exactly once, starting at any point in the town and returning to the same point.

Euler showed that this was impossible, because such a circuit, called an Eulerian circuit, is possible if and only if each vertex (pink nodes in the figure) has even degree, i.e., if each is connected to the others by an even number of paths.
LHospitals Rule| n. |calculu|none|none| If a limit is in one of the indeterminate forms infinity over infinity or zero over zero, then we have

That is, the limit is the same after taking the derivatives of both the numerator and denominator. LHospitals Rule may be applied as many times as needed. Students often misapply the Rule by using it when the limit is not in one of the above indeterminate forms. This often results in an incorrect evaluation of the limit.
Latin| n. |none|latin|none| Many Latin terms and phrases are used in mathematical writing. See the article for a full exposition.
laws of exponents| n. |none|none|none| The following rules govern the behavior of exponents:

Additionally, x0 = 1 for all x except 0, and 00 = 0. See also: rational exponent.
laws of logarithms| n. |none|none|none| The following rules governing the behavior of logarithms are easily derived, and very useful in calculations:- log A + log B = log (A×B)
- log A log B = log (A/B)
- log Ap = p × log A
Students often confuse these rules, so it is worth memorizing them as the sum of the logs is the log of the product and not the product of the logs, etc.
least upper bound| n. |none|none|none| An upper bound which is less than or equal to every other upper bound.
least upper bound axiom| n. |analysi|none|none| A set of real numbers which has an upper bound has a least upper bound. This is sometimes taken as an axiom for the real numbers, but is otherwise proved. See also: supremum.
Lebesgue measure| n. |analysi|none|none| The unique measure m on the real line generated by the outer measure whose value on intervals is the length of the intervals is called Lebesgue measure.
Leibniz, Gottfried Wilhelm| (1646 1716) |biograph|none|none| |
| Leibnitz |
German mathematician and philosopher, and co-discoverer of calculus (independently of Newton). Leibniz sought to reduce the mechanics of human thought to a logical calculus, and in this respect foreshadowed modern interest in artificial intelligence and cognitive science. He also described the binary number system and laid the foundation of dynamics. Leibnizs philosophy was characterized by the assertion that all true propositions are analytic, but that some propositions (which seem synthetic to us) could only be known to be analytic by God.
limit| n. |calculu|limits|none| The concept of a limit is central to our modern understanding of the differential and integral calculus. Naively, an expression involving a variable limits to some value L if it becomes arbitrarily close to L for appropriate choices of the variable. See the article for a full exposition.
limit comparison test| n. |calculu|serie|none| A test for the convergence of a series. See the article for a complete description.
linear function| n. |calculu|none|none| A polynomial function of degree one. The graph is a straight line. There are three special forms of the linear equation:

In the first form, called the slope-interecept form, m is the slope of the line and b is the y-intercept. In the second form, called the point-slope form, m is the slope of the line and (x 0, y 0) is any point on the line. In the third form a is the x-intercept and b is the y-intercept.
linear space| n. |analysi|none|none| See vector space.
locally compact| adj. |topolog|none|none| A topological space is locally compact if every point of the space has a neighborhood whose closure is compact.
locally integrable| adj. |analysi|none|none| A measurable function on a finite dimensional real space with range in the complex numbers is said to be locally integrable if for all compact sets K we have:

The space of all such functions is denoted L1LOC. See: Lebesgue integral.
locus| n. |geometr|none|none| A set of points satisfying a (geometric) condition. E.g., a parabola is the locus of points equidistant from a given point and a given line.
log| n. |none|none|none| See logarithm.
logarithm| n. |none|none|none| A logarithm is an expression of the form log bA, where b is called the base of the logarithm and A is called the argument, and it evaluates as the exponent to which the base must be raised to return the argument. Logarithms may be viewed as an alternative form of exponential notation, since we have log bA = x if and only if bx = A. A common logarithm is a logarith with base 10, and a natural logarithm (usually written ln) is a logarithm with base e. See laws of logarithms, Euler number.
logic| n. |foundtns|none|none| In the broadest sense, the term logic refers to the reasoning processes or forms of argument people use to reach valid conclusions from one or more premises (assumptions). More specifically, any particular logic is a system of inference, by which one reasons from premises to conclusions, or by which one validates one's conclusions. An incorrect inference, i.e., one which violates the rules of logic, is called a fallacy, and conclusions reached by means of a fallacy are called invalid. (By contrast, when the premises of an argument are false but the argument is formally valid, then the conclusion is called unsound.)
Ordinary logic falls into two broad types; deductive and inductive. Reasoning from general premises to a specific conclusion is deductive. For example, knowing that heavy clouds and a brisk breeze often signal an oncoming storm, one could conclude deductively that it might rain this afternoon. Reasoning from specific premises to a general conclusion, on the other hand, is inductive. For example, observing that every raven one sees is black, one might conclude inductively that all ravens are black. Deductive conclusions are necessarily true if the premises are true and the logic used formally valid (free of fallacy). Inductive conclusions are never certain, but are only more or less reliable. In mathematics only deductive reasoning is used (but see the mathematical induction entry).
Mathematicians use symbolic logic, that is, logic that can be reduced to a purely syntactical system which disregards the semantic content of any of the symbols in use. The two primary forms of symbolic logic are the propositional calculus and the predicate calculus. The latter augments the former with existential and universal quantifiers (permitting sentences that begin with there exists ___ such that and for all ___). When quantification is permitted only over elements of the universe of discourse, the logic is called first-order. When quantification over classes of objects and/or over predicates is permitted, it is called second-order logic. See also: axiom, fuzzy logic, equational logic, syllogism, Hempels Ravens Paradox.
lower bound| n. |analysi|none|none| A lower bound of an ordered set is an element which is less than or equal to every element in the set. Compare: greatest lower bound.
l.u.b| n. |none|none|none| Abbreviation for least upper bound.
measure| n. |analysi|none|none| Given a set X and a s-algebra of sets M defined on X, a measure on X is a positive real-valued function m whose domain is M, and which satisfies: - the measure of the empty set is zero.
- (Countable additivity) For any countable, disjoint sequence of sets in the domain of m, the measure of the union of the sequence is equal to the sum of the measures of the sets in the sequence.
If the measure of every set in M is finite, then m is called a finite measure. If X can be expressed as a union of sets in M all of whose measures are finite, then m is called a s-finite measure. If for every set E in the domain of m whose measure is infinite there is a subset F of E which has finite measure, then m is called a semi-finite measure. If for any set E in M which has zero measure all the subsets of E are also in M (and therefore have zero measure), then m is called a complete measure. See also: measure space, signed measure, outer measure, Lebesgue measure, Borel measure.
measurable function| n. |analysi|none|none| Given measure spaces (X, M, m) and (Y, N, n), a function f from X to Y is said to be measurable if the inverse image of every measurable set in Y is measurable in X.
measurable space| n. |analysi|none|none| A set X together with a s-algebra of sets M defined on it is called a measurable space, usually denoted (X, M). The elements of M are called measurable sets. See also: measure.
measure space| n. |analysi|none|none| A set X together with a s-algebra of sets M defined on it and a measure m defined on M is called a measure space, usually denoted by (X, M, m).
metric| n. |analysi|none|none| Given a set X, a metric on X is a function d with domain X and range in R* (the set of non-negative real numbers) satisfying, for all a, b, and c in X: (1) d(a,b) = 0 if and only if a = b; (2) d(a,b) = d(b,a); and (3) d(a,b) + d(b,c) >= d(a,c) (where >= means greater than or equal to). See also: metric space.
metric space| n. |analysi|none|none| A set with a metric defined on its elements.
mode| n. |statisti|none|none| The value occuring most often in a frequency distribution.
module| n. |algebr|none|none| A generalization of the notion of vector space. Specifically, if M is an Abelian group under addition, and R is a ring such that rm is in M whenever m is an element of M and r is an element of R, then M is called a left R-module (a right R-module is defined analogously), provided- r(m + n) = rm + rn,
- (r + s)m = rm + sm, and
- r(sm) = (rs)m
for all r, s in R and m, n in M. A module is cyclic if there is a generating element m of M such that every element of M is of the form rm for some r in R. A module is finitely generated if there are elements m1, m2, ..., mk in M such that every element of M is of the form r1m1 + r2m2 + ... + rkmk for some r1, r2, ..., rk in R.
monoid| n. |algebr|none|none| See group.
mutually singular| adj. |analysi|none|none| Given a measurable space (X, M), two signed measures m and n on X are called mutually singular, denoted by

if there exist sets E and F in M such that their union is X, their intersection is empty, and m(E) = 0 and n(F) = 0.
nth-term test| n. |calculu|serie|none| A test for the divergence of a series. See the article for a complete description.
natural base| n. |none|none|none| See Euler number.
natural logarithm| n. |none|none|none| A logarithm with base e, the Euler number. Written ln rather than log to distinguish it from logarithms using other bases.
natural number| n. |foundtns|none|numbers| An element of the set N = {1, 2, 3, ...} consisting of all the counting numbers. When the number 0 is included, this set is sometimes called the whole numbers. In set theory, the natural numbers (incuding 0) are identified with the set w of finite ordinals. The natural numbers are a well-founded linear order with no largest member, and are countably infinite.
negative set| n. |analysi|none|none| Given a signed measure m on a measure space X, a measurable set A in X is called a negative set if the measure of all measurable subsets of A is less than or equal to zero. See also: positive set, null set.
neighborhood| n. |topolog|none|none| A neighborhood of a point x of a topological space is an open set of the space containing x. In a metric space, a d-neighborhood of x is the collection of all points of the space whose distance from x is less than d.
nonagon| n. |geometr|none|none| A regular polygon having nine equal sides and nine equal angles.
non-denumerable| adj. |foundtns|none|infinity| See uncountably infinite.
norm| n. |analysi|none|none| (Analysis) A non-negative real-valued function ll ll defined on a vector space, satisfying- llxll = llxll,
- llcxll = lcl × llxll for all scalars c, and
- llx + yll <= llxll + llyll (triangle inequality)
(Statistics) Another term for the mode of a distribution.
normal| n. |none|none|none| A line intersecting a curve or surface perpendicular to the tangent or tangent plane at the point of intersection. The normal to a surface expressed as a function of severable variables x i is given by the gradient.
normalized bounded variation| n. |analysi|none|none| See: bounded variation.
normed space| n. |analysi|none|none| A vector space with a norm defined on it.
nowhere dense| adj. |topolog|none|none| Given a space X and a subset A of X, we say that A is nowhere dense if every open set of X contains an open subset that is disjoint from A. This is equivalent to saying that the complement of A is dense, or that A has empty interior.
null set| n. |analysi|none|none| A set of measure zero, i.e., given a measure m on a measure space X, a measurable set A in X is called a null set if its measure is zero. See also: positive set, negative set, almost everywhere.
number | n.|foundtns|none|numbers| There is no precise mathematical definition of the word number. There are however precise definitions of the terms natural number, rational number, real number, complex number, and other less common kinds of number. When a mathematician speaks about numbers she usually has one of these cases in mind and she should, at the outset, make it clear to which type of number she is referring. The intuitive concept of number, which is shared to some degree by all humans, is a matter for philosophical rather than strictly mathematical inquiry, and it may be noted that there has historically been strong opposition to the introduction of new generalizations of established concepts of number.
numeral| n.|none|none|none| Graphical symbol representing a number.
octahedron| n. [pl. octahedrons, octahedra]|geometr|none|none| A regular solid having eight similar triangular faces. See platonic solid.
odd function| n. |calculu|none|none| A real-valued function y = f(x) is odd if f(x) = f(x) for all x in the domain of f. The graphs of odd functions in the Cartesian plane are symmetric with respect to the origin. Cf. even function.
open| n. |topolog|none|none| See: open function, open set.
open covering| n. |topolog|none|none| In a topological space, an open covering of a set E is a collection {Ui} of open sets such that E is contained in the union of the Ui.
open function| n. |topolog|none|none| A function (mapping, transformation) from one topological space into another is called open if the image of every open set of the domain is an open set in the range.
open interval| n. |calculu|none|none| An interval of the real number line which does not include its endpoints. An interval containing only one of its endpoints is called half-open. Compare: closed interval.
open set| n. |topolog|none|none| A subset U of a topological space X is open if every element x of U is contained in an open set of X that is also contained in U. In a metric space, U is open if for every x in U we may find a d greater than zero such that the d neighborhood of x is also contained in U.
order of operations| n. |none|none|none| As a matter of convention, in any given expression involving arithmetic and/or algebraic operations, operations within parentheses (or other grouping symbols) are evaluated first. Within this constraint, exponentiation precedes multiplication and division, and the latter precede addition and subtraction. Within these constraints, operations are evaluated from left to right.
ordered pair| n. |none|none|none| An ordered tuple (a,b), the first element of which is called the abscissa, and the second element the ordinate, and for which (a,b) = (b,a) if and only if a = b. Functions, graphs of functions, and binary relations are represented as sets of ordered pairs. In standard set theory, the ordered pair (a,b) is defined to be the set { {a}, {a,b} }. Compare: unordered pair.
ordinal| n. |foundtns|none|none| The class of ordinals is defined by: 1) 0 is an ordinal; 2) if a is an ordinal, then a + 1 = a union {a} is an ordinal; 3) if A is a collection of ordinals, then union(A) is an ordinal; 4) nothing else is an ordinal. The class of ordinals is transitive, and is a well-founded, linear ordering. See also: Von Neumann Heirarchy.
ordinate| n. |calculu|none|none| The second element of an ordered pair. Compare: abscissa.
outer measure| n. |analysi|none|none| A non-negative extended real-valued set function defined on all subsets of a space X which is zero on the empty set, monotone, and countably subadditive (see below) is called an outer measure. An outer measure is often used together with Carathéodory's Theorem (see below) to obtain a measure. Given a set X and a collection A of subsets of X which includes the empty set and X itself, and a positive real-valued function r whose domain is A and whose value on the empty set is zero, then for any F in X define m* by

Then m* is an outer measure. A set B in X is then called m*-measurable if

for all subsets C of X. (Cc denotes the complement of C in X.) Carathéodory's Theorem states that if m* is an outer measure on X, then the collection M of m*-measurable sets is a s-algebra of sets, and the restriction of m* to M is a complete measure.
p-series| n. |calculu|serie|none| An infinite series of the form

with p a positive real number. See the article for details.
parabola| n. |geometr|conics|none| The locus of points in the plane whose distances from a fixed point, called the focus, and a fixed line, called the directrix, are equal.

Like the ellipse and hyperbola, the parabola is a conic section. See the article for a full exposition.
paradox| n. |foundtns|none|none| A seemingly necessary contradiction or absurdity. A paradox arising logically out of formal axioms is called an antinomy. True paradoxes may be broadly classified as paradoxes of logic, paradoxes of infinity, paradoxes of knowledge, paradoxes of language, and paradoxes of self-reference. See:Antistrephon Paradox
Banach-Tarski Paradox
Berry Paradox
Boundary Paradox
Finitude Paradox
First Boring Number Paradox
Grellings Paradox
Grue-Bleen Paradox
Liar Paradox
Quines Paradox
Prisoners Dilemma
Russell Paradox
Santa Sentence Paradox
Sids Paradox
Sorites Paradox
Unexpected Hanging Paradox
Zenos Paradox of the Arrow
Zenos Paradox of the Moving Rows
Zenos Paradox of the Tortoise and Achilles
Paradox of the Heap| n. |foundtns|none|none| See Sorites Paradox.
parallel postulate| n. |geometr|none|none| The 5th postulate of Euclid. See Euclidean geometry.
parallelogram| n. |geometr|none|none| A quadrilateral (four-sided figure) with opposite sides (and opposite angles) equal.

perfect number| n. |numthry|none|none| A natural number n whose distinct divisors, including 1 but not including n itself, sum to n. Example: 6 is perfect since its divisors are 1, 2, and 3, and 1 + 2 + 3 = 6. The first three perfect numbers are 6, 28, and 496. Any number of the form 2n 1(2n 1) is perfect provided that 2n 1 is a Mersenne prime. Such numbers are called Euclid numbers. Euler proved that all even perfect numbers are Euclid numbers. It is not known whether there are infinitely many perfect numbers, or if there are any odd perfect numbers.
perfect set| n. |topolog|none|none| A closed set X is called perfect if every point of X is an accumulation point of X. The following are equivalent characterizations:- X is closed and containes no isolated points.
- X is closed and dense in itself.
- X is equal to its derived set.
permutation| n. |algebr|none|none| A permutation on a set of n elements is a reordering of those elements. There are n! such permutations, and together they form a group, the symmetric group on n elements. Compare: combination. See also: factorial.
perpendicular| adj. |geometr|none|none| Two curves are perpendicular if they intersect in a right angle. In particular, two lines in the Cartesian plane are perpendicular if their respective slopes satisfy m 1 = 1/m 2. Cf. normal.
Platonic solid| n.|geometr|platsol|none| A solid having similar, regular polygonal faces. There are five Platonic solids: the icosahedron, tetrahedron, octahedron, dodecahedron, and cube.
pointwise bounded| n. |topolog|none|none| See: bounded.
polygon| n. |geometr|none|none| A closed plane figure having straight sides. A regular polygon has equal sides and equal angles. Examples: square, hexagon, nonagon, etc.
polynomial| n. |none|none|none| A function of the form
p(x) = a0 + a1x + a2x2 + ... + anxn
where the ai (called coefficients) are real numbers or complex numbers, and the exponents are all natural numbers. The highest exponent is called the degree of the polynomial, and the coefficient an on the highest degree term is called the leading coefficient. Polynomials of degree two are called quadratic polynomials, of degree 3 cubic, of degree 4 quartic, and those of degree 5 are called quintic.
More generally, a polynomial may be in several variables x1, ... ,xk, and may be thought of as a sum of the form

where all but finitely many of the ai are 0. In this case, the degree of the polynomial is the highest exponent appearing in any term. See: Diophantine equation, quadratic formula.
positive set| n. |analysi|none|none| Given a signed measure m on a measure space X, a measurable set A in X is called a positive set if the measure of all measurable subsets of A is greater than or equal to zero. See also: negative set, null set.
potential infinite| n.|foundtns|none|infinity| A distinction made by Aristotle: a set is potentially infinite if it cannot be finitely completed, e.g., our naive or given conception of the natural numbers. Aristotle admitted potentially infinite sets, but denied the logical possiblity of the actual infinite, that is, infinite totalities considered as completed entities.
power series| n. |calculu|serie|none| An infinite series of the form

See the article for a complete description.
power set| n. |foundtns|none|none| Given a set X, the power set of X, denoted P(X), is the collection of all subsets of X. If X is a finite set with n elements, then P(X) is a finite set with 2n elements. See also: power set axiom.
power set axiom| n. |foundtns|none|none| An axiom of set theory which states that, for any given set X, the power set, i.e., the set of all subsets of X, exists.
precompact| adj. |analysi|none|none| Given a topological space X, a subset E of X is called precompact if its closure is compact.
predicate calculus| n. |foundtns|none|none| A system of symbolic logic which augments the propositional calculus with quantification over variables. The two forms of quantification are existential and universal, and are denoted by

respectively. This permits the construction of sentences such as

which could be read, There exists an x such that for all y, x times y is equal to y. (Such a sentence would be true in arithmetic, for instance.) When quantification is permitted only over variables, the logic is first-order. If quantification is permitted over classes of variables or over predicates, the logic is second-order.
propositional calculus| n. |foundtns|none|none| The formal system of symbolic logic in which sentences are treated as objects related by the logical connectives:

The symbols for the conditional (if-then) and the biconditional (if and only if) are not essential; indeed all the connectives are fully expressible by the use of the two connectives for or and not. For example, p implies q may be equivalently expressed as not p or q. In the notation of propositional calculus, this equivalence may be written,

Compare: predicate calculus.
Pythagoras| (c. 500 550 b.c.) |biograph|none|none|  |
| Pythagoras |
What we know of this ancient Greek mystic is mostly legend, for of the true facts of his life almost nothing is known. However, it is believed that he started a religious cult, the Pythagoreans, among whose beliefs was that number was the highest reality, and that all other aspects of reality could be understood in terms of integers and ratios of integers. See Pythagorean theorem.
Pythagorean theorem| n. |geometr|none|none| In Euclidean geometry, the sum of the areas of the squares on the legs of any right triangle is equal to the area of the square on the hypotenuse. This is arguably the most important theorem of classical mathematics, and perhaps of all time.
Pythagorean triple| n. |numthry|none|none| An ordered triple (a,b,c) of natural numbers satisfying a2 + b2 = c2. The triples (3,4,5) and (5,12,13) are the first of infinitely many examples.
quadratic formula| n. |calculu|none|none| Given a quadratic function, i.e., a polynomial function of second degree y = ax 2 + bx + c, the zeros of the function are given by

The expression under the radical is called the determinant. If the determinant is positive, both solutions are real; if negative, both solutions are complex; and if zero, there is a single solution of multiplicity two.
quadrilateral| n. |geometr|none|none| A closed planar figure with four straight sides. Cf. polygon.
Quine atom| n. |foundtns|none|none| In set theory, a set whose only member is itself, i.e., x = { x }. More generally, some phrases may be Quined to form meaningful sentences, e.g., is a five-word phrase is a five-word phrase.
quotation|none|none|none|none|See Platonic Realms Quotes Collection.
quotes|none|none|none|none|See Platonic Realms Quotes Collection.
radian| n. |trigonom|trig_ident|none| A dimensionless unit of measure of angles. An angle of one radian is given by the central angle of a circle subtending an arc of length equal to the radius of the circle. Consequently, 360 degrees is the same as 2p radians. See the article for a more extensive exposition.
range| n. |calculu|none|none| The set of elements to which a function maps the elements of its domain set.
ratio test| n. |calculu|serie|none| A test for the convergence of a series. See the article for a complete description.
rational exponent| n. |none|none|none| An exponent of the form p/q, with p and q integers and q not zero. Evaluated as the qth root of the base, raised to the pth power, or equivalently, as the qth root of the pth power of the base. For a negative base, this operation is not defined except when q is odd. Irrational roots may be considered as limits of sequences of rational roots. See laws of exponents.
rational number| n. |none|none|numbers| An element of the set Q consisting of ordered pairs (p, q) of integers, with q not 0, and with the order relation (p, q) < (r, s) if and only if ps < rq as integers. (The ordered pairs are usually written p/q, i.e., as a fraction (ratio) with integer numerator and denominator.) The rational numbers are countably infinite.
real number| n. |none|none|numbers| An element of the set R consisting of all of the rational numbers together with all of the irrational numbers. Sometimes called the continuum. Usually defined formally by a Dedekind cut of rational numbers. The real numbers form (uniquely) a complete ordered field, but are not algebraically complete. It is a famous theorem of Georg Cantor that the real numbers are not countable.
regular measure| n. |analysi|none|none| A Borel measure m on a finite-dimensional real space is called regular if for all compact measurable sets K and Borel sets E we have:

regular solid| n. |geometr|none|none| A solid having similar faces, which are themselves regular polygons. Also called Platonic solids. Compare semi-regular polyhedron.
relation| n. |foundtns|none|none| An n-place relation is defined on a Cartesian product of n sets, and is represented by a set of ordered n-tuples. For example, the less-than (<) relation is a binary relation on numbers, and the membership relation (e) is a binary relation on sets. The property of forming a Pythagorean triple is a ternary relation on natural numbers, of which for example (3,4,5) is a member since 32 + 42 = 52. Compare: function.
relatively prime| adj. |numthry|none|none| Two natural numbers a and b are relatively prime if their greatest common divisor is 1.
Riemann Hypothesis| n. |numthry|none|none| The conjecture that the zeta function has no non-trivial zeros off of the line re(z) = 1/2.
Riemann integral| n. |calculu|none|none| See: integral.
Riemann sum| n. |calculu|none|none| Let f be a real-valued function defined on the closed interval [a, b], and let delta be a partition of [a, b], i.e., a = x0 < x1 < ... < xn = b, and where delta(xi) is the width of the i th subinterval. If c i is any point in the i th subinterval, then the sum

is called the Riemann sum of f for the partition delta.
ring| n. |algebr|none|none| A set together with two binary operations (called addition and multiplication) defined on its elements, and satisfying - the set is an Abelian group under the addition operation, and
- multiplication is distributive with respect to addition, i.e., for all elements a, b, and c in the ring, we have a(b + c) = ab + ac and (b + c)a = ba + ca.
If in addition multiplication is commutative, the ring is called a commutative ring. If there is a multiplicative identity element, i.e., an element 1 such that for every element a in the ring we have 1a = a1 = a, then it is called a ring with unity. A commutative ring with unity is called an integral domain if no product of nonzero elements is zero. If everly element of the ring except the additive identity has a multiplicative inverse, it is called a division ring (equivalently, if the nonzero elements form a group under multiplication). A commutative division ring is called a field. See also: ideal.
ring of sets| n. |analysi|none|none| Given a set X, a ring on X is a collection of subsets of X which is closed under finite unions and set differences. If the ring includes X itself then it is an algebra of sets. If the ring is closed under countable unions, then it is called a s-ring.
root test| n. |calculu|serie|none| A test for the convergence of a series. See the article for a complete description.
Roth's Theorem| n. |numthry|none|none| (Klaus Friedrich Roth, 1955) Given a real algebraic number a, consider the least upper bound m(a) of all numbers m for which there are infinitely many rational numbers p/q such that

Then for all a, m(a) = 2. This result improves on earlier theorems of Joseph Liouville, Axel Thue, and Carl Ludwig Siegel regarding the approximation of irrational numbers by rational numbers.
Russell, Bertrand| (1872 1970) |biograph|none|none|  |
Bertrand Russell |
English philosopher and logician. Wrote Principia Mathematica (1913) with Alfred North Whitehead, an attempt to reduce all of mathematics to symbolic logic. This was perhaps the most important effort in the logicist program. Russell introduced type theory into the theory of sets and classes in an effort to avoid the kind of antinomy in the foundations of mathematics as was exemplified in the so-called Russell paradox. The goal of Russell's system was to show that any true mathematical proposition can be established by logic alone, a goal which was severely compromised by Kurt Gödel's proof of the Gödel Incompleteness Theorem in 1931.
Russell Paradox| n. |foundtns|none|none| A paradox of set theory which necessitated a more careful axiomatization of set theory in the 1920s and 1930s: Naively, some sets are members of themselves and some are not. For instance, the set of all apples is not itself an apple, but the set of all sets is itself a set. So consider the set X of all sets that are not members of themselves. We may ask, is X a member of itself? If it is then it cannot be, because of the way in which X itself was defined, but if it isnt then it must be, by the same reasoning. Contradiction. The Russell paradox is resolved in modern set theory by a foundation axiom or axiom of regularity, and by limiting the size of objects we call sets. For example, the set of all sets is considered not to be a set but a proper class.
scalar| n. |analysi|none|none| A quantity having only magnitude, not direction (typically an element of a field, such as the real numbers or complex numbers). Compare: vector.
scalar product| n. |analysi|none|none| The scalar product, also called dot product, of two vectors is the sum of the products of the corresponding components of the two vectors. I.e., given two vectors x = (x1, x2, ..., xn) and y = (y1, y2, ..., yn), their scalar product is the scalar x1y1 + x2y2 + ... + xkyk. Compare: vector product.
Schroeder-Bernstein Theorem| n. |foundtns|none|none| If there exists an injection from a set X into a set Y, and also an injection from Y into X, then there exists a bijection from X to Y, and hence X and Y have the same cardinality.
scientific notation| n. |none|none|none| A number is written in scientific notation when it is written as the product of a real number between 1 and 10 and a power of 10. E.g., 320 is written in scientific notation as 3.2 × 102. Scientific notation is a convenient way to represent very large and very small numbers.
semi-finite measure| n. |analysi|none|none| See measure.
semigroup| n. |algebr|none|none| See group.
sentential calculus| n. |foundtns|none|none| See: propositional calculus.
separable| adj. |topolog|none|none| A topological space is separable if it has a countable base.
sequence| n. |analysi|none|none| A sequence is a list of values ordered by the natural numbers. Sequences may be infinite, and may be regarded as a function with domain the set of natural numbers.
An infinite sequence of numbers is said to converge to a number L provided that, given any positive e, we may find a natural number N such that for all terms of the sequence after the N th one, their difference from L is less than e. Naively, the terms of the sequence eventually become arbitrarily close to L. Such a sequence is called convergent, and the number L is called the limit of the sequence, or the limit point, or sometimes the accumulation point of the sequence.
Alternatively, a cluster point or accumulation point P of a sequence may be defined as a point with the property that infinitely many terms of the sequence lie in any neighborhood of P. A sequence may have more than one such cluster point (even infinitely many).
A sequence is called Cauchy if, for every e greater than zero, we may find a natural number N so that the difference between any two terms following the N th term is smaller than e. Every convergent sequence is Cauchy; the converse is true in complete spaces. Compare: series.
series| n. |calculu|serie|none| A series is an infinite sum, where the n th summand is the n th term of a sequence. A series is usually denoted using sigma notation, i.e.,

The index n may begin with 0, 1, or k for any natural number k, as a matter of convenience. The n th partial sum Sn of a series is the (finite) sum of the first n terms of the series. A series is said to converge if and only if its sequence of partial sums {S 1, S 2, . . . , Sn, . . . } is a convergent sequence. There are several important types of series and several tests for the convergence of a series. Additionally, most useful functions have Taylor series representations, which makes them very important in the study of differential equations. See the article for a complete description.
set| n.|foundtns|none|numbers| Any well defined collection considered as a single object. See set theory, Zermelo Fraenkel set theory, ZF, ZFC.
set algebra| n. |none|none|none| See: algebra of sets.
set function| n. |analysi|none|none| A function whose domain of definition is a collection of sets.
set ring| n. |none|none|none| See: ring of sets.
set theory| n. |foundtns|none|none| (1) Naive set theory: The study of abstract sets (i.e., well-defined collection of objects) which have a binary extensional relation (set membership) defined on them. (2) Abstract set theory: As naive set theory, but with all sets built using only elements which are themselves sets (beginning with the empty set, which has no members). (3) Formal set theory: Any of several axiomatizations of abstract set theory in the language of first-order logic, such as Zermelo Fraenkel set theory, Godel Bernays set theory, Quines New Foundations, etc.
Sids Paradox| n. |foundtns|sid_para|none| A paradox of knowledge: is the distinction between matters of opinion and matters of fact a matter of opinion or a matter of fact? See the article for discussion.
signed measure| n. |analysi|none|none| Given a set X together with a s-algebra of sets M defined on it, a signed measure on (X, M) is an extended real-valued function m with domain M satisfying: - The signed measure of the empty set is zero.
- The signed measure m assumes at most one of the values +/- infinity.
- (Countable additivity) Given a countable sequence of disjoint sets in M, the signed measure of the union of the sequence is equal to the sum of the signed measures of the sets in the sequence, where this sum converges absolutely if the signed measure of the union is finite.
Technically speaking, every measure is a signed measure; ordinary (i.e., nowhere negative) measures are sometimes called positive measures.
slope| n. |calculu|none|none| A line in the cartesian plane which passes through two points (x 1, y 1) and (x 2, y 2) has a slope m given by

The slope may easily be remembered as rise over run. It is easily seen that the slope of a horizontal line is 0, and the slope of a vertical line is undefined. See: linear function.
space| n. |none|none|none| Any abstract set with a structure defined on it, such as an order relation, metric, etc. See for example: Euclidean space, Hilbert space, metric space, topological space.
square| n. |geometr|none|none| A regular polygon having four equal sides and four right angles. See: polygon.
Stone-Weierstrass Theorem| n. |analysi|none|none| If X is a compact space and C(X) denotes the space of all continuous functions on X, and A is an algebra of functions in C(X) which separates the points of C(X) and which contains a constant function f not identically zero, then A is dense in C(X).
story problem| n. |none|storprob|none| A mathematical problem presented as a real-world situation. See the article for problem solving techniques.
subbase| n. |topolog|none|none| In a topological space, a subbase is a collection of sets, the collection of all finite intersections of which is a base.
subgroup| n. |algebr|none|none| A subset of a group which is also a group. Every subgroup induces a partition of the original group, and if this partition is itself a group under the inherited group operation, the subgroup is called a normal subgroup.
subset| n. |foundtns|none|none| A set A is a subset of a set B if every element of A is also an element of B. If in addition B is a subset of A, then A = B.
sup| n. |analysi|none|none| Abbreviation of supremum.
supremum| n. |analysi|none|none| The supremum of any subset of a linear order (linearly ordered set) is the least upper bound of the subset. In particular, the supremum of any set of numbers is the smallest number in the set which is greater than or equal to every number in the set. In a complete linear order the supremum of any bounded set always exists (within the set). Compare: infimum, least upper bound axiom.
surd| n. |none|irr2|none| An irrational root of a number, e.g., the square root of two.
surjective| adj. |analysi|none|none| A function f from a set X to a set Y is surjective, also called onto, if to each element y of Y there is an element x of X such that f maps x to y, i.e., f (x)=y. Compare: injective, bijective.
symbolic logic| n. |foundtns|none|none| Logic reduced to syntax, i.e., which works only with uninterpreted symbols. The two principle kinds of symbolic logic are the propositional calculus and the predicate calculus.
Taylor series| n. |calculu|none|none| Given a function having derivatives of all orders, the Taylor series of the function is given by

where f (k)(a) is the k th derivative of f at a. A function is equal to its Taylor series if and only if its error term Rn can be made arbitrarily small, where

It can be shown that

for some c between a and x.
tesselation| n. |geometr|none|escher| A tiling of the plane, i.e. the use of plane figures to completely cover the plane without overlaps or gaps. A regular tesselation uses only a finite number of distinct shapes. Most regular tesselations are periodic, but some are aperiodic. See: polygon, Penrose tiles.
tetrahedron| n. [pl. tetrahedrons, tetrahedra]|geometr|none|none| A regular solid having four triangular faces. See Platonic solid.
tiling| n. |geometr|none|none| See: tesselation.
topological space| n. |topolog|none|none| A set with a topology defined upon it.
topology| n. |topolog|none|none| Generally, topology is the study of those properties of a space which are invariant under continuous deformations, i.e., deformations which do not create "tears" or "holes." More specifically, given a set X, a topology on X is a collection of subsets of X, called the open sets of X, such that the empty set and X itself are included in the collection, and such that the collection is closed under the formation of finite intersections and arbitrary (i.e., not necessarily finite or countable) unions. A set X with a topology defined upon it is called a topological space. See also: homeomorphism.
total variation| n. |analysi|none|none| (For total variation of a signed measure, see the Jordan Decomposition Theorem.) If f is a function on the real numbers with range in the complex numbers, then the function Tf given by:

is called the total variation function of f, where here the supremum is being taken over all finite partitions of the real line up to x. If the limit of this function as x goes to infinity is finite, then f is said to be of bounded variation. The space of all such functions is usually denoted by BV. Functions which are increasing and bounded are in BV, and differentiable functions whose derivative is bounded are in BV.
totally bounded| adj. |analysi|none|none| Given a metric space X, a subset E of X is called totally bounded if for every e greater than zero there is a finite covering of E by open spheres in X whose radius is less than e.
transcendental function| n. |none|none|none| A function which is not an algebraic function, i.e., a function whose action on its argument(s) cannot be represented by the arithmetic and algebraic operations: addition and subtraction, multiplication and division, raising to a power, or extraction of roots. The exponential function, the logarithm function, and the trigonometric functions are all transcendental.
transcendental number| n. |none|none|none| A number which is not an algebraic number, i.e., that is not the root of any polynomial with rational coefficients. It is known that e and pi are transcendental. Since the algebraic numbers are countable and the set of all real numbers is uncountable, this means that the set of transcendental numbers is uncountably large as well.
trigonometric function| n. |trigonom|trig_ident|none| The trig functions are transcendental functions defined on angles. They include the sine, cosine, tangent, secant, cosecant, and cotangent functions. See the article for a complete description.
trigonometric identity| n. |trigonom|trig_ident|none| An established rule for manipulating trigonometric expressions. See the article for a comprehensive listing.
trigonometry| n. |trigonom|none|none| The mathematical subject concerned with trigonometric functions, which are defined on triangles. They include the sine, cosine, tangent, secant, cosecant, and cotangent functions. See also: trigonometric identity.
tuple| n. |none|none|none| An ordered list of elements from a set, usually represented as (a1, a2, a3, ... ,an). (Sometimes angle brackets are used in place of parentheses.) A tuple with only two elements is called an ordered pair, and tuples with 3, 4, and 5 elements are called ordered triples, quadruples, and quintuples, respectively. In general, a tuple with n elements is called an n-tuple. A relation on a set is represented by a set of tuples. Compare: unordered pair.
Turing machine| n. |compsci|none|none| An abstract machine consisting of a collection of ordered quadruples, corresponding to i) the contents of the current memory location; ii) the current state of the machine; iii) the action to be performed (erase or write to the current memory location and move to a new memory location); and iv) the new state of the machine. All modern computers are universal Turing machines.
Tychonoff's Theorem| n. |topolog|none|none| If {Xa}, a in some index set A, is any family of compact topological spaces, then the cartesian product of the Xa, with the product topology, is compact.
ultrafilter| n. |foundtns|none|none| See filter.
uncountable| adj. |foundtns|none|infinity| See uncountably infinite.
uncountably infinite| adj. |foundtns|none|infinity| A set is uncountably infinite if it is infinite but not countable, i.e., no complete one-to-one match-up of the set with the set of natural numbers (finite ordinals) can be performed. Georg Cantor proved that the set of real numbers is uncountably infinite (this is sometimes called the non-denumerability of the continuum).
union| n. |none|none|none| The union of two sets A and B is the set of those elements which are in A or in B or in both. The union of two or more sets is sometimes called the join of the sets. Compare: intersection.
universal Turing machine| n. |compsci|none|none| A Turing machine capable of performing, given the appropriate program, the actions of any other Turing machine.
unordered pair| n. |none|none|none| A pair of elements {a,b} with no particular order defined on the elements. Sometimes also called a flat pair. Compare: ordered pair.
upper bound| n. |analysi|none|none| An upper bound of an ordered set is an element which is greater than or equal to every element in the set. Compare: least upper bound.
vector| n. |analysi|none|none| A quantity having two components; a magnitude component and a direction component. In n-dimensional Euclidean space, a vector is representable by an ordered tuple (a1, a2, a3, ... an) whose elements are called the components of the vector. In this case the magnitude of the vector is given by the square root of the sum of the squares of the components of the vector.
vector product| n. |analysi|none|none| The vector product of two vectors u and v is a vector w whose magnitude (length) is the product of the magnitudes of u and v and the sine of the angle between them, and which points in a direction perpendicular to the plane containing u and v so as to form a right-handed system, as in the figure.

Note that the directedness of the vector product implies that it is not commutative. Also called cross product. Compare: scalar product.
vector space| n. |analysi|none|none| A structure consisting of two kinds of elements called scalars and vectors, with operations of addition and multiplication defined on them, satisfying:

Compare: module.
Von Neumann Heirarchy| n. |foundtns|vnh|none| A construction in set theory giving rise to the class of ordinals. One begins with the empty set, then forms successor sets by unioning the current set with the set containing the current set; at limit stages, take unions.
well-founded| adj. |foundtns|none|none|In set theory, a collection is well-founded if every subcollection has a least member under the membership relation. In ZFC, the Axiom of Foundation asserts this property of all sets. A set which is not well-founded is sometimes called a hyperset.
whole number| n. |none|none|none| An element of the set consisting of the number 0 together with the counting numbers, 1, 2, 3, etc.; i.e., the set N of natural numbers with 0 included.
Zeno of Elea|(c. 470 b.c.)|biograph|none|none| Greek philosopher famous for certain paradoxes, including the paradox of the arrow, the Paradox of the Tortoise and Achilles, the stadium, and the moving rows. These constitute the earliest known arguments from infinity.
Zenos Paradox of the Arrow| n. |foundtns|none|none| One of the famous paradoxes of Zeno of Elea. Consider an arrow in flight. At each moment of time the arrow may be considered to occupy a specific region in space. This poses the following problem: if the arrow is in a particular point of space in any given moment, then how is it moving? And if it is not moving, how does it get from point to point in the passage of time?
Zenos Paradox of the Tortoise and Achilles| n. |foundtns|zeno_tort|none| The most famous of the paradoxes of Zeno of Elea, in which it is shown that in a foot race between the two, provided Achilles gives the Tortoise a small headstart, it is impossible for Achilles to win because he must always be catching up an infinite number of small intermediate distances first. See the article for a full exposition.
Zermelo Fraenkel set theory| n. |foundtns|none|none| See ZF, ZFC.
zeta function| n. |numthry|none|none| The function zeta(s) given by:

This function gives series representations of many significant numbers, e.g., zeta(2) = (pi)2/6, and zeta(4) = (pi)4/90. See: Riemann Hypothesis.
ZF| n. |foundtns|none|none| Zermelo Fraenkel set theory: the standard set theory in which most mathematics is formalized. Its axioms include the pairing axiom, the power set axiom, the axiom of infinity, the axiom of extensionality, the axiom of replacement, the separation axiom, the union axiom, and the axiom of foundation. When the axiom of choice is assumed, this theory is abbreviated ZFC.
ZFC| n. |foundtns|none|none| Zermelo Fraenkel set theory (ZF) with the axiom of choice.