View source for Glossary of mathematical jargon

{{Too many sections|date=February 2025}}
{{Short description|none}}

The [[language of mathematics]] has a wide [[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 [[Rigour#In_specific_disciplines|rigorous]] arguments or precise ideas. Much of this uses common English words, 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.

==Philosophy of mathematics==
; [[abstract nonsense]]{{anchor|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. For that reason, it is also known as ''general abstract nonsense'' or ''generalized abstract nonsense''.
{{quote|[The paper of {{Harvard citations|last2 = [[Saunders Mac Lane|Mac Lane]]|last1 = [[Samuel Eilenberg|Eilenberg]]|year = 1942|txt = yes}}] introduced the very abstract idea of a '[[category (mathematics)|category]]' &mdash; a subject then called 'general abstract nonsense'!|{{Harvard citations|last = Mac Lane|first = Saunders|year = 1997|txt=yes}}}}
{{quote|{{bracket|[[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.|{{Harvard citations|last = Monastyrsky|first = Michael|year = 2001|txt = yes}}}}
; [[canonical (mathematics)|canonical]]{{anchor|canonical}}:A reference to a standard or choice-free presentation of some [[mathematical object]] (e.g., canonical map, canonical form, or canonical ordering). The same term can also be used more informally to refer to something "standard" or "classic". For example, one might say that [[Euclid's Theorem#Euclid's proof|Euclid's proof]] is the "canonical proof" of [[Euclid's theorem|the infinitude of primes]].
{{quote|1=There are two canonical proofs that are always used to show non-mathematicians what a mathematical proof is like: {{unbulleted list|item_style=line-height:200%; padding-left:1em;|&mdash;The proof that there are infinitely many [[prime number]]s.|&mdash;The proof of the [[irrational number|irrationality]] of the [[square root of two]].}}|2={{Harvard citations|last = Wiedijk|first = Freek|year = 2006|txt = yes|loc = p.2}}}}
; deep{{anchor|deep}}:A result is called "deep" if its proof requires concepts and methods that are advanced beyond the concepts needed to formulate the result. For example, the [[prime number theorem]] — originally proved using techniques of [[complex analysis]] — was once thought to be a deep result until [[elementary proof]]s were found.<ref>{{Cite web|url=http://www.math.columbia.edu/~goldfeld/ErdosSelbergDispute.pdf|title=The Elementary Proof of the Prime Number Theorem: An Historical Perspective|last=Goldfeld|first=Dorian|website=Columbia University}}</ref> On the other hand, the fact that [[Pi|π]] is irrational is usually known to be a deep result, because it requires a considerable development of [[real analysis]] before the proof can be established — even though the claim itself can be stated in terms of simple [[number theory]] and [[geometry]].
; [[mathematical beauty|elegant]]{{anchor|elegant}}: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 by providing a technique of proof which is either particularly simple, or which captures the intuition or imagination as to why the result it proves is true. In some occasions, the term "beautiful" can also be used to the same effect, though [[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 [[theorem]]s or proofs are beautiful but may be written about inelegantly.
{{quote|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.<br/><br/>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....|{{Harvard citations|last = Rota|first = Gian-Carlo|year = 1977|loc1 = pp.173&ndash;174|loc2 = pp.181&ndash;182|txt = yes}}}}
; [[elementary proof|elementary]]{{anchor|elementary}}:A proof or a result is called "elementary" if it only involves basic concepts and methods in the field, and is to be contrasted with [[#deep|deep]] results which require more development within or outside the field. The concept of "elementary proof" is used specifically in [[number theory]], where it usually refers to a proof that does not resort to methods from [[complex analysis]].
; [[mathematical folklore|folklore]] {{anchor|folklore}}:A result is called "folklore" if it is non-obvious and non-published, yet 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.
{{quote|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.|{{Harvard citations |last=Impagliazzo |first=Russell |year=1995 |txt= yes}}}}
; [[natural transformation|natural]]{{anchor|natural}}:Similar to "canonical" but more specific, and which makes reference to a description (almost exclusively in the context of [[transformation (mathematics)|transformation]]s) which holds independently of any choices. Though long used informally, this term has found a formal definition in category theory.
; [[pathological (mathematics)|pathological]]{{anchor|pathological}}:An object behaves pathologically (or, somewhat more broadly used, in a ''degenerated'' way) if it either fails to conform to the generic behavior of such objects, fails to satisfy certain context-dependent regularity properties, or simply disobeys [[mathematical intuition]]. In many occasions, these can be and often are contradictory requirements, while in other occasions, the term is more deliberately used to refer to an object artificially constructed as a counterexample to these properties. A simple example is that from the definition of a [[triangle]] having [[angle]]s which sum to π radians, a single straight line conforms to this definition pathologically.
{{quote|Since half a century we have seen arise a crowd of bizarre [[function (mathematics)|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 general....to-day they are invented expressly to put at fault the reasonings of our fathers....|{{Harvard citations|last = Poincaré|first = Henri|year = 1913|txt = yes}}}}
{{quote|[The [[Dirichlet function]]] took on an enormous importance...as 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' function...is [[Weierstrass function|the one provided by Weierstrass]]....This function is [[continuous function|continuous]] but not [[differentiable function|differentiable]].|{{Harvard citations|last = Pinto|first = J. Sousa|year = 2004|txt = yes}}}}
:<!-- This paragraph seems off the tangent a bit. It might be better to put it inside a footnote or somewhere else. -->Note for that latter quote that as the differentiable functions are [[meagre set|meagre]] in the space of continuous functions, as [[Stefan Banach|Banach]] found out in 1931<!-- source: the WP article on meagre sets !-->, differentiable functions are colloquially speaking a rare exception among the continuous ones. Thus it can hardly be defended any-more to call non-differentiable continuous functions pathological.
; [[Rigour#Mathematical rigour|rigor (rigour)]]{{anchor|rigour}}: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.
; [[well-behaved]]{{anchor|well-behaved}}:An object is well-behaved (in contrast with being ''[[#pathological|Pathological]]'') if it satisfies certain prevailing regularity properties, or if it conforms to mathematical intuition (even though intuition can often suggest opposite behaviors as well). In some occasions (e.g., [[mathematical analysis|analysis]]), the term "[[List of mathematical jargon#smooth|smooth]]''"'' can also be used to the same effect.

==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 all]]{{anchor|almost all}}: A shorthand term for "all except for a [[set (mathematics)|set]] of [[measure zero]]", when there is a [[measure (mathematics)|measure]] to speak of.  For example, "almost all [[real number]]s are [[transcendental number|transcendental]]" because the [[algebraic numbers|algebraic real numbers]] form a [[countable]] [[subset]] of the real numbers with measure zero.  One can also speak of "almost all" [[integer]]s having a property to mean "all except finitely many", despite the integers not admitting a measure for which this agrees with the previous usage.  For example, "almost all prime numbers are [[parity (mathematics)|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]]{{anchor|arbitrarily large}}{{anchor|arbitrarily small}}{{anchor|arbitrarily close}}: Notions which arise mostly in the context of [[limit (mathematics)|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 {{nowrap|∀''x'' : ∃''y'' ≥ ''x'' : ''P''(''y'')}}.  See also ''frequently''. The statement that quantity ''f''(''x'') depending on ''x'' "can be made" arbitrarily large, corresponds to {{nowrap|∀''y'' : ∃''x'' : ''f''(''x'') ≥ ''y''}}.
; [[arbitrary]]{{anchor|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. Also much in general-language use among mathematicians: "Of course, this problem can be arbitrarily complicated".
; [[Eventually (mathematics)|eventually]]{{anchor|eventually}}:In the context of limits, this is shorthand meaning ''for sufficiently large arguments''; the relevant argument(s) are implicit in the context.  As an example, the function log(log(''x'')) ''eventually'' becomes larger than 100"; in this context, "eventually" means "for [[#sufficiently large|sufficiently large]] ''x''."
; [[Lift (mathematics)|factor through]]{{anchor|factor through}}<!-- This anchor is linked from [[Exact category]] -->: A term in [[category theory]] referring to composition of [[morphism]]s.  If for three [[Object (category theory)|objects]] ''A'', ''B'', and ''C'' a map <math>f \colon A \to C</math> can be written as a composition <math>f = h \circ g</math> with <math>g \colon A \to B</math> and <math>h \colon B \to C</math>, then ''f'' is said to ''factor through'' any (and all) of <math>B</math>, <math>g</math>, and <math>h</math>.
; finite{{anchor|finite}}: When said of the value of a variable assuming values from the non-negative [[extended reals]] <math>\R_{\geq 0}\cup\{\infty\},</math> the meaning is usually "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, possibly zero. In some contexts though, for example in "a small but finite amplitude", zero and infinitesimals are meant to be excluded. When said of the value of a variable assuming values from the extended natural numbers <math>\N\cup\{\infty\},</math> the meaning is simply "not infinite". When said of a set or a mathematical {{gli|object}} whose main component is a set, it means that the [[cardinality]] of the set is less than [[Aleph 0|<math>\aleph_0</math>]].
; frequently{{anchor|frequently}}: In the context of limits, this is shorthand for ''[[#arbitrarily large|arbitrarily large]] arguments'' and its relatives; as with ''eventually'', the intended variant is implicit.  As an example, the [[sequence]] <math>(-1)^n</math> is frequently in the [[interval (mathematics)|interval]] (1/2, 3/2), because there are arbitrarily large ''n'' for which the value of the sequence is in the interval. 
; formal, formally{{anchor|formal|formally|formal definition}}: Qualifies anything that is sufficiently precise to be translated straightforwardly in a [[formal system]]. For example. a [[formal proof]], a '''formal definition'''.
; [[Generic property|generic]]{{anchor|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 (set theory)|complement]] satisfies some (context-dependent) notion of smallness.  For example, a property which holds on a [[Dense set|dense]] '''G'''<sub>δ</sub> ([[intersection (set theory)|intersection]] of countably many [[open set]]s) 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 topology|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 general{{anchor|in general}}: In a descriptive context, this phrase introduces a simple characterization of a broad class of {{gli|object|objects}}, with an eye towards identifying a unifying principle.  This term introduces an "elegant" description which holds for "[[#arbitrary|arbitrary]]" objects.  Exceptions to this description may be mentioned explicitly, as "[[#pathological|pathological]]" cases.
{{quote|Norbert A'Campo of the University of Basel once asked Grothendieck about something related to the [[Platonic solid]]s.  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.|{{Harvard citations|last=Jackson|first = Allyn|year=2004|loc = p.1197|txt = yes}}}}
; [[Sides of an equation|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, <math>x = y + 1</math> has <math>x</math> on the LHS and <math>y + 1</math> on the RHS.  Occasionally, these are used in the sense of [[Value (computer science)#Assignment:_l-values_and_r-values|lvalue]] and rvalue: an RHS is primitive, and an LHS is derivative.
; nice{{anchor|nice}}: A mathematical {{gli|object}} is colloquially called ''nice'' or ''sufficiently nice'' if it satisfies hypotheses or properties, sometimes unspecified or even unknown, that are especially desirable in a given context. It is an informal antonym for [[Mathematical jargon#pathological|pathological]]. For example, one might conjecture that a [[differential operator]] ought to satisfy a certain boundedness condition "for nice test functions," or one might state that some interesting [[topological invariant]] should be computable "for nice [[topological space|spaces]] ''X''."
; [[Mathematical object|{{vanchor|object}}]]: Anything that can be assigned to a [[variable (mathematics)|variable]] and for which [[equality (mathematics)|equality]] with another object can be considered. The term was coined when variables began to be used for [[set (mathematics)|set]]s and [[mathematical structure]]s.
; onto{{anchor|onto}}: A function (which in mathematics is generally defined as mapping the elements of one set ''A'' to elements of another ''B'') is called "''A'' onto ''B''" (instead of "''A'' to ''B''" or "''A'' into ''B''") only if it is [[surjective]]; it may even be said that "''f'' is onto" (i. e. surjective). Not translatable (without circumlocutions) to some languages other than English.
; proper{{anchor|proper}}: If, for some notion of substructure, {{gli|object|objects}} are substructures of themselves (that is, the relationship is [[reflexive relation|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 [[Operator overloading|overloaded]] word is also non-jargon for a [[proper morphism]].
; regular {{anchor|regular}}: A function is called ''regular'' if it satisfies satisfactory continuity and differentiability properties, which are often context-dependent. These properties might include possessing a specified number of [[derivative]]s, with the function and its derivatives exhibiting some ''nice'' property (see ''nice'' above), such as [[Hölder continuity]]. Informally, this term is sometimes used synonymously with ''smooth'', below. These imprecise uses of the word ''regular'' are not to be confused with the notion of a [[Regular space|regular topological space]], which is rigorously defined.
; 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''. For example, [[square]]s (resp. triangles) have 4 sides (resp. 3 sides); or [[compact space|compact]] (resp. [[Lindelöf space|Lindelöf]]) spaces are ones where every open [[cover (topology)|cover]] has a finite (resp. countable) open subcover.
; sharp{{anchor|sharp}}: Often, a mathematical theorem will establish constraints on the behavior of some {{gli|object}}; for example, a function will be shown to have an [[Upper and lower bounds|upper or lower bound]].  The constraint is ''sharp'' (sometimes ''optimal'') if it cannot be made more restrictive without failing in some cases. For example, for [[#arbitrary|arbitrary]] non-negative real numbers ''x'', the [[exponential function]] ''e<sup>x</sup>'', where [[Euler's number|''e'']]&nbsp;=&nbsp;2.7182818..., gives an upper bound on the values of the [[quadratic function]] ''x''<sup>2</sup>. This is not sharp; the gap between the functions is everywhere at least 1. Among the exponential functions of the form α<sup>''x''</sup>, setting α&nbsp;=&nbsp;''e''<sup>2/''e''</sup>&nbsp;= 2.0870652... results in a sharp upper bound; the slightly smaller choice α&nbsp;=&nbsp;2 fails to produce an upper bound, since then α<sup>3</sup>&nbsp;= 8&nbsp;<&nbsp;3<sup>2</sup>. In applied fields the word "tight" is often used with the same meaning.<ref>{{cite book|last=Boyd|first=Stephen|title=Convex Optimization|year=2004|publisher=Cambridge University Press|isbn=978-0521833783}}</ref> 
; [[smooth function|smooth]]{{anchor|smooth}}: ''Smoothness'' is a concept which mathematics has endowed with many meanings, from simple differentiability to infinite differentiability to [[analytic function|analyticity]], and still others which are more complicated.  Each such usage attempts to invoke the physically intuitive notion of smoothness.
; strong, stronger{{anchor|strong|stronger}}<!-- This anchor is linked from [[Intransitivity]] -->: 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 but not conversely. An example is the sequence of theorems: [[Fermat's little theorem]], [[Euler's theorem]], [[Lagrange's theorem (group theory)|Lagrange's theorem]], each of which is stronger than the last; another is that a sharp upper bound (see ''sharp'' 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 close{{anchor|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, downstairs{{anchor|upstairs|downstairs}}: A descriptive term referring to notation in which two {{gli|object|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 [[fraction|numerator]] is occasionally referred to as ''upstairs'' and the [[fraction|denominator]] ''downstairs'', as in "bringing a term upstairs".
; [[up to]], modulo, mod out by{{anchor|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. Also used when working with members of [[equivalence classes]], especially in [[category theory]], where the [[equivalence relation]] is (categorical) isomorphism; for example, "The tensor product in a weak [[monoidal category]] is associative and unital up to a [[natural isomorphism]]."
; vanish{{anchor|vanish}}: To assume the value 0. For example, "The function sin(''x'') vanishes for those values of ''x'' that are integer multiples of π." This can also apply to limits: see [[Vanish at infinity]].
; weak, weaker{{anchor|weak|weaker}}: The converse of [[Mathematical jargon#strong|strong]].
; well-defined{{anchor|well-defined}}: Accurately and precisely described or specified. For example, sometimes a definition relies on a choice of some {{gli|object}}; the result of the definition must then be independent of this choice.

==Proof terminology==
The formal language of [[mathematical proof|proof]] draws repeatedly from a small pool of ideas, many of which are invoked through various lexical shorthands in practice.
; aliter{{anchor|aliter}}: 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.
; [[proof by contradiction|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.
; [[Iff#More general usage|if and only if]] (iff){{anchor|if and only if|iff}}: An abbreviation for [[logical equivalence]] of statements.
; in general{{anchor|in general}}<!-- [[In general]] redirects here -->: In the context of proofs, this phrase is often seen in [[mathematical induction|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 sufficient]]{{anchor|necessary and sufficient}}: A minor variant on "if and only if"; "''A'' is ''necessary'' (''and sufficient'') for ''B''" means "''A'' if (only if) ''B''".  For example, "For a [[field (mathematics)|field]] ''K'' to be [[algebraically closed field|algebraically closed]] it is necessary and sufficient that it have no finite [[field extension]]s" 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 one]]{{anchor|one and only one}}: A statement of the [[uniqueness quantification|existence and uniqueness]] of an {{gli|object}}; the object exists, and furthermore, no other such object exists.
; [[Q.E.D.]]{{anchor|Q.E.D.}}: (''Quod erat demonstrandum''): A Latin abbreviation, meaning "which was to be demonstrated", historically placed at the end of proofs, but less common currently, having been supplanted by the [[Tombstone (typography)|Halmos end-of-proof mark]], a square sign ∎.
; sufficiently nice{{anchor|sufficiently nice}}: A condition on {{gli|object|objects}} in the scope of the discussion, to be specified later, that will guarantee that some stated property holds for them. When [[heuristics|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.
; the following are equivalent (TFAE){{anchor|the following are equivalent|TFAE}}<!-- [[TFAE]] redirects here -->: 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.
; [[transport of structure]]{{anchor|transport of structure}}: It is often the case that two {{gli|object|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 space]]s of the same [[dimension (vector space)|dimension]] are [[linear isomorphism|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.
{{quote|1=Let ''V'' be a finite-dimensional vector space over ''k''....Let (''e''<sub>''i''</sub>)<sub>1≤ ''i'' ≤ ''n''</sub> be a [[basis (linear algebra)|basis]] for ''V''....There is an isomorphism of the [[polynomial algebra]] ''k''[''T''<sub>''ij''</sub>]<sub>1≤ ''i'', ''j'' ≤ ''n''</sub> onto the [[algebra over a field|algebra]] Sym<sub>''k''</sub>(''V''&nbsp;&otimes;&nbsp;''V''<sup>*</sup>)....It extends to an isomorphism of ''k''['''GL'''<sub>''n''</sub>] to the localized algebra Sym<sub>''k''</sub>(''V''&nbsp;&otimes;&nbsp;''V''<sup>*</sup>)<sub>''D''</sub>, where ''D''&nbsp;=&nbsp;det(''e''<sub>''i''</sub>&nbsp;&otimes;&nbsp;''e''<sub>''j''</sub><sup>*</sup>)....We write ''k''['''GL'''(''V'')] for this last algebra.  By transport of structure, we obtain a [[linear algebraic group]] '''GL'''(''V'') isomorphic to '''GL'''<sub>''n''</sub>.|2={{Harvard citations|last = Shafarevich|first = Igor|year = 1991|loc = p.12|txt = yes}}}}
; [[Without loss of generality|without (any) loss of generality]] (WLOG, WOLOG, WALOG), we may assume (WMA){{anchor|WLOG|WOLOG|WALOG|we may assume|WMA}}: Sometimes a [[proposition (mathematics)|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.

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

; angle chasing{{anchor|angle chasing}}: Used to describe a geometrical proof that involves finding relationships between the various angles in a diagram.<ref>{{Citation |title=Elementary Geometry|first=John|last=Roe
|publisher=Oxford science publications|year=1993|isbn=978-0-19-853456-3|page=119}}</ref>
; [[back-of-the-envelope calculation]]{{anchor|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.
; brute force{{anchor|brute force}}: 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]]).
; by example{{anchor|by example}}: 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.
; by inspection{{anchor|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. If an expression can be evaluated by straightforward application of simple techniques and without recourse to extended calculation or general theory, then it can be evaluated ''by inspection''. It is also applied to solving equations; for example to find roots of a [[quadratic equation]] by inspection is to 'notice' them, or mentally check them. 'By inspection' can play a kind of ''[[wikt:gestalt|gestalt]]'' role: the answer or solution simply clicks into place.
; [[proof by intimidation|by intimidation]]{{anchor|by intimidation}}: 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.
; clearly, can be easily shown{{anchor|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; [[Pierre Laplace|Laplace]] used ''obvious'' ([[French language|French]]: ''évident'').
; complete intuition {{anchor|complete intuition}}: commonly reserved for jokes (puns on [[complete induction]]).
; [[diagram chasing]]{{anchor|diagram chasing|diagram chase}}:<ref>Numerous examples can be found in {{Harvard citations|last = Mac Lane|year = 1998}}, for example on p. 100.</ref> 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 [[element (category theory)|element]]s, 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''.
; [[handwaving]]{{anchor|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.
; in general{{anchor|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.
; index battle{{anchor|index battle}}: 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.
; morally true{{anchor|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.  [[Helmut Hasse|Hasse]]'s [[local-global principle]] is a particularly influential example of this.{{Citation needed|date=April 2010}}
; obviously{{anchor|obviously}}: See ''[[#clearly|clearly]]''.
; the proof is left as an exercise to the reader: Usually applied to a claim within a larger proof when the proof of that claim can be produced routinely by any member of the audience with the necessary expertise, but is not so simple as to be ''obvious''.
; [[trivial (mathematics)|trivial]]{{anchor|trivial}}: Similar to ''clearly''.  A concept is trivial if it holds by definition, is an immediate [[corollary]] to a known statement, or is a simple special case of a more general concept.

==Miscellaneous==
This section features terms used across different areas in [[mathematics]], or terms that do not typically appear in more specialized glossaries. For the terms used only in some specific areas of mathematics, see glossaries in [[:Category:Glossaries of mathematics]].

===B===
{{glossary}}
{{term|1=binary}}
{{defn|1=A [[binary relation]] is a set of ordered pairs; an element x is said to be related to another element y if and only if (x,y) are in the set.}}
{{glossary end}}

===C===
{{glossary}}
{{term|1=canonical}}
{{defn|no=1|A [[canonical map]] is a map or morphism between objects that arises naturally from the definition or the construction of the objects being mapped against each other.}}
{{defn|no=2|A [[canonical form]] of an object is some standard or universal way to express the object.}}

{{term|1=correspondence}}
{{defn|1=A [[binary relation|correspondence]] from a set <math>A</math> to a set <math>B</math> is a subset of a Cartesian product <math>A \times B</math>; in other words, it is a binary relation but with the specification of the ambient sets <math>A, B</math> used in the definition.
}}
{{glossary end}}

===D===
{{glossary}}
{{term|1=diagram}}
{{defn|1=See [[mathematical diagram]].}}
{{glossary end}}

===F===
{{glossary}}
{{term|1=function}}
{{defn|1=A [[function (mathematics)|function]] <math>f: A \to B</math> is an ordered triple <math>(A, B, f)</math> consisting of sets <math>A, B</math> and a subset <math>f</math> of the Cartesian product <math>A \times B</math> subject to the condition <math>(a, b), (a, b') \in f</math> implies <math>b = b'</math>. In other words, it is a special kind of [[binary relation|correspondence]] where given an element <math>a</math> of <math>A</math>, there is a unique element <math>b</math> of <math>B</math> that corresponds to it.}}
{{term|2=fundamental}}
{{Main|List of theorems called fundamental}}
{{defn|The word fundamental is used to describe a theorem with a given area of mathematics considered to be the most central theorem of that particular area (e.g. [[Fundamental Theorem of Arithmetic]] for [[Arithmetic]]).}}
{{glossary end}}

===I===
{{glossary}}
{{term|1=invariant}}
{{defn|1=An [[invariant (mathematics)|invariant]] of an object or a space is a property or number of the object or a space that remains unchanged under some transformations.}}
{{glossary end}}

===M===
{{glossary}}
{{term|1=map}}
{{defn|1=A synonym for a [[function (mathematics)|function]] between sets or a [[morphism]] in a category. Depending on authors, the term "maps" 
or the term "functions" may be reserved for specific kinds of functions or morphisms (e.g., function as an analytic term and map as a general term).}}

{{term|1=mathematics}}
{{defn|1=See [[mathematics]].}}

{{term|1=multivalued}}
{{defn|1=A "[[multivalued function]]” from a set {{mvar|A}} to a set {{mvar|B}} is a function from {{mvar|A}} to the subsets of {{mvar|B}}. It has typically the property that, for almost all points {{mvar|x}} of {{mvar|B}}, there is a neighbourhood of {{mvar|x}} such that the restriction of the function to the neighbourhood can be considered as a set of functions from the neighbourhood to {{mvar|B}}.}}
{{glossary end}}

===P===
{{glossary}}
{{term|1=projection}}
{{defn|1=A [[projection (mathematics)|projection]] is, roughly, a map from some space or object to another that omits some information on the object or space. For example, <math>\mathbb{R}^2 \to \mathbb{R}, (x, y) \mapsto x</math> is a projection and its restriction to a graph of a function, say, is also a projection. The terms “[[idempotent operator]]” and “[[forgetful map]]” are also synonyms for a projection.}}
{{glossary end}}

===S===
{{glossary}}
{{term|1=structure}}
{{defn|1=A [[mathematical structure]] on an object is an additional set of objects or data attached to the object (e.g., relation, operation, metric, topology).}}
{{glossary end}}

==See also==
*[[Glossary of areas of mathematics]]
*[[List of mathematical constants]]
*[[List of mathematical symbols]]
*[[:Category:Mathematical terminology]]

==Notes==
<references/>

==References==
*{{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
| issue = 12
| pages = 537&ndash;543
| doi = 10.1073/pnas.28.12.537
| pmid = 16588584
| pmc = 1078535
| bibcode = 1942PNAS...28..537E
| doi-access = free
}}.
* {{citation
| last = Impagliazzo
| first = Russell
| author-link = Russell Impagliazzo
| chapter = A personal view of average-case complexity
| year = 1995
| title = Proc. Tenth Annual Structure in Complexity Theory Conference (SCT'95)
| pages = 134&ndash;147
| doi = 10.1109/SCT.1995.514853
| isbn = 978-0-8186-7052-7
| citeseerx = 10.1.1.678.8930
| s2cid = 2154064
}}.
* {{citation
| last = Jackson
| first = Allyn
| year = 2004
| journal = AMS Notices
| volume = 51
| title = Comme Appelé du Néant &mdash; As If Summoned from the Void: The Life of Alexandre Grothendieck
| issue = 9,10
}} (Parts [https://www.ams.org/notices/200409/fea-grothendieck-part1.pdf I] and [https://www.ams.org/notices/200410/fea-grothendieck-part2.pdf II]).
*{{citation
| last1 = Mac Lane
| first1 = Saunders
| author1-link = Saunders Mac Lane
| title = The PNAS way back then
| year = 1997
| pages = 5983&ndash;5985
| volume = 94
| journal = Proc. Natl. Acad. Sci. USA
| url = http://www.pnas.org/cgi/reprint/94/12/5983.pdf
| doi = 10.1073/pnas.94.12.5983
| issue=12
| pmid = 9177152
| pmc = 33670
| bibcode = 1997PNAS...94.5983M
| doi-access = free
}}.
*{{citation
| last = Mac Lane
| first = Saunders
| author-link = Saunders Mac Lane
| title = Categories for the Working Mathematician
| publisher = Springer
| year = 1998
}}.
*{{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 = 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 = https://books.google.com/books?id=bLbfhYrhyJUC&pg=PA246
| isbn = 978-1-898563-99-0
}}.
*{{citation
| last1 = Poincare
| first1 = Henri
| author1-link = Henri Poincaré
| title = The Foundations of Science
| year = 1913
| page = 435
| editor1-last = Halsted
| editor1-first = Bruce
| publisher = The Science Press
| url = https://books.google.com/books?id=WxLJzL4e4wsC
}}.
* {{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&ndash;182
| issn = 0039-7857
| doi = 10.1023/A:1004930722234
| s2cid = 44064821
}}.
*{{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
| title = The Seventeen Provers of the World
| editor-last = Wiedijk
| editor-first = Freek
| year = 2006
| publisher = Birkhäuser
| isbn = 978-3-540-30704-4
| url-access = registration
| url = https://archive.org/details/seventeenprovers00free
}}.

==Bibliography==
*''[[Encyclopedia of Mathematics]]''

[[Category:Mathematical terminology| Jargon]]
[[Category:Glossaries of mathematics| ]]
[[Category:Wikipedia glossaries using description lists]]