You do not have permission to edit this page, for the following reasons:

This IP address has been blocked from editing Wikipedia.
This does not affect your ability to read Wikipedia pages.
Most people who see this message have done nothing wrong. Some kinds of blocks restrict editing from specific service providers or telecom companies in response to recent abuse or vandalism, and can sometimes affect other users who are unrelated to that abuse. Review the information below for assistance if you do not believe that you have done anything wrong.

The IP address or range 44.201.0.0/16 has been blocked (disabled) by ‪ST47‬ for the following reason(s):

The IP address that you are currently using has been blocked because it is believed to be a web host provider. To prevent abuse, web hosts may be blocked from editing Wikipedia.
You will not be able to edit Wikipedia using a web host provider because it hides your IP address, much like a proxy or VPN.
We recommend that you attempt to use another connection to edit. For example, if you use a proxy or VPN to connect to the internet, turn it off when editing Wikipedia. If you edit using a mobile connection, try using a Wi-Fi connection, and vice versa. If you are using a corporate internet connection, switch to a different Wi-Fi network. If you have a Wikipedia account, please log in.
If you do not have any other way to edit Wikipedia, you will need to request an IP block exemption.

How to appeal if you are confident that your connection does not use a web host's IP address:
If you are confident that you are not using a web host, you may appeal this block by adding the following text on your talk page: ((unblock|reason=Caught by a web host block but this host or IP is not a web host. My IP address is _______. Place any further information here. ~~~~)). You must fill in the blank with your IP address for this block to be investigated. Your IP address can be determined here. Alternatively, if you wish to keep your IP address private you can use the unblock ticket request system. There are several reasons you might be editing using the IP address of a web host (such as if you are using VPN software or a business network); please use this method of appeal only if you think your IP address is in fact not a web host.

Administrators: The IP block exemption user right should only be applied to allow users to edit using web host in exceptional circumstances, and they should usually be directed to the functionaries team via email. If you intend to give the IPBE user right, a CheckUser needs to take a look at the account. This can be requested most easily at SPI Quick Checkuser Requests. Unblocking an IP or IP range with this template is highly discouraged without at least contacting the blocking administrator.

This block will expire on 23:54, 31 July 2024.

Even when blocked, you will usually still be able to edit your user talk page, as well as email administrators and other editors.

For information on how to proceed, please read the FAQ for blocked users and the guideline on block appeals. The guide to appealing blocks may also be helpful.

Other useful links: Blocking policy · Help:I have been blocked
Your IP address is in a range that has been blocked on all Wikimedia Foundation wikis. The block was made by ‪AntiCompositeNumber‬. The reason given is Open proxy/Webhost: Visit the FAQ if you are affected .
- Start of block: 13:55, 18 August 2022
- Expiry of block: 13:55, 18 April 2025
Your current IP address is 44.201.28.123. The blocked range is 44.201.0.0/16. Please include all above details in any queries you make. If you believe you were blocked by mistake, you can find additional information and instructions in the No open proxies global policy. Otherwise, to discuss the block please post a request for review on Meta-Wiki. You could also send an email to the stewards VRT queue at stewards@wikimedia.org including all above details.

You can view and copy the source of this page:

((short description|Mathematically obvious))
In [[mathematics]], the adjective '''trivial''' is often used to refer to a claim or a case which can be readily obtained from context, or an object which possesses a simple structure (e.g., [[group (mathematics)|group]]s, [[topological space]]s).<ref name=":1">((Cite web|url=http://mathworld.wolfram.com/Trivial.html|title=Trivial|last=Weisstein|first=Eric W.| website=mathworld.wolfram.com| language=en|access-date=2019-12-14))</ref><ref name=":2">((Cite web| url=https://www.mathwords.com/t/trivial.htm|title=Mathwords: Trivial|website=www.mathwords.com|access-date=2019-12-14))</ref> 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 (education)|trivium]] curriculum, which distinguishes from the more difficult [[quadrivium]] curriculum.<ref name=":1" /><ref>((Cite book|title=Dictionary of word origins|last=Ayto|first=John|date=1990|publisher=University of Texas Press| isbn=1-55970-214-1|pages=542|oclc=33022699))</ref> The opposite of trivial is '''nontrivial''', which is commonly used to indicate that an example or a solution is not simple, or that a statement or a theorem is not easy to prove.<ref name=":2" />

The judgement of whether a situation under consideration is trivial or not depends on who considers it since the situation is obviously true for someone who has sufficient knowledge or experience of it while to someone who has never seen this, it may be even hard to be understood so not trivial at all. And there can be an argument about how quickly and easily a problem should be recognized for the problem to be treated as trivial. So, triviality is not a universally agreed property in mathematics and logic.

==Trivial and nontrivial solutions==
<!-- [[Trivial solution]] redirects here -->

In mathematics, the term "trivial" is often used to refer to objects (e.g., groups, topological spaces) with a very simple structure. These include, among others:

*[[Empty set]]: the [[Set (mathematics)|set]] containing no or null members
*[[Trivial group]]: the mathematical [[group (mathematics)|group]] containing only the [[identity element]]
*[[Trivial ring]]: a [[ring (mathematics)|ring]] defined on a [[singleton set]]

''"''Trivial''"'' can also be used to describe solutions to an [[equation]] that have a very simple structure, but for the sake of completeness cannot be omitted. These solutions are called the '''trivial solutions'''. For example, consider the [[differential equation]]

<math display="block">y'=y</math>

where <math>y = y(x)</math> is a [[function (mathematics)|function]] whose [[derivative]] is <math>y'</math>. The trivial solution is the [[0 (number)#Related mathematical terms|zero function]]

<math display="block">y(x) = 0</math>

while a '''nontrivial''' solution is the [[exponential function]]

<math display="block">y(x) = e^x .</math>

The differential equation <math>f''(x) = -\lambda f(x)</math> with boundary conditions <math>f(0) = f(L) = 0</math> is important in mathematics and physics, as it could be used to describe a [[particle in a box]] in quantum mechanics, or a [[standing wave]] on a string. It always includes the solution <math>f(x) = 0</math>, which is considered obvious and hence is called the "trivial" solution. In some cases, there may be other solutions ([[Sine wave|sinusoid]]s), which are called "nontrivial" solutions.<ref>((cite book |first=E. C. |last=Zachmanoglou |first2=Dale W. |last2=Thoe |title=Introduction to Partial Differential Equations with Applications |year=1986 |isbn= 9780486652511|page=309 |url=https://books.google.com/books?id=YRT0W31HbTwC&pg=PA309 ))</ref>

Similarly, mathematicians often describe [[Fermat's last theorem]] as asserting that there are no ''nontrivial'' integer solutions to the equation <math>a^n + b^n = c^n</math>, where ''n'' is greater than 2. Clearly, there are some solutions to the equation. For example, <math>a = b = c = 0</math> is a solution for any ''n'', but such solutions are obvious and obtainable with little effort, and hence "trivial".

==In mathematical reasoning==
''Trivial'' may also refer to any easy [[Proof by exhaustion|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" which shows that the theorem is true for a particular initial value (such as ''n'' = 0 or ''n'' = 1), and the inductive step which shows that if the theorem is true for a certain value of ''n'', then it is also true for the value ''n'' + 1. The base case is often trivial and is identified as such, although there are situations 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 of the empty set, since there are none (see [[vacuous truth]] for more).

The judgement of whether a situation under consideration is trivial or not depends on who considers it since the situation is obviously true for someone who has sufficient knowledge or experience of it while to someone who has never seen this, it may be even hard to be understood so not trivial at all. And there can be an argument about how quickly and easily a problem should be recognized for the problem to be treated as trivial. The following examples show the subjectivity and ambiguity of the triviality judgement.

Triviality also depends on context. A proof in [[functional analysis]] would probably, given a number, trivially assume the existence of a larger number. However, when proving basic results about the natural numbers in [[elementary number theory]], the proof may very well hinge on the remark that any natural number has a successor – a statement which should itself be proved or be taken as an [[axiom]] so is not trivial (for more, see [[Peano's axioms]]).

=== Trivial proofs ===
In some texts, a ''trivial proof'' refers to a statement involving a [[Material implication (rule of inference)|material implication]] ''P''→''Q,'' where the [[consequent]] ''Q'', is always true.<ref name="Chartrand">((cite book| first1=Gary| last1=Chartrand| author1-link=Gary Chartrand|first2=Albert D.|last2=Polimeni|last3=Zhang|first3=Ping|author3-link=Ping Zhang (graph theorist)| title=Mathematical proofs: a transition to advanced mathematics|url=https://archive.org/details/mathematicalproo00char| url-access=limited| year=2008| publisher=Pearson/Addison Wesley| location=Boston| isbn=978-0-3-2139053-0| page=[https://archive.org/details/mathematicalproo00char/page/n43 68]| edition=2nd))</ref> Here, the proof follows immediately by virtue of the definition of material implication in which as the implication is true regardless of the truth value of the [[antecedent (logic)|antecedent]] ''P'' if the consequent is fixed as true.<ref name="Chartrand" />

A related concept is a [[vacuous truth]], where the antecedent ''P'' in a material implication ''P''→''Q'' is false.<ref name="Chartrand" /> In this case, the implication is always true regardless of the truth value of the consequent ''Q'' – again by virtue of the definition of material implication.<ref name="Chartrand" />

== Criticism ==
((Further|Proof by intimidation))((More citations needed|date=January 2023))
* 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 proved as true.<ref name=":1" />
* 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. But can we say that this theorem is trivial even if it takes a lot of time and effort to prove it?
* When a mathematician says that a theorem is trivial, but he is unable to prove it by himself at the moment that he says it as trivial. Then is the theorem trivial?
* Often, as a joke, a problem is referred to as "intuitively obvious". For example, someone experienced in [[calculus]] would consider the following statement trivial:<math display="block">\int_0^1 x^2\, dx = \frac{1}{3}.</math>However, to someone with no knowledge of integral calculus, this is not obvious at all so is not trivial.

== Examples ==
*In [[number theory]], it is often important to find [[divisor|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 it exists, would be called "nontrivial".<ref>((cite book |first=Song Y. |last=Yan |title=Number Theory for Computing |location=Berlin |publisher=Springer |edition=2nd, illustrated |year=2002 |isbn=3-540-43072-5 |page=250 |url=https://books.google.com/books?id=lIvPz7k41SEC&pg=PA250 ))</ref>
*The homogeneous [[matrix (mathematics)|matrix]] equation <math>A\mathbf{x}=\mathbf{0}</math>, where <math>A</math> is a fixed matrix, <math>\mathbf{x}</math> is an unknown vector, and <math>\mathbf{0}</math> is the zero vector, has an obvious solution <math>\mathbf{x}=\mathbf{0}</math>. This is called the "trivial solution". Any other solutions, with <math>\mathbf{x}\neq\mathbf{0}</math>, are called "nontrivial".<ref>((cite book |first=Alan |last=Jeffrey |title=Mathematics for Engineers and Scientists |publisher=CRC Press |edition=Sixth |year=2004 |isbn=1-58488-488-6 |page=502 |url=https://books.google.com/books?id=KWAqz3m2xYUC&pg=PA502 ))</ref>
*In [[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 [[graph theory]], the trivial graph is a graph which has only 1 vertex and no edge.
*[[Database theory]] has a concept called [[functional dependency]], written <math> X \to Y </math>. The dependence <math> X \to Y </math> 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".
* It can be shown that [[Riemann zeta function|Riemann's zeta function]] has zeros at the negative even numbers −2, −4, … Though the proof is comparatively easy, this result would still not normally be called trivial; however, it is in this case, for its ''other'' zeros are generally unknown and have important applications and involve open questions (such as the [[Riemann hypothesis]]). Accordingly, the negative even numbers are called the trivial zeros of the function, while any other zeros are considered to be non-trivial.

== See also ==
* [[Degeneracy (mathematics)|Degeneracy]]
* [[Initial and terminal objects]]
*[[List of mathematical jargon]]
* [[Pathological (mathematics)|Pathological]]
* [[Trivialism]]
*[[Trivial measure]]
*[[Trivial representation]]
*[[Trivial topology]]

== References ==
((Reflist))

==External links==
((wiktionary|trivial))
*[http://mathworld.wolfram.com/Trivial.html Trivial entry at MathWorld]

((DEFAULTSORT:Trivial (Mathematics)))
[[Category:Mathematical terminology]]

Pages transcluded onto the current version of this page (help):

Triviality (mathematics) (edit)
Template:Ambox (view source) (template editor protected)
Template:Cite book (view source) (protected)
Template:Cite web (view source) (protected)
Template:Find sources mainspace (view source) (template editor protected)
Template:Further (view source) (template editor protected)
Template:Main other (view source) (protected)
Template:More citations needed (view source) (template editor protected)
Template:Pagetype (view source) (protected)
Template:Plainlist/styles.css (view source) (protected)
Template:Reflist (view source) (protected)
Template:Reflist/styles.css (view source) (protected)
Template:SDcat (view source) (protected)
Template:Short description (view source) (protected)
Template:Short description/lowercasecheck (view source) (protected)
Template:Side box (view source) (template editor protected)
Template:Sister project (view source) (template editor protected)
Template:Wiktionary (view source) (template editor protected)
Module:Arguments (view source) (protected)
Module:Category handler (view source) (protected)
Module:Category handler/blacklist (view source) (protected)
Module:Category handler/config (view source) (protected)
Module:Category handler/data (view source) (protected)
Module:Category handler/shared (view source) (protected)
Module:Check for unknown parameters (view source) (protected)
Module:Citation/CS1 (view source) (protected)
Module:Citation/CS1/COinS (view source) (protected)
Module:Citation/CS1/Configuration (view source) (protected)
Module:Citation/CS1/Date validation (view source) (protected)
Module:Citation/CS1/Identifiers (view source) (protected)
Module:Citation/CS1/Utilities (view source) (protected)
Module:Citation/CS1/Whitelist (view source) (protected)
Module:Citation/CS1/styles.css (view source) (protected)
Module:Disambiguation/templates (view source) (protected)
Module:Find sources (view source) (template editor protected)
Module:Find sources/config (view source) (template editor protected)
Module:Find sources/links (view source) (template editor protected)
Module:Find sources/templates/Find sources mainspace (view source) (template editor protected)
Module:Format link (view source) (template editor protected)
Module:Hatnote (view source) (template editor protected)
Module:Hatnote/styles.css (view source) (template editor protected)
Module:Hatnote list (view source) (template editor protected)
Module:Labelled list hatnote (view source) (template editor protected)
Module:Message box (view source) (protected)
Module:Message box/ambox.css (view source) (protected)
Module:Message box/configuration (view source) (protected)
Module:Namespace detect/config (view source) (protected)
Module:Namespace detect/data (view source) (protected)
Module:Pagetype (view source) (protected)
Module:Pagetype/config (view source) (protected)
Module:Pagetype/disambiguation (view source) (protected)
Module:Pagetype/setindex (view source) (protected)
Module:Pagetype/softredirect (view source) (protected)
Module:SDcat (view source) (protected)
Module:Side box (view source) (template editor protected)
Module:Side box/styles.css (view source) (template editor protected)
Module:String (view source) (protected)
Module:Unsubst (view source) (protected)
Module:Wikitext Parsing (view source) (protected)
Module:Yesno (view source) (protected)

Return to Triviality (mathematics).

Retrieved from "https://en.wikipedia.org/wiki/Triviality_(mathematics)"