Mathematical jargon

The language of mathematics has a vast vocabulary of specialist and technical terms. It also has a certain amount of jargon: commonly used phrases which are part of the culture of mathematics, rather than of the subject. Jargon often appears in lectures, and sometimes in print, as informal shorthand for more rigorous arguments or more precise ideas. Much of this is common English, used in a mathematical or quasi-mathematical sense.__TOC__Note that some phrases, like "in general", appear in more than one section.

Philosophy of mathematics

These terms discuss mathematics as mathematicians think of it; they connote common intellectual strategies or notions the investigation of which somehow underlies much of mathematics.; abstract nonsenseanchor|abstract nonsense: Also "general abstract nonsense" or "generalized abstract nonsense", a tongue-in-cheek reference to category theory, using which one can employ arguments that establish a (possibly concrete) result without reference to any specifics of the present problem.; canonicalanchor|canonical: A reference to a standard or choice-free presentation of some mathematical object. The term "canonical" is also used more informally, meaning roughly "standard" or "classic". For example, one might say that Euclid's proof is the "canonical proof" of the infinitude of primes; indeed, this is a canonical example of a canonical proof.; elegantanchor|elegant: Also "beautiful"; an aesthetic term referring to the ability of an idea to provide insight into mathematics, whether by unifying disparate fields, introducing a new perspective on a single field, or providing a technique of proof which is either particularly simple, or captures the intuition or imagination as to why the result it proves is true. Gian-Carlo Rota distinguished between "elegance of presentation" and "beauty of concept", saying that for example, some topics could be written about elegantly although the mathematical content is not beautiful, and some theorems or proofs are beautiful but may be written about inelegantly.; naturalanchor|natural: Similar to "canonical" but more specific, this term makes reference to a description (almost exclusively in the context of transformations) which holds independently of any choices. Though long used informally, this term has found a formal definition in category theory.; pathologicalanchor|pathological: An object behaves pathologically if it fails to conform to the generic behavior of such objects, fails to satisfy certain regularity properties (depending on context), or simply disobeys mathematical intuition. These can be and often are contradictory requirements. Sometimes the term is more pointed, referring to an object which is specifically and artificially exhibited as a counterexample to these properties.; rigor (rigour)anchor|rigour): Mathematics strives to establish its results using indisputable logic rather than informal descriptive argument. Rigor is the use of such logic in a proof.; well-behavedanchor|well-behaved: An object is well-behaved (in contrast with being "pathological") if it "does" satisfy the prevailing regularity properties, or sometimes if it conforms to intuition (but intuition often suggests the opposite behavior as well).

Descriptive informalities

Although ultimately every mathematical argument must meet a high standard of precision, mathematicians use descriptive but informal statements to discuss recurring themes or concepts with unwieldy formal statements. Note that many of the terms are completely rigorous in context.; almost allanchor|almost all: A shorthand term for "all except for a set of measure zero", when there is a measure to speak of. For example, "almost all real numbers are transcendental" because the algebraic numbers form a countable set of measure zero. One can also speak of "almost all" integers having a property to mean "all but finitely many", despite the integers not admitting a measure for which this agrees with the previous usage. For example, "almost all prime numbers are odd". There is a more complicated meaning for integers as well, discussed in the main article. Finally, this term is sometimes used synonymously with "generic", below.; arbitrarily large, arbitrarily small, arbitrarily close: Notions which arise mostly in the context of limits, referring to the recurrence of a phenomenon as the limit is approached. A statement such as that predicate "P" is satisfied by arbitrarily large values, can be expressed in more formal notation by ∀"x" : ∃"y" ≥ "x" : "P"("y"). See also "frequently".; arbitraryanchor|arbitrary: A shorthand for the universal quantifier. An arbitrary choice is one which is made unrestrictedly, or alternatively, a statement holds of an arbitrary element of a set if it holds of any element of that set.; eventuallyanchor|eventually: In the context of limits, this is shorthand for "for sufficiently large arguments"; the relevant argument(s) are implicit in the context. As an example, one could say that "The function "log"("log"("x")) "eventually" becomes larger than 100"; in this context, "eventually" means "for sufficiently large "x".; factor throughanchor|factor through : A term in category theory referring to composition of functions. If we have three objects "A", "B", "C", a map $f\; colon\; A\; o\; C$ which is written as a composition $f\; =\; h\; circ\; g$ with $g\; colon\; A\; o\; B$, $h\; colon\; B\; o\; C$ is said to "factor through" any (and all) of $B$, $g$, and $h$.; finiteanchor|finite: Next to the usual meaning of "not infinite", in another more restrictive meaning that one may encounter, a value being said to be "finite" also excludes infinitesimal values and the value 0. For example, if the variance of a random variable is said to be finite, this implies it is a positive real number.; frequentlyanchor|frequently: In the context of limits, this is shorthand for "arbitrarily large" and its relatives; as with "eventually", the intended variant is implicit. As an example, one could say that "The function "sin"("x") is frequently zero", where "frequently" means "for arbitrarily large "x".; genericanchor|generic: This term has similar connotations as "almost all" but is used particularly for concepts outside the purview of measure theory. A property holds "generically" on a set if the set satisfies some (context-dependent) notion of density, or perhaps if its complement satisfies some (context-dependent) notion of smallness. For example, a property which holds on a dense G_δ (intersection of countably many open sets) is said to hold generically. In algebraic geometry, one says that a property of points on an algebraic variety that holds on a dense Zariski open set is true generically; however, it is usually not said that a property which holds merely on a dense set (which is not Zariski open) is generic in this situation.; in generalanchor|in general: In a descriptive context, this phrase introduces a simple characterization of a broad class of objects, with an eye towards identifying a unifying principle. Concisely, this term introduces an "elegant" description which holds for "arbitrary" objects "modulo" "pathology".; left-hand side, right-hand side (LHS, RHS)anchor|LHS|RHS: Most often, these refer simply to the left-hand or the right-hand side of an equation; for example, $x\; =\; y\; +\; 1$ has "x" on the LHS and "y +1" on the RHS. Occasionally, these are used in the sense of lvalue and rvalue: an RHS is primitive, and an LHS is derivative.; properanchor|proper: If, for some notion of substructure, objects are substructures of themselves (that is, the relationship is reflexive), then the qualification "proper" requires the objects to be different. For example, a "proper" subset of a set "S" is a subset of "S" that is different from "S", and a "proper" divisor of a number "n" is a divisor of "n" that is different from "n". This overloaded word is also non-jargon for a proper morphism.; resp.anchor|resp.: (Respectively) A convention to shorten parallel expositions. "A (resp. B) [has some relationship to] X (resp. Y)" means that A [has some relationship to] X and also that B [has (the same) relationship to] Y. ; sharpanchor|sharp: Often, a mathematical theorem will establish constraints on the behavior of some object; for example, a function will be shown to have an upper or lower bound. The constraint is "sharp" if it cannot be made more restrictive without failing in some cases.; smoothanchor|smooth: "Smoothness" is a concept which mathematics has endowed with many meanings, from simple differentiability to infinite differentiability to analyticity, and still others which are more complicated. Each such usage attempts to invoke the physically intuitive notion of smoothness.; strong, strongeranchor|strong|stronger : A theorem is said to be "strong" if it deduces restrictive results from general hypotheses. One celebrated example is Donaldson's theorem, which puts tight restraints on what would otherwise appear to be a large class of manifolds. This (informal) usage reflects the opinion of the mathematical community: not only should such a theorem be strong in the descriptive sense (below) but it should also be definitive in its area. A theorem, result, or condition is further called "stronger" than another one if a proof of the second can be easily obtained from the first. An example is the sequence of theorems: Fermat's little theorem, Euler's theorem, Lagrange's theorem, each of which is stronger than the last; another is that a sharp upper bound (see above) is a stronger result than a non-sharp one. Finally, the adjective "strong" or the adverb "strongly" may be added to a mathematical notion to indicate a related stronger notion; for example, a strong antichain is an antichain satisfying certain additional conditions, and likewise a strongly regular graph is a regular graph meeting stronger conditions. When used in this way, the stronger notion (such as "strong antichain") is a technical term with a precisely defined meaning; the nature of the extra conditions cannot be derived from the definition of the weaker notion (such as "antichain").; sufficiently large, suitably small, sufficiently closeanchor|sufficiently large|suitably small|sufficiently close: In the context of limits, these terms refer to some (unspecified, even unknown) point at which a phenomenon prevails as the limit is approached. A statement such as that predicate "P" holds for sufficiently large values, can be expressed in more formal notation by ∃"x" : ∀"y" ≥ "x" : "P"("y"). See also "eventually".; upstairs, downstairsanchor|upstairs|downstairs: A descriptive term referring to notation in which two objects are written one above the other; the upper one is "upstairs" and the lower, "downstairs". For example, in a fiber bundle, the total space is often said to be "upstairs", with the base space "downstairs". In a fraction, the numerator is occasionally referred to as "upstairs" and the denominator "downstairs", as in "bringing a term upstairs".; up to, modulo, mod out byanchor|up to|modulo|mod out by: An extension to mathematical discourse of the notions of modular arithmetic. A statement is true "up to" a condition if the establishment of that condition is the only impediment to the truth of the statement.; vanishanchor|vanish: To assume the value 0. For example, "The function sin("x") vanishes for those values of "x" that are integral multiples of π." This can also apply to limits: see Vanish at infinity. ; weak, weakeranchor|weak|weaker: The converse of strong.

Proofs and rigorous proof techniques

The formal language of proof draws repeatedly from a small pool of ideas, many of which are invoked through various lexical shorthands in practice.; aliteranchor|aliter: An obsolescent term which refers to an alternative method of proof.; diagram chaseanchor|diagram chase [Numerous examples can be found in Harvard citations|last = Mac Lane|year = 1998, for example on p. 100.] : Given a commutative diagram of objects and morphisms between them, if one wishes to prove some property of the morphisms (such as injectivity) which can be stated in terms of elements, then the proof can proceed by tracing the path of elements of various objects around the diagram as successive morphisms are applied to it. That is, one "chases" elements around the diagram, or does a "diagram chase".; for all sufficiently nice Xanchor|sufficiently nice: For all X which satisfy a set of conditions to be specified later. When working out a theorem, the use of this expression in the statement of the theorem indicates that the conditions involved may be not yet known to the speaker, and that the intent is to collect the conditions that will be found to be needed in order for the proof of the theorem to go through.; if and only if (iff)anchor|if and only if|iff: An abbreviation for logical equivalence of statements.; in generalanchor|in general : In the context of proofs, this phrase is often seen in induction arguments when passing from the base case to the "induction step", and similarly, in the definition of sequences whose first few terms are exhibited as examples of the formula giving every term of the sequence.; necessary and sufficientanchor|necessary and sufficient: A minor variant on "if and only if"; "necessary" means "only if" and "sufficient" means '"if". For example, "For a field "K" to be algebraically closed it is necessary and sufficient that it have no finite field extensions" means "K" is algebraically closed if and only if it has no finite extensions". Often used in lists, as in "The following conditions are necessary and sufficient for a field to be algebraically closed...".; need to show (NTS), required to prove (RTP), wish to show, want to show (WTS)anchor|need to show: Proofs sometimes proceed by enumerating several conditions whose satisfaction will together imply the desired theorem; thus, one "needs to show" just these statements.; one and only oneanchor|one and only one: An especially precise existence statement; the object exists, and furthermore, no other such object exists.; by way of contradiction (BWOC), or "for, if not, ..."anchor|by way of contradiction|BWOC: The rhetorical prelude to a proof by contradiction, preceding the negation of the statement to be proved.; Q.E.D.anchor|Q.E.D.: ("Quod erat demonstrandum"): A Latin abbreviation historically placed at the end of proofs, but less common currently.; the following are equivalent (TFAE)anchor|the following are equivalent|TFAE : A particular definition is not always the most convenient for certain applications; often one proves theorems stating equivalent rephrasings of the definition.; transport of structureanchor|transport of structure: It is often the case that two objects are shown to be equivalent in some way, and that one of them is endowed with additional structure. Using the equivalence, we may define such a structure on the second object as well, via "transport of structure". For example, any two vector spaces of the same dimension are isomorphic; if one of them is given an inner product and if we fix a particular isomorphism, then we may define an inner product on the other space by "factoring through" the isomorphism.; without (any) loss of generality (WLOG, WOLOG, WALOG), we may assume (WMA), it may be assumed that (WOLOGIMBAT)anchor|WLOG|we may assume|WMA: Sometimes a proposition can be more easily proved with additional assumptions on the objects it concerns. If the proposition as stated follows from this modified one with a simple and minimal explanation (for example, if the remaining special cases are identical but for notation), then the modified assumptions are introduced with this phrase and the altered proposition is proved.

Informal proof techniques

Some terms are techniques for the avoidance of rigorous proof, though are not logical fallacies. They suggest the content of a correct proof without supplying it.; back-of-the-envelope calculationanchor|back-of-the-envelope calculation: An informal computation omitting much rigor without sacrificing correctness. Often this computation is "proof of concept" and treats only an accessible special case.; by inspectionanchor|by inspection: A rhetorical shortcut made by authors who invite the reader to verify, at a glance, the correctness of a proposed expression or deduction.; clearly, can be easily shownanchor|clearly: A term which shortcuts around calculation the mathematician perceives to be tedious or routine, accessible to any member of the audience with the necessary expertise in the field; Laplace used "obvious". ; handwavinganchor|handwaving: A non-technique of proof mostly employed in lectures, where formal argument is not strictly necessary. It proceeds by omission of details or even significant ingredients, and is merely a plausibility argument.; anchor2|in general|in general (informal proof technique): In a context not requiring rigor, this phrase often appears as a labor-saving device when the technical details of a complete argument would outweigh the conceptual benefits. The author gives a proof in a simple enough case that the computations are reasonable, and then indicates that "in general" the proof is similar.; morally trueanchor|morally true: Used to indicate that the speaker believes a statement "should" be true, given their mathematical experience, even though a proof has not yet been put forward. As a variation, the statement may in fact be false, but instead provide a slogan for or illustration of a correct principle. Hasse's local-global principle is a particularly influential example of this.; trivialanchor|trivial: Similar to "clearly". A concept is trivial if it holds by definition, is immediately corollary to a known statement, or is a simple special case of a more general concept.

Footnotes

References

*citation
last1 = Monastyrsky
first1 = Michael
title = Some Trends in Modern Mathematics and the Fields Medal
journal = Can. Math. Soc. Notes
year = 2001
volume = 33
issue = 2 and 3
url = http://www.fields.utoronto.ca/aboutus/FieldsMedal_Monastyrsky.pdf
*citation
last1 = Mac Lane
first1 = Saunders
author1-link = Saunders Mac Lane
title = The PNAS way back then
year = 1997
pages = 5983–5985
volume = 94
journal = Proc. Natl. Acad. Sci. USA
url = http://www.pnas.org/cgi/reprint/94/12/5983.pdf
*citation
last2 = Mac Lane
first2 = Saunders
last1 = Eilenberg
first1 = Samuel
author2-link = Saunders Mac Lane
author1-link = Samuel Eilenberg
year = 1942
title = Natural Isomorphisms in Group Theory
journal = Proc. Natl. Acad. Sci. USA
volume = 28
pages = 537–543
*citation
last1 = Poincare
first1 = Henri
author1-link = Henri Poincare
title = The Foundations of Science
year = 1913
page = 435
editor1-last = Halsted
editor1-first = Bruce
publisher = The Science Press
url = http://books.google.com/books?id=WxLJzL4e4wsC&printsec=titlepage&source=gbs_summary_r&cad=0#PPA435,M1
*citation
last1 = Pinto
first1 = J. Sousa
title = Infinitesimal methods for mathematical analysis
editor1-last = Hoskins
editor1-first = R.F.
publisher = Horwood Publishing
year = 2004
page = 246
url = http://books.google.com/books?id=bLbfhYrhyJUC&pg=PA246&sig=S2vS6a489o-Ez8ORgn0ddDlRhz4#PPA246,M1
*citation
last = Mac Lane
first = Saunders
author-link = Saunders Mac Lane
title = Categories for the Working Mathematician
publisher = Springer
year = 1998
*citation
last = Shafarevich
first = Igor
author-link = Igor Shafarevich
year = 1991
editor1-last = Kandall
editor1-first = G.A.
publisher = Springer
title = Algebraic Geometry
volume = IV
* citation
last = Rota
first = Gian-Carlo
author-link = Gian-Carlo Rota
title = The phenomenology of mathematical beauty
year = 1977
journal = Synthese
volume = 111
issue = 2
pages = 171–182
issn = 0039-7857
* citation
last = Jackson
first = Allyn
year = 2004
journal = AMS Notices
volume = 51
number = 9,10
title = Comme Appelé du Néant — As If Summoned from the Void: The Life of Alexandre Grothendieck (Parts [http://www.ams.org/notices/200409/fea-grothendieck-part1.pdf I] and [http://www.ams.org/notices/200410/fea-grothendieck-part2.pdf II] )
* citation
title = Fundamentals of Mathematics
publisher = Global Media
isbn = 8189940570
url = http://books.google.com/books?id=bs0BfTsv5IgC&pg=PT4&sig=XdEBWVDSqf5l37VTfD1JRt2xhjo
*citation
title = The Seventeen Provers of the World
editor-last = Wiedijk
editor-first = Freek
year = 2006
publisher = Birkhäuser
isbn = 3540307044