List of 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 rigorous arguments or precise ideas. Much of this is common English, but with a specific non-obvious meaning when used in a mathematical sense.

Some phrases, like "in general", appear below in more than one section.

[The paper of Eilenberg and Mac Lane (1942)] introduced the very abstract idea of a 'category' — a subject then called 'general abstract nonsense'!

[Grothendieck] raised algebraic geometry to a new level of abstraction...if certain mathematicians could console themselves for a time with the hope that all these complicated structures were 'abstract nonsense'...the later papers of Grothendieck and others showed that classical problems...which had resisted efforts of several generations of talented mathematicians, could be solved in terms of...complicated concepts.

There are two canonical proofs that are always used to show non-mathematicians what a mathematical proof is like:

The beauty of a mathematical theory is independent of the aesthetic qualities...of the theory's rigorous expositions. Some beautiful theories may never be given a presentation which matches their beauty....Instances can also be found of mediocre theories of questionable beauty which are given brilliant, exciting expositions....[Category theory] is rich in beautiful and insightful definitions and poor in elegant proofs....[The theorems] remain clumsy and dull....[Expositions of projective geometry] vied for one another in elegance of presentation and in cleverness of proof....In retrospect, one wonders what all the fuss was about.

Mathematicians may say that a theorem is beautiful when they really mean to say that it is enlightening. We acknowledge a theorem's beauty when we see how the theorem 'fits' in its place....We say that a proof is beautiful when such a proof finally gives away the secret of the theorem....

A result is called "folklore" if it is non-obvious, non-published, yet somehow generally known to the specialists within a field. In many scenarios, it is unclear as to who first obtained the result, though if the result is significant, it may eventually find its way into the textbooks, whereupon it ceases to be folklore.

Many of the results mentioned in this paper should be considered "folklore" in that they merely formally state ideas that are well-known to researchers in the area, but may not be obvious to beginners and to the best of my knowledge do not appear elsewhere in print.

Similar to "canonical" but more specific, and which 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.

Since half a century we have seen arise a crowd of bizarre functions which seem to try to resemble as little as possible the honest functions which serve some purpose....Nay more, from the logical point of view, it is these strange functions which are the most they are invented expressly to put at fault the reasonings of our fathers....

[The Dirichlet function] took on an enormous giving an incentive for the creation of new types of function whose properties departed completely from what intuitively seemed admissible. A celebrated example of such a so-called 'pathological' the one provided by Weierstrass....This function is continuous but not differentiable.

The act of establishing a mathematical result using indisputable logic, rather than informal descriptive argument. Rigor is a cornerstone quality of mathematics, and can play an important role in preventing mathematics from degenerating into fallacies.

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.

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. Also much in general-language use among mathematicians: "Of course, this problem can be arbitrarily complicated".
"Not infinite". For example, if the variance of a random variable is said to be finite, this implies it is a non-negative real number.

Norbert A'Campo of the University of Basel once asked Grothendieck about something related to the Platonic solids. Grothendieck advised caution. The Platonic solids are so beautiful and so exceptional, he said, that one cannot assume such exceptional beauty will hold in more general situations.

Accurately and precisely described or specified. For example, sometimes a definition relies on a choice of some object; the result of the definition must then be independent of this choice.

The formal language of proof draws repeatedly from a small pool of ideas, many of which are invoked through various lexical shorthands in practice.

An obsolescent term which is used to announce to the reader an alternative method, or proof of a result. In a proof, it therefore flags a piece of reasoning that is superfluous from a logical point of view, but has some other interest.
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.
need to show (NTS), required to prove (RTP), wish to show, want to show (WTS)
Proofs sometimes proceed by enumerating several conditions whose satisfaction will together imply the desired theorem; thus, one needs to show just these statements.
A statement of the existence and uniqueness of an object; the object exists, and furthermore, no other such object exists.
A condition on objects in the scope of the discussion, to be specified later, that will guarantee that some stated property holds for them. 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.
Often several equivalent conditions (especially for a definition, such as normal subgroup) are equally useful in practice; one introduces a theorem stating an equivalence of more than two statements with TFAE.

Let V be a finite-dimensional vector space over k....Let (ei)1≤ in be a basis for V....There is an isomorphism of the polynomial algebra k[Tij]1≤ i, jn onto the algebra Symk(V ⊗ V*)....It extends to an isomorphism of k[GLn] to the localized algebra Symk(V ⊗ V*)D, where D = det(ei ⊗ ej*)....We write k[GL(V)] for this last algebra. By transport of structure, we obtain a linear algebraic group GL(V) isomorphic to GLn.

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.

Mathematicians have several phrases to describe proofs or proof techniques. These are often used as hints for filling in tedious details.

An informal computation omitting much rigor without sacrificing correctness. Often this computation is "proof of concept" and treats only an accessible special case.
Rather than finding underlying principles or patterns, this is a method where one would evaluate as many cases as needed to sufficiently prove or provide convincing evidence that the thing in question is true. Sometimes this involves evaluating every possible case (where it is also known as proof by exhaustion).
A proof by example is an argument whereby a statement is not proved but instead illustrated by an example. If done well, the specific example would easily generalize to a general proof.
Style of proof where claims believed by the author to be easily verifiable are labelled as 'obvious' or 'trivial', which often results in the reader being confused.
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.
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.
for proofs involving objects with multiple indices which can be solved by going to the bottom (if anyone wishes to take up the effort). Similar to diagram chasing.