In order to show that a premise
implies an assertion
(
), one can deduce a contradiction by assuming that
is true while
is false, which then implies a false statement
, particularly with
or
:
In particular,
we note that the equivalences
hold if no premises are made.
(Authors: Höllig/Knesch/Apprich/Abele)
The implication
is equivalent to
If the implication is true, i.e. if it follows from valid
mathematical laws, then the assertion
must be true, since
is false and
is either false or equal to
.
(Authors: Höllig/Hörner/Abele)
As an example of the indirect method of proof we will show that
is an irrational number, i.e. it cannot be
represented as a fraction.
Assume that assertion
is false, so

with
(The abbreviation
denotes the greatest common
divisor.)
By squaring and subsequent
multiplication with
, our initial
assumption implies that
so
and thus
must be even. In particular, there exists a
such that
. Since then
must be even as well, thus
.
Yet this contradicts the assumption that
and
are coprime
(cf.
), so
Consequently, assertion
must be true.
(Authors: Höllig/Knesch/Abele)
| |
automatically generated
9/18/2007 |