Portal:Mathematics

---

The Mathematics Portal

Euler's Identity

Mathematics is the study of representing and reasoning about abstract objects (such as numbers, points, spaces, sets, structures, and games). Mathematics is used throughout the world as an essential tool in many fields, including natural science, engineering, medicine, and the social sciences. Applied mathematics, the branch of mathematics concerned with application of mathematical knowledge to other fields, inspires and makes use of new mathematical discoveries and sometimes leads to the development of entirely new mathematical disciplines, such as statistics and game theory. Mathematicians also engage in pure mathematics, or mathematics for its own sake, without having any application in mind. There is no clear line separating pure and applied mathematics, and practical applications for what began as pure mathematics are often discovered. (Full article...)

Featured articles –

  Featured articles are displayed here, which represent some of the best content on English Wikipedia.

---

• 

  

  The first 15,000 partial sums of 0 + 1 − 2 + 3 − 4 + ... The graph is situated with positive integers to the right and negative integers to the left.

  
  
  In mathematics, 1 − 2 + 3 − 4 + ··· is an infinite series whose terms are the successive positive integers, given alternating signs. Using sigma summation notation the sum of the first m terms of the series can be expressed as
  $$\sum _{n=1}^{m}n(-1)^{n-1}.$$
  
  The infinite series diverges, meaning that its sequence of partial sums, (1, −1, 2, −2, 3, ...), does not tend towards any finite limit. Nonetheless, in the mid-18th century, Leonhard Euler wrote what he admitted to be a paradoxical equation:
  $$1-2+3-4+\cdots ={\frac {1}{4}}.$$ (Full article...)
• 

  

  The regular triangular tiling of the plane, whose symmetries are described by the affine symmetric group S̃₃

  
  The affine symmetric groups are a family of mathematical structures that describe the symmetries of the number line and the regular triangular tiling of the plane, as well as related higher-dimensional objects. In addition to this geometric description, the affine symmetric groups may be defined in other ways: as collections of permutations (rearrangements) of the integers (..., −2, −1, 0, 1, 2, ...) that are periodic in a certain sense, or in purely algebraic terms as a group with certain generators and relations. They are studied in combinatorics and representation theory.
  
  A finite symmetric group consists of all permutations of a finite set. Each affine symmetric group is an infinite extension of a finite symmetric group. Many important combinatorial properties of the finite symmetric groups can be extended to the corresponding affine symmetric groups. Permutation statistics such as descents and inversions can be defined in the affine case. As in the finite case, the natural combinatorial definitions for these statistics also have a geometric interpretation. (Full article...)
• 
  
  

  

  Noether c. 1900–1910

  
  Amalie Emmy Noether (23 March 1882 – 14 April 1935) was a German mathematician who made many important contributions to abstract algebra. She also proved Noether's first and second theorems, which are fundamental in mathematical physics. Noether was described by Pavel Alexandrov, Albert Einstein, Jean Dieudonné, Hermann Weyl, and Norbert Wiener as the most important woman in the history of mathematics. As one of the leading mathematicians of her time, she developed theories of rings, fields, and algebras. In physics, Noether's theorem explains the connection between symmetry and conservation laws.
  
  Noether was born to a Jewish family in the Franconian town of Erlangen; her father was the mathematician Max Noether. She originally planned to teach French and English after passing the required examinations, but instead studied mathematics at the University of Erlangen–Nuremberg, where her father lectured. After completing her doctorate in 1907 under the supervision of Paul Gordan, she worked at the Mathematical Institute of Erlangen without pay for seven years. At the time, women were largely excluded from academic positions. In 1915, David Hilbert and Felix Klein invited her to join the mathematics department at the University of Göttingen, a world-renowned center of mathematical research. The philosophical faculty objected, and she spent four years lecturing under Hilbert's name. Her habilitation was approved in 1919, allowing her to obtain the rank of Privatdozent. (Full article...)
• 
  In classical mechanics, the Laplace–Runge–Lenz vector (LRL vector) is a vector used chiefly to describe the shape and orientation of the orbit of one astronomical body around another, such as a binary star or a planet revolving around a star. For two bodies interacting by Newtonian gravity, the LRL vector is a constant of motion, meaning that it is the same no matter where it is calculated on the orbit; equivalently, the LRL vector is said to be conserved. More generally, the LRL vector is conserved in all problems in which two bodies interact by a central force that varies as the inverse square of the distance between them; such problems are called Kepler problems.
  
  Thus the hydrogen atom is a Kepler problem, since it comprises two charged particles interacting by Coulomb's law of electrostatics, another inverse-square central force. The LRL vector was essential in the first quantum mechanical derivation of the spectrum of the hydrogen atom, before the development of the Schrödinger equation. However, this approach is rarely used today. (Full article...)
• 
  
  

  

  1753 portrait

  
  Leonhard Euler (/ˈɔɪlər/ OY-lər; 15 April 1707 – 18 September 1783) was a Swiss polymath who was active as a mathematician, physicist, astronomer, logician, geographer, music theorist and engineer. He founded the studies of graph theory and topology and made influential discoveries in many other branches of mathematics, such as analytic number theory, complex analysis, and infinitesimal calculus. He also introduced much of modern mathematical terminology and notation, including the notion of a mathematical function. He is known for his work in mechanics, fluid dynamics, optics, astronomy, and music theory. Euler has been called a "universal genius" who "was fully equipped with almost unlimited powers of imagination, intellectual gifts and extraordinary memory". He spent most of his adult life in Saint Petersburg, Russia, and in Berlin, then the capital of Prussia.
  
  Euler is credited for popularizing the Greek letter $\pi$ (lowercase pi) to denote the ratio of a circle's circumference to its diameter, as well as first using the notation $f(x)$ for the value of a function, the letter $i$ to express the imaginary unit ${\sqrt {-1}}$, the Greek letter $\Sigma$ (capital sigma) to express summations, the Greek letter $\Delta$ (capital delta) for finite differences, and lowercase letters to represent the sides of a triangle while representing the angles as capital letters. He gave the current definition of the constant $e$, the base of the natural logarithm, now known as Euler's number. Euler made contributions to applied mathematics and engineering, such as his study of ships, which helped navigation; his three volumes on optics, which contributed to the design of microscopes and telescopes; and his studies of beam bending and column critical loads. (Full article...)
• 

  

  
  Émile Michel Hyacinthe Lemoine (French: [emil ləmwan]; 22 November 1840 – 21 February 1912) was a French civil engineer and a mathematician, a geometer in particular. He was educated at a variety of institutions, including the Prytanée National Militaire and, most notably, the École Polytechnique. Lemoine taught as a private tutor for a short period after his graduation from the latter school.
  
  Lemoine is best known for his proof of the existence of the Lemoine point (or the symmedian point) of a triangle. Other mathematical work includes a system he called Géométrographie and a method which related algebraic expressions to geometric objects. He has been called a co-founder of modern triangle geometry, as many of its characteristics are present in his work. (Full article...)
• 
  
  

  

  Portrait, c. 1910, after 1620 original

  
  Johannes Kepler (27 December 1571 – 15 November 1630) was a German polymath who was an astronomer, mathematician, astrologer, natural philosopher and music theorist. He is a key figure in the 17th-century Scientific Revolution, best known for his laws of planetary motion, and his books Astronomia nova, Harmonice Mundi, and Epitome Astronomiae Copernicanae. The variety and impact of his work made Kepler one of the founders and fathers of modern astronomy, the scientific method, natural science, and modern science. He has been described as the "father of science fiction" for his novel Somnium.
  
  Kepler was a mathematics teacher at a seminary school in Graz, where he became an associate of Prince Hans Ulrich von Eggenberg. Later he became an assistant to the astronomer Tycho Brahe in Prague, and eventually the imperial mathematician to Emperor Rudolf II and his two successors Matthias and Ferdinand II. He also taught mathematics in Linz, and was an adviser to General Wallenstein. (Full article...)
• 

  

  The manipulations of the Rubik's Cube form the Rubik's Cube group.

  
  In mathematics, a group is a set with an operation that combines any two elements of the set to produce a third element within the same set and the following conditions must hold: the operation is associative, it has an identity element, and every element of the set has an inverse element. For example, the integers with the addition operation form a group.
  
  The concept of a group was elaborated for handling, in a unified way, many mathematical structures such as numbers, geometric shapes and polynomial roots. Because the concept of groups is ubiquitous in numerous areas both within and outside mathematics, some authors consider it as a central organizing principle of contemporary mathematics. (Full article...)
• 

  

  Logic studies valid forms of inference like modus ponens.

  
  
  Logic is the study of correct reasoning. It includes both formal and informal logic. Formal logic is the study of deductively valid inferences or logical truths. It examines how conclusions follow from premises based on the structure of arguments alone, independent of their topic and content. Informal logic is associated with informal fallacies, critical thinking, and argumentation theory. Informal logic examines arguments expressed in natural language whereas formal logic uses formal language. When used as a countable noun, the term "a logic" refers to a specific logical formal system that articulates a proof system. Logic plays a central role in many fields, such as philosophy, mathematics, computer science, and linguistics.
  
  Logic studies arguments, which consist of a set of premises that leads to a conclusion. An example is the argument from the premises "it's Sunday" and "if it's Sunday then I don't have to work" leading to the conclusion "I don't have to work." Premises and conclusions express propositions or claims that can be true or false. An important feature of propositions is their internal structure. For example, complex propositions are made up of simpler propositions linked by logical vocabulary like $\land$ (and) or $\to$ (if...then). Simple propositions also have parts, like "Sunday" or "work" in the example. The truth of a proposition usually depends on the meanings of all of its parts. However, this is not the case for logically true propositions. They are true only because of their logical structure independent of the specific meanings of the individual parts. (Full article...)
• 

  

  
  Richard Phillips Feynman (/ˈfaɪnmən/; May 11, 1918 – February 15, 1988) was an American theoretical physicist. He shared the 1965 Nobel Prize in Physics with Julian Schwinger and Shin'ichirō Tomonaga "for their fundamental work in quantum electrodynamics (QED), with deep-ploughing consequences for the physics of elementary particles".
  He is also known for his work in the path integral formulation of quantum mechanics, the theory of the physics of the superfluidity of supercooled liquid helium, and the parton model. Feynman developed a pictorial representation scheme for the mathematical expressions describing the behavior of subatomic particles, which later became known as Feynman diagrams and remains widely used.
  
  He assisted in the development of the atomic bomb during World War II and became known to the wider public in the 1980s as a member of the Rogers Commission, the panel that investigated the Space Shuttle Challenger disaster. Along with his work in theoretical physics, Feynman has been credited with having pioneered the field of quantum computing and introducing the concept of nanotechnology. He held the Richard C. Tolman professorship in theoretical physics at the California Institute of Technology. In a 1999 poll of 130 leading physicists worldwide by the British journal Physics World, he was ranked the seventh-greatest physicist of all time. (Full article...)
• 

  

  
  Josiah Willard Gibbs (/ɡɪbz/; February 11, 1839 – April 28, 1903) was an American mechanical engineer and scientist who made fundamental theoretical contributions to physics, chemistry, and mathematics. His work on the applications of thermodynamics was instrumental in transforming physical chemistry into a rigorous deductive science. Together with James Clerk Maxwell and Ludwig Boltzmann, he created statistical mechanics (a term that he coined), explaining the laws of thermodynamics as consequences of the statistical properties of ensembles of the possible states of a physical system composed of many particles. Gibbs also worked on the application of Maxwell's equations to problems in physical optics. As a mathematician, he created modern vector calculus (independently of the British scientist Oliver Heaviside, who carried out similar work during the same period) and described the Gibbs phenomenon in the theory of Fourier analysis.
  
  In 1863, Yale University awarded Gibbs the first American doctorate in engineering. After a three-year sojourn in Europe, Gibbs spent the rest of his career at Yale, where he was a professor of mathematical physics from 1871 until his death in 1903. Working in relative isolation, he became the earliest theoretical scientist in the United States to earn an international reputation and was praised by Albert Einstein as "the greatest mind in American history". In 1901, Gibbs received what was then considered the highest honor awarded by the international scientific community, the Copley Medal of the Royal Society of London, "for his contributions to mathematical physics". (Full article...)
• 

  

  Figure 1: A solution (in purple) to Apollonius's problem. The given circles are shown in black.

  
  
  In Euclidean plane geometry, Apollonius's problem is to construct circles that are tangent to three given circles in a plane (Figure 1). Apollonius of Perga (c. 262 BC – c. 190 BC) posed and solved this famous problem in his work Ἐπαφαί (Epaphaí, 'Tangencies'); this work has been lost, but a 4th-century AD report of his results by Pappus of Alexandria has survived. Three given circles generically have eight different circles that are tangent to them (Figure 2), a pair of solutions for each way to divide the three given circles in two subsets (there are 4 ways to divide a set of cardinality 3 in 2 parts).
  
  In the 16th century, Adriaan van Roomen solved the problem using intersecting hyperbolas, but this solution uses methods not limited to straightedge and compass constructions. François Viète found a straightedge and compass solution by exploiting limiting cases: any of the three given circles can be shrunk to zero radius (a point) or expanded to infinite radius (a line). Viète's approach, which uses simpler limiting cases to solve more complicated ones, is considered a plausible reconstruction of Apollonius's method. The method of van Roomen was simplified by Isaac Newton, who showed that Apollonius's problem is equivalent to finding a position from the differences of its distances to three known points. This has applications in navigation and positioning systems such as LORAN. (Full article...)
• 
  
  

  

  Cantor, c. 1910

  
  Georg Ferdinand Ludwig Philipp Cantor (/ˈkæntɔːr/ KAN-tor; German: [ˈɡeːɔʁk ˈfɛʁdinant ˈluːtvɪç ˈfɪlɪp ˈkantoːɐ̯]; 3 March [O.S. 19 February] 1845 – 6 January 1918) was a mathematician who played a pivotal role in the creation of set theory, which has become a fundamental theory in mathematics. Cantor established the importance of one-to-one correspondence between the members of two sets, defined infinite and well-ordered sets, and proved that the real numbers are more numerous than the natural numbers. Cantor's method of proof of this theorem implies the existence of an infinity of infinities. He defined the cardinal and ordinal numbers and their arithmetic. Cantor's work is of great philosophical interest, a fact of which he was well aware.
  
  Originally, Cantor's theory of transfinite numbers was regarded as counter-intuitive – even shocking. This caused it to encounter resistance from mathematical contemporaries such as Leopold Kronecker and Henri Poincaré and later from Hermann Weyl and L. E. J. Brouwer, while Ludwig Wittgenstein raised philosophical objections; see Controversy over Cantor's theory. Cantor, a devout Lutheran Christian, believed the theory had been communicated to him by God. Some Christian theologians (particularly neo-Scholastics) saw Cantor's work as a challenge to the uniqueness of the absolute infinity in the nature of God – on one occasion equating the theory of transfinite numbers with pantheism – a proposition that Cantor vigorously rejected. Not all theologians were against Cantor's theory; prominent neo-scholastic philosopher Konstantin Gutberlet was in favor of it, and Cardinal Johann Baptist Franzelin accepted it as a valid theory (after Cantor made some important clarifications). (Full article...)
• 
  
  

  

  The title page of a 1634 version of Hues's Tractatus de globis in the collection of the Biblioteca Nacional de Portugal

  
  Robert Hues (1553 – 24 May 1632) was an English mathematician and geographer. He attended St. Mary Hall at Oxford, and graduated in 1578. Hues became interested in geography and mathematics, and studied navigation at a school set up by Walter Raleigh. During a trip to Newfoundland, he made observations which caused him to doubt the accepted published values for variations of the compass. Between 1586 and 1588, Hues travelled with Thomas Cavendish on a circumnavigation of the globe, performing astronomical observations and taking the latitudes of places they visited. Beginning in August 1591, Hues and Cavendish again set out on another circumnavigation of the globe. During the voyage, Hues made astronomical observations in the South Atlantic, and continued his observations of the variation of the compass at various latitudes and at the Equator. Cavendish died on the journey in 1592, and Hues returned to England the following year.
  
  In 1594, Hues published his discoveries in the Latin work Tractatus de globis et eorum usu (Treatise on Globes and Their Use) which was written to explain the use of the terrestrial and celestial globes that had been made and published by Emery Molyneux in late 1592 or early 1593, and to encourage English sailors to use practical astronomical navigation. Hues's work subsequently went into at least 12 other printings in Dutch, English, French and Latin. (Full article...)
• 
  
  

  

  Title page of the first edition of Wright's Certaine Errors in Navigation (1599)

  
  Edward Wright (baptised 8 October 1561; died November 1615) was an English mathematician and cartographer noted for his book Certaine Errors in Navigation (1599; 2nd ed., 1610), which for the first time explained the mathematical basis of the Mercator projection by building on the works of Pedro Nunes, and set out a reference table giving the linear scale multiplication factor as a function of latitude, calculated for each minute of arc up to a latitude of 75°. This was in fact a table of values of the integral of the secant function, and was the essential step needed to make practical both the making and the navigational use of Mercator charts.
  
  Wright was born at Garveston in Norfolk and educated at Gonville and Caius College, Cambridge, where he became a fellow from 1587 to 1596. In 1589 the college granted him leave after Elizabeth I requested that he carry out navigational studies with a raiding expedition organised by the Earl of Cumberland to the Azores to capture Spanish galleons. The expedition's route was the subject of the first map to be prepared according to Wright's projection, which was published in Certaine Errors in 1599. The same year, Wright created and published the first world map produced in England and the first to use the Mercator projection since Gerardus Mercator's original 1569 map. (Full article...)

Selected image –

three lines connecting corresponding vertices of a larger triangle on the left and a smaller one on the right converge at a point further to the right called the "center of perspectivity"

Desargues's theorem

Credit: User:Jujutacular, based on an original by User:DynaBlast

In projective geometry, Desargues' theorem states that two triangles are in perspective axially if and only if they are in perspective centrally. Lines through the triangle sides meet in pairs at collinear points along the axis of perspectivity. Lines through corresponding pairs of vertices on the triangles meet at a point called the center of perspectivity.

Good articles –

  These are Good articles, which meet a core set of high editorial standards.

---

• 

  

  Vector addition and scalar multiplication: a vector v (blue) is added to another vector w (red, upper illustration). Below, w is stretched by a factor of 2, yielding the sum v + 2w.

  
  
  In mathematics, a vector space (also called a linear space) is a set whose elements, often called vectors, can be added together and multiplied ("scaled") by numbers called scalars. The operations of vector addition and scalar multiplication must satisfy certain requirements, called vector axioms. Real vector spaces and complex vector spaces are kinds of vector spaces based on different kinds of scalars: real numbers and complex numbers. Scalars can also be, more generally, elements of any field.
  
  Vector spaces generalize Euclidean vectors, which allow modeling of physical quantities (such as forces and velocity) that have not only a magnitude, but also a direction. The concept of vector spaces is fundamental for linear algebra, together with the concept of matrices, which allows computing in vector spaces. This provides a concise and synthetic way for manipulating and studying systems of linear equations. (Full article...)
• 
  Stars is a wood engraving print created by the Dutch artist M. C. Escher in 1948, depicting two chameleons in a polyhedral cage floating through space.
  
  The compound of three octahedra used for the central cage in Stars had been studied before in mathematics, and Escher likely learned of it from the book Vielecke und Vielflache by Max Brückner. Escher used similar compound polyhedral forms in several other works, including Crystal (1947), Study for Stars (1948), Double Planetoid (1949), and Waterfall (1961). (Full article...)
• 
  Vedic Mathematics is a book written by Indian Shankaracharya Bharati Krishna Tirtha and first published in 1965. It contains a list of mathematical techniques which were falsely claimed to contain advanced mathematical knowledge. The book was posthumously published under its deceptive title by editor V. S. Agrawala, who noted in the foreword that the claim of Vedic origin, made by the original author and implied by the title, was unsupported.
  
  Neither Krishna Tirtha nor Agrawala were able to produce sources, and scholars unanimously note it to be a compendium of methods for increasing the speed of elementary mathematical calculations sharing no overlap with historical mathematical developments during the Vedic period. Nonetheless, there has been a proliferation of publications in this area and multiple attempts to integrate the subject into mainstream education at the state level by right-wing Hindu nationalist governments. (Full article...)
• 
  1 (one, unit, unity) is a number, numeral, and grapheme. It is the first and smallest positive integer of the infinite sequence of natural numbers. This fundamental property has led to its unique uses in other fields, ranging from science to sports, where it commonly denotes the first, leading, or top thing in a group. 1 is the unit of counting or measurement, and represents a single thing. The representation of 1 evolved from ancient Sumerian and Babylonian symbols to the modern Arabic numeral. Linguistically, in English, "one" is a determiner for singular nouns and a gender-neutral pronoun.
  
  In mathematics, 1 is the multiplicative identity, meaning that any number multiplied by 1 equals the same number. 1 is by convention not considered a prime number. In digital technology, 1 represents the "on" state in binary code, the foundation of computing. Philosophically, 1 symbolizes the ultimate reality or source of existence in various traditions. (Full article...)
• 
  In mathematics, a square-difference-free set is a set of natural numbers, no two of which differ by a square number. Hillel Furstenberg and András Sárközy proved in the late 1970s the Furstenberg–Sárközy theorem of additive number theory showing that, in a certain sense, these sets cannot be very large. In the game of subtract a square, the positions where the next player loses form a square-difference-free set. Another square-difference-free set is obtained by doubling the Moser–de Bruijn sequence.
  
  The best known upper bound on the size of a square-difference-free set of numbers up to $n$ is only slightly sublinear, but the largest known sets of this form are significantly smaller, of size $\approx n^{0.733412}$. Closing the gap between these upper and lower bounds remains an open problem. The sublinear size bounds on square-difference-free sets can be generalized to sets where certain other polynomials are forbidden as differences between pairs of elements. (Full article...)
• 
  Mathematical economics is the application of mathematical methods to represent theories and analyze problems in economics. Often, these applied methods are beyond simple geometry, and may include differential and integral calculus, difference and differential equations, matrix algebra, mathematical optimization, or other computational methods. Proponents of this approach claim that it allows the formulation of theoretical relationships with rigor, generality, and simplicity.
  
  Mathematics allows economists to form meaningful, testable propositions about wide-ranging and complex subjects that would be less easily expressed informally. Further, the language of mathematics allows economists to make specific, positive claims about controversial subjects that would be impossible without it. Much of economic theory is currently presented in terms of mathematical economic models, a set of stylized and simplified mathematical relationships asserted to clarify assumptions and implications. (Full article...)
• 
  In mathematics, economics, and computer science, the Gale–Shapley algorithm (also known as the deferred acceptance algorithm, propose-and-reject algorithm, or Boston Pool algorithm) is an algorithm for finding a solution to the stable matching problem. It is named for David Gale and Lloyd Shapley, who published it in 1962, although it had been used for the National Resident Matching Program since the early 1950s. Shapley and Alvin E. Roth (who pointed out its prior application) won the 2012 Nobel Prize in Economics for work including this algorithm.
  
  The stable matching problem seeks to pair up equal numbers of participants of two types, using preferences from each participant. The pairing must be stable: no pair of matched participants should mutually prefer each other to their assigned match. In each round of the Gale–Shapley algorithm, unmatched participants of one type propose a match to the next participant on their preference list. Each proposal is accepted if its recipient prefers it to their current match. The resulting procedure is a truthful mechanism from the point of view of the proposing participants, who receive their most-preferred pairing consistent with stability. In contrast, the recipients of proposals receive their least-preferred pairing. The algorithm can be implemented to run in time quadratic in the number of participants, and linear in the size of the input to the algorithm. (Full article...)
• 

  

  Two intersecting families of two-element subsets of a four-element set. The sets in the left family all contain the bottom left element. The sets in the right family avoid this element.

  
  In mathematics, the Erdős–Ko–Rado theorem limits the number of sets in a family of sets for which every two sets have at least one element in common. Paul Erdős, Chao Ko, and Richard Rado proved the theorem in 1938, but did not publish it until 1961. It is part of the field of combinatorics, and one of the central results of extremal set theory.
  The theorem applies to families of sets that all have the same size, $r$, and are all subsets of some larger set of size $n$. One way to construct a family of sets with these parameters, each two sharing an element, is to choose a single element to belong to all the subsets, and then form all of the subsets of size $r$ that contain the chosen element. The Erdős–Ko–Rado theorem states that when $n$ is large enough for the problem to be nontrivial ($n\geq 2r$) this construction produces the largest possible intersecting families. When $n=2r$ there are other equally-large families, but for larger values of $n$ only the families constructed in this way can be largest. (Full article...)
• 

  

  Three of the ordinary lines in a 4 × 4 grid of points

  
  The Sylvester–Gallai theorem in geometry states that every finite set of points in the Euclidean plane has a line that passes through exactly two of the points or a line that passes through all of them. It is named after James Joseph Sylvester, who posed it as a problem in 1893, and Tibor Gallai, who published one of the first proofs of this theorem in 1944.
  
  A line that contains exactly two of a set of points is known as an ordinary line. Another way of stating the theorem is that every finite set of points that is not collinear has an ordinary line. According to a strengthening of the theorem, every finite point set (not all on one line) has at least a linear number of ordinary lines. An algorithm can find an ordinary line in a set of $n$ points in time $O(n\log n)$. (Full article...)
• 

  

  The Shapley–Folkman lemma is illustrated by the Minkowski addition of four sets. The point (+) in the convex hull of the Minkowski sum of the four non-convex sets (right) is the sum of four points (+) from the (left-hand) sets—two points in two non-convex sets plus two points in the convex hulls of two sets. The convex hulls are shaded pink. The original sets each have exactly two points (shown as red dots).

  
  The Shapley–Folkman lemma is a result in convex geometry that describes the Minkowski addition of sets in a vector space. The lemma may be intuitively understood as saying that, if the number of summed sets exceeds the dimension of the vector space, then their Minkowski sum is approximately convex. It is named after mathematicians Lloyd Shapley and Jon Folkman, but was first published by the economist Ross M. Starr.
  
  Related results provide more refined statements about how close the approximation is. For example, the Shapley–Folkman theorem provides an upper bound on the distance between any point in the Minkowski sum and its convex hull. This upper bound is sharpened by the Shapley–Folkman–Starr theorem (alternatively, Starr's corollary). (Full article...)
• 
  In computational complexity theory, Yao's principle (also called Yao's minimax principle or Yao's lemma) relates the performance of randomized algorithms to deterministic (non-random) algorithms. It states that, for certain classes of algorithms, and certain measures of the performance of the algorithms, the following two quantities are equal:

  • The optimal performance that can be obtained by a deterministic algorithm on a random input (its average-case complexity), for a probability distribution on inputs chosen to be as hard as possible and for an algorithm chosen to work as well as possible against that distribution
  • The optimal performance that can be obtained by a random algorithm on a deterministic input (its expected complexity), for an algorithm chosen to have the best performance on its worst case inputs, and the worst case input to the algorithm

  
  Yao's principle is often used to prove limitations on the performance of randomized algorithms, by finding a probability distribution on inputs that is difficult for deterministic algorithms, and inferring that randomized algorithms have the same limitation on their worst case performance.
  
  This principle is named after Andrew Yao, who first proposed it in a 1977 paper. It is closely related to the minimax theorem in the theory of zero-sum games, and to the duality theory of linear programs. (Full article...)
• 

  

  Euclidean minimum spanning tree of 25 random points in the plane

  
  
  A Euclidean minimum spanning tree of a finite set of points in the Euclidean plane or higher-dimensional Euclidean space connects the points by a system of line segments with the points as endpoints, minimizing the total length of the segments. In it, any two points can reach each other along a path through the line segments. It can be found as the minimum spanning tree of a complete graph with the points as vertices and the Euclidean distances between points as edge weights.
  
  The edges of the minimum spanning tree meet at angles of at least 60°, at most six to a vertex. In higher dimensions, the number of edges per vertex is bounded by the kissing number of tangent unit spheres. The total length of the edges, for points in a unit square, is at most proportional to the square root of the number of points. Each edge lies in an empty region of the plane, and these regions can be used to prove that the Euclidean minimum spanning tree is a subgraph of other geometric graphs including the relative neighborhood graph and Delaunay triangulation. By constructing the Delaunay triangulation and then applying a graph minimum spanning tree algorithm, the minimum spanning tree of $n$ given planar points may be found in time $O(n\log n)$, as expressed in big O notation. This is optimal in some models of computation, although faster randomized algorithms exist for points with integer coordinates. For points in higher dimensions, finding an optimal algorithm remains an open problem. (Full article...)

Did you know (auto-generated) –

• ... that the symbol for equality in mathematics was not used for 61 years after its introduction, and was later popularized by Isaac Newton?
• ... that Pamela Ball was prouder of her mathematics degrees than of being the first Jamaican woman to be a fellow of the Royal College of Surgeons of England?
• ... that Peter Nagy based his song "Profesor Indigo" on his former math teacher?
• ... that formal semantics uses logic and mathematics to study language?
• ... that Latvian-Soviet artist Karlis Johansons exhibited a skeletal tensegrity form of the Schönhardt polyhedron seven years before Erich Schönhardt's 1928 paper on its mathematics?
• ... that the Prison Mathematics Project brought a professor from Italy to an American prison to celebrate Pi Day?
• ... that Caltech students called their calculus books "Tommy 1" and "Tommy 2"?
• ... that the discovery of Descartes' theorem in geometry came from a too-difficult mathematics problem posed to a princess?

More did you know –

Did you know...

• ... that no matter how biased a coin one uses, flipping a coin to determine whether each edge is present or absent in a countably infinite graph will always produce the same graph, the Rado graph?
• ...that it is possible to stack identical dominoes off the edge of a table to create an arbitrarily large overhang?
• ...that in Floyd's algorithm for cycle detection, the tortoise and hare move at very different speeds, but always finish at the same spot?
• ...that in graph theory, a pseudoforest can contain trees and pseudotrees, but cannot contain any butterflies, diamonds, handcuffs, or bicycles?
• ...that it is not possible to configure two mutually inscribed quadrilaterals in the Euclidean plane, but the Möbius–Kantor graph describes a solution in the complex projective plane?
• ...that the six permutations of the vector (1,2,3) form a hexagon in 3D space, the 24 permutations of (1,2,3,4) form a truncated octahedron in four dimensions, and both are examples of permutohedra?
• ...that the Rule 184 cellular automaton can simultaneously model the behavior of cars moving in traffic, the accumulation of particles on a surface, and particle-antiparticle annihilation reactions?

Selected article –

The region between two loxodromes on a geometric sphere. Image credit: Karthik Narayanaswami

The Riemann sphere is a way of extending the plane of complex numbers with one additional point at infinity, in a way that makes expressions such as

${\frac {1}{0}}=\infty$

well-behaved and useful, at least in certain contexts. It is named after 19th century mathematician Bernhard Riemann. It is also called the complex projective line, denoted CP¹.

On a purely algebraic level, the complex numbers with an extra infinity element constitute a number system known as the extended complex numbers. Arithmetic with infinity does not obey all of the usual rules of algebra, and so the extended complex numbers do not form a field. However, the Riemann sphere is geometrically and analytically well-behaved, even near infinity; it is a one-dimensional complex manifold, also called a Riemann surface.

In complex analysis, the Riemann sphere facilitates an elegant theory of meromorphic functions. The Riemann sphere is ubiquitous in projective geometry and algebraic geometry as a fundamental example of a complex manifold, projective space, and algebraic variety. It also finds utility in other disciplines that depend on analysis and geometry, such as quantum mechanics and other branches of physics. (Full article...)

View all selected articles

Subcategories

Algebra | Arithmetic | Analysis | Complex analysis | Applied mathematics | Calculus | Category theory | Chaos theory | Combinatorics | Dynamical systems | Fractals | Game theory | Geometry | Algebraic geometry | Graph theory | Group theory | Linear algebra | Mathematical logic | Model theory | Multi-dimensional geometry | Number theory | Numerical analysis | Optimization | Order theory | Probability and statistics | Set theory | Statistics | Topology | Algebraic topology | Trigonometry | Linear programming

---

Mathematics | History of mathematics | Mathematicians | Awards | Education | Literature | Notation | Organizations | Theorems | Proofs | Unsolved problems

Full category tree. Select [►] to view subcategories.

Mathematics

Mathematics by country

Fields of mathematics

Applied mathematics

Mathematicians

Women in mathematics

Works about mathematics

Mathematics-related lists

Mathematics and art

Mathematical classification systems

Mathematical concepts

Mathematical constants

Mathematics and culture

Mathematical examples

History of mathematics

Mathematics occupations

Mathematical notation

Outlines of mathematics and logic

Philosophy of mathematics

Mathematical projects

Mathematical proofs

Pseudomathematics

Set index articles on mathematics

Mathematical terminology

Mathematical theorems

Mathematical tools

Mathematics stubs

Topics in mathematics

General

• Mathematicians
• History of mathematics
• Philosophy of mathematics
• Mathematical notation
• Mathematical beauty
• Mathematics education
• Glossary of mathematical symbols

Foundations

• Foundations of mathematics
• Mathematical logic
  • Proof theory
    • Gödel's incompleteness theorems
  • Model theory
  • Recursion theory
• Set theory
  • Naive set theory
  • Axiomatic set theory
• Category theory
  • Homological algebra
  • Topos theory

Number theory

• Number theory
• Algebraic number theory
• Analytic number theory
• Arithmetic
  • Fundamental theorem of arithmetic
• Numbers
  • Natural numbers
  • Prime numbers
  • Rational numbers
  • Algebraic numbers

Discrete mathematics

• Discrete mathematics
• Combinatorics
  • Combinatorial geometry
  • Coding theory
  • Combinatorial design
  • Enumerative combinatorics
  • Combinatorial optimization
• Graph theory
• Order theory
  • Lattice theory
• Digital Signal Processing
• Theoretical computer science
  • Computability theory
  • Complexity theory

Algebra

• Algebra
  • Fundamental theorem of algebra
• Elementary algebra
• Abstract algebra
  • Group theory
  • Ring theory
  • Field theory
  • Commutative algebra
  • Universal algebra
• Geometric algebra
• Linear algebra
  • Matrix theory
  • Multilinear algebra
• Representation theory

Analysis

• Analysis
• Calculus
  • Fundamental theorem of calculus
  • Differentiation
  • Integration
  • Multivariable calculus
  • Vector calculus
  • Geometric calculus
  • Tensor calculus
  • Matrix calculus
• Differential equations
  • Ordinary differential equations
  • Partial differential equations
  • Stochastic differential equations
• Real analysis
• Complex analysis
• Measure theory
• Potential theory
• Harmonic analysis
• Geometric analysis
• Approximation theory
• Special functions
  • Fourier analysis
• Functional analysis
• Operator theory

Geometry and topology

• Geometry
• Euclidean geometry
  • Trigonometry
• Analytic geometry
• Non-Euclidean geometry
• Affine geometry
• Projective geometry
• Convex geometry
• Discrete geometry
• Computational geometry
• Algebraic geometry
• Differential geometry
  • K theory
  • Gauge theory
  • Riemannian geometry
  • Lie groups
• Complex geometry
• Topology
  • General topology
  • Algebraic topology
  • Geometric topology
  • Differential topology
  • Pointless topology

Applied mathematics

• Applied mathematics
• Mathematical modeling
• Mathematical physics
• Dynamical systems
  • Control theory
  • Calculus of variations
• Operations research
• Optimization
• Mathematical economics
  • Game theory
  • Mathematical finance
• Statistics
• Probability theory
  • Stochastic processes
• Numerical analysis
• Cryptography
• Information theory

Index of mathematics articles

ARTICLE INDEX:	0–9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
MATHEMATICIANS:	A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

Related portals

WikiProjects

The Mathematics WikiProject is the center for mathematics-related editing on Wikipedia. Join the discussion on the project's talk page.

Project pages

• Participants
• Current activity
• Manual of style
• Conventions

Essays

• Advice on using Wikipedia for mathematics self-study
• Proofs

Subprojects

• PlanetMath Exchange (Talk)
• Graphics (Talk)
• Article assessment (Talk)

Related projects

Computer science | Cryptography | Game theory | Numbers | Physics | Science | Statistics

Things you can do

• Create a new article: List of requested articles
• Add a new image: Image requests
• Expand an article: Mathematics stubs
• Lend your expertise: Expert attention needed

In other Wikimedia projects

The following Wikimedia Foundation sister projects provide more on this subject:

• 
  Commons
  Free media repository
• 
  Wikidata
  Free knowledge base
• 
  Wikiquote
  Collection of quotations
• 
  Wikisource
  Free-content library
• 
  Wikiversity
  Free learning tools
• 
  Wiktionary
  Dictionary and thesaurus

More portals

Discover Wikipedia using portals

• 

  List of all portals
• 
  The arts portal
• 
  Biography portal
• 
  Current events portal
• 
  Geography portal
• 
  History portal
• 
  Mathematics portal
• 
  Science portal
• 
  Society portal
• 
  Technology portal

• 

  Random portal

• 

  WikiProject Portals