Triviality (mathematics)

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In mathematics, the adjective trivial is frequently used for objects (for example, groups or topological spaces) that have a very simple structure. The noun triviality usually refers to a simple technical aspect of some proof or definition. The origin of the term in mathematical language comes from the medieval trivium curriculum. The antonym nontrivial is commonly used by engineers and mathematicians to indicate a statement or theorem that is not obvious or easy to prove.

Trivial and nontrivial solutions[edit]

In mathematics, the term trivial is frequently used for objects (for examples, groups or topological spaces) that have a very simple structure. For non-mathematicians, they are sometimes more difficult to visualize or understand than other, more complicated objects.[citation needed]

Examples include:

Trivial also refers to solutions to an equation that has a very simple structure, but for the sake of completeness cannot be omitted. These solutions are called the trivial solution. For example, consider the differential equation

y'=y

where y = f(x) is a function whose derivative is y′. The trivial solution is

y = 0, the zero function

while a nontrivial solution is

y (x) = ex, the exponential function.

The differential equation f''(x)=-\lambda f(x) with boundary conditions f(0) = f(L) = 0 is important in math and physics, for example describing a particle in a box in quantum mechanics, or standing waves on a string. It always has the solution f(x) = 0. This solution is considered obvious and is called the "trivial" solution. In some cases, there may be other solutions (sinusoids), which are called "nontrivial".[1]

Similarly, mathematicians often describe Fermat's Last Theorem as asserting that there are no nontrivial integer solutions to the equation a^n + b^n = c^n when n is greater than 2. Clearly, there are some solutions to the equation. For example, a=b=c=0 is a solution for any n, but such solutions are all obvious and uninteresting, and hence "trivial".

Triviality in mathematical reasoning[edit]

Trivial may also refer to any easy case of a proof, which for the sake of completeness cannot be ignored. For instance, proofs by mathematical induction have two parts: the "base case" that shows that the theorem is true for a particular initial value such as n = 0 or n = 1 and then an inductive step that shows that if the theorem is true for a certain value of n, it is also true for the value n + 1. The base case is often trivial and is identified as such, although there are cases where the base case is difficult but the inductive step is trivial. Similarly, one might want to prove that some property is possessed by all the members of a certain set. The main part of the proof will consider the case of a nonempty set, and examine the members in detail; in the case where the set is empty, the property is trivially possessed by all the members, since there are none. (See also Vacuous truth.)

A common joke in the mathematical community is to say that "trivial" is synonymous with "proved" — that is, any theorem can be considered "trivial" once it is known to be true. Another joke concerns two mathematicians who are discussing a theorem; the first mathematician says that the theorem is "trivial". In response to the other's request for an explanation, he then proceeds with twenty minutes of exposition. At the end of the explanation, the second mathematician agrees that the theorem is trivial. These jokes point out the subjectivity of judgments about triviality. The joke also applies when the first mathematician says the theorem is trivial, but is unable to prove it himself. Often, as a joke, the theorem is then referred to as "intuitively obvious." Someone experienced in calculus, for example, would consider the statement that

\int_0^1 x^2\, dx = \frac{1}{3}

to be trivial. To a beginning student of calculus, though, this may not be obvious at all.

Triviality also depends on context. A proof in functional analysis would probably, given a number, trivially assume the existence of a larger number. When proving basic results about the natural numbers in elementary number theory though, the proof may very well hinge on the remark that any natural number has a successor (which should then in itself be proved or taken as an axiom, see Peano's axioms).

Trivial proofs[edit]

In some texts, a trivial proof refers to a statement involving a material implication where the consequent, or Q, in PQ, is always true.[2] Here, the proof follows simply from noting that Q is always true, as the implication is then true regardless of the truth value of the antecedent, P.[2]

A related concept is a vacuous proof, where the antecedent, P, in the material implication PQ is always false.[2] Here, the implication is always true regardless of the truth value of the consequent, Q.[2]

Examples[edit]

  • In mathematics, it is often important to find factors of an integer number N. Any number N has four obvious factors: ±1 and ±N. These are called "trivial factors". Any other factor, if any exist, would be called "nontrivial".[3]
  • The matrix equation AX=0, where A is a fixed matrix, X is an unknown vector, and 0 is the zero vector, has an obvious solution X=0. This is called the "trivial solution". If it has other solutions X≠0, they would be called "nontrivial"[4]
  • In the mathematics of group theory, there is a very simple group with just one element in it; this is often called the "trivial group". All other groups, which are more complicated, are called "nontrivial".
  • In the graph theory the trivial graph is a graph which has only 1 vertex and no edges.
  • Database theory has a concept called functional dependency, written  X \to Y . It is obvious that the dependence  X \to Y is true if Y is a subset of X, so this type of dependence is called "trivial". All other dependences, which are less obvious, are called "nontrivial".

See also[edit]

References[edit]

  1. ^ Introduction to partial differential equations with applications, by Zachmanoglou and Thoe, p309
  2. ^ a b c d Zhang, Gary Chartrand, Albert D. Polimeni, Ping (2008). Mathematical proofs : a transition to advanced mathematics (2nd ed. ed.). Boston: Pearson/Addison Wesley. p. 68. ISBN 978-0-3-2139053-0. 
  3. ^ Number theory for computing, by Song Y. Yan, p250
  4. ^ Mathematics for engineers and scientists, by Alan Jeffrey, p502

External links[edit]