HOME

TheInfoList



OR:

In mathematics and
logic Logic is the study of correct reasoning. It includes both formal and informal logic. Formal logic is the science of deductively valid inferences or of logical truths. It is a formal science investigating how conclusions follow from premise ...
, a direct proof is a way of showing the
truth Truth is the property of being in accord with fact or reality.Merriam-Webster's Online Dictionarytruth 2005 In everyday language, truth is typically ascribed to things that aim to represent reality or otherwise correspond to it, such as belie ...
or falsehood of a given statement by a straightforward combination of established facts, usually axioms, existing lemmas and
theorem In mathematics, a theorem is a statement that has been proved, or can be proved. The ''proof'' of a theorem is a logical argument that uses the inference rules of a deductive system to establish that the theorem is a logical consequence of t ...
s, without making any further assumptions. Cupillari, Antonella. ''The Nuts and Bolts of Proofs''. Academic Press, 2001. Page 3. In order to directly prove a conditional statement of the form "If ''p'', then ''q''", it suffices to consider the situations in which the statement ''p'' is true. Logical deduction is employed to reason from assumptions to conclusion. The type of logic employed is almost invariably
first-order logic First-order logic—also known as predicate logic, quantificational logic, and first-order predicate calculus—is a collection of formal systems used in mathematics, philosophy, linguistics, and computer science. First-order logic uses quantifie ...
, employing the quantifiers ''for all'' and ''there exists''. Common proof rules used are modus ponens and
universal instantiation In predicate logic, universal instantiation (UI; also called universal specification or universal elimination, and sometimes confused with '' dictum de omni'') is a valid rule of inference from a truth about each member of a class of individuals ...
.C. Gupta, S. Singh, S. Kumar ''Advanced Discrete Structure''. I.K. International Publishing House Pvt. Ltd., 2010. Page 127. In contrast, an
indirect proof In logic and mathematics, proof by contradiction is a form of proof that establishes the truth or the validity of a proposition, by showing that assuming the proposition to be false leads to a contradiction. Proof by contradiction is also known ...
may begin with certain hypothetical scenarios and then proceed to eliminate the uncertainties in each of these scenarios until an inescapable conclusion is forced. For example, instead of showing directly ''p'' ⇒ ''q'', one proves its
contrapositive In logic and mathematics, contraposition refers to the inference of going from a conditional statement into its logically equivalent contrapositive, and an associated proof method known as proof by contraposition. The contrapositive of a statem ...
~''q'' ⇒ ~''p'' (one assumes ~''q'' and shows that it leads to ~''p''). Since ''p'' ⇒ ''q'' and ~''q'' ⇒ ~''p'' are equivalent by the principle of transposition (see
law of excluded middle In logic, the law of excluded middle (or the principle of excluded middle) states that for every proposition, either this proposition or its negation is true. It is one of the so-called three laws of thought, along with the law of noncontradi ...
), ''p'' ⇒ ''q'' is indirectly proved. Proof methods that are not direct include
proof by contradiction In logic and mathematics, proof by contradiction is a form of proof that establishes the truth or the validity of a proposition, by showing that assuming the proposition to be false leads to a contradiction. Proof by contradiction is also known ...
, including
proof by infinite descent In mathematics, a proof by infinite descent, also known as Fermat's method of descent, is a particular kind of proof by contradiction used to show that a statement cannot possibly hold for any number, by showing that if the statement were to hold f ...
. Direct proof methods include
proof by exhaustion Proof by exhaustion, also known as proof by cases, proof by case analysis, complete induction or the brute force method, is a method of mathematical proof in which the statement to be proved is split into a finite number of cases or sets of equiv ...
and
proof by induction Mathematical induction is a method for proving that a statement ''P''(''n'') is true for every natural number ''n'', that is, that the infinitely many cases ''P''(0), ''P''(1), ''P''(2), ''P''(3), ...  all hold. Informal metaphors help ...
.


History and etymology

A direct proof is the simplest form of proof there is. The word ‘proof’ comes from the Latin word probare,New Shorter Oxford English Dictionary which means “to test”. The earliest use of proofs was prominent in legal proceedings. A person with authority, such as a nobleman, was said to have probity, which means that the evidence was by his relative authority, which outweighed empirical testimony. In days gone by, mathematics and proof was often intertwined with practical questions – with populations like the Egyptians and the
Greeks The Greeks or Hellenes (; el, Έλληνες, ''Éllines'' ) are an ethnic group and nation indigenous to the Eastern Mediterranean and the Black Sea regions, namely Greece, Cyprus, Albania, Italy, Turkey, Egypt, and, to a lesser extent, oth ...
showing an interest in surveying land.Krantz, Steven G. ''The History and Concept of Mathematical Proof''. February 5, 2007. This led to a natural curiosity with regards to
geometry Geometry (; ) is, with arithmetic, one of the oldest branches of mathematics. It is concerned with properties of space such as the distance, shape, size, and relative position of figures. A mathematician who works in the field of geometry is ...
and
trigonometry Trigonometry () is a branch of mathematics that studies relationships between side lengths and angles of triangles. The field emerged in the Hellenistic world during the 3rd century BC from applications of geometry to astronomical studies ...
– particularly
triangles A triangle is a polygon with three edges and three vertices. It is one of the basic shapes in geometry. A triangle with vertices ''A'', ''B'', and ''C'' is denoted \triangle ABC. In Euclidean geometry, any three points, when non-collinear ...
and
rectangles In Euclidean plane geometry, a rectangle is a quadrilateral with four right angles. It can also be defined as: an equiangular quadrilateral, since equiangular means that all of its angles are equal (360°/4 = 90°); or a parallelogram containin ...
. These were the shapes which provided the most questions in terms of practical things, so early geometrical concepts were focused on these shapes, for example, the likes of buildings and pyramids used these shapes in abundance. Another shape which is crucial in the history of direct proof is the
circle A circle is a shape consisting of all points in a plane that are at a given distance from a given point, the centre. Equivalently, it is the curve traced out by a point that moves in a plane so that its distance from a given point is con ...
, which was crucial for the design of arenas and water tanks. This meant that ancient geometry (and
Euclidean Geometry Euclidean geometry is a mathematical system attributed to ancient Greek mathematician Euclid, which he described in his textbook on geometry: the '' Elements''. Euclid's approach consists in assuming a small set of intuitively appealing axioms ...
) discussed circles. The earliest form of mathematics was phenomenological. For example, if someone could draw a reasonable picture, or give a convincing description, then that met all the criteria for something to be described as a mathematical “fact”. On occasion,
analogical Analogy (from Greek ''analogia'', "proportion", from ''ana-'' "upon, according to" lso "against", "anew"+ ''logos'' "ratio" lso "word, speech, reckoning" is a cognitive process of transferring information or meaning from a particular subject ( ...
arguments took place, or even by “invoking the gods”. The idea that mathematical statements could be proven had not been developed yet, so these were the earliest forms of the concept of proof, despite not being actual proof at all. Proof as we know it came about with one specific question: “what is a proof?” Traditionally, a proof is a platform which convinces someone beyond reasonable doubt that a statement is mathematically true. Naturally, one would assume that the best way to prove the truth of something like this (B) would be to draw up a comparison with something old (A) that has already been proven as true. Thus was created the concept of deriving a new result from an old result.


Examples


The sum of two even integers equals an even integer

Consider two even integers and . Since they are even, they can be written as : x =2a : y=2b respectively for integers and . Then the sum can be written as : x+y = 2a + 2b = 2(a+b)=2p where p=a+b, and are all integers. It follows that has 2 as a factor and therefore is even, so the sum of any two even integers is even.


Pythagoras' theorem

Observe that we have four right-angled triangles and a square packed into a large square. Each of the triangles has sides ''a'' and ''b'' and hypotenuse ''c''. The area of a square is defined as the square of the length of its sides - in this case, ''(a + b)2''. However, the area of the large square can also be expressed as the sum of the areas of its components. In this case, that would be the sum of the areas of the four triangles and the small square in the middle.Krantz, Steven G. ''The Proof is the Pudding''. Springer, 2010. Page 43. We know that the area of the large square is equal to ''(a + b)2''. The area of a triangle is equal to \frac12ab. We know that the area of the large square is also equal to the sum of the areas of the triangles, plus the area of the small square, and thus the area of the large square equals 4(\frac 12 ab) + c^2. These are equal, and so :: (a + b)^2 = 4(\frac 12 ab) + c^2 . After some simplifying, :: a^2 + 2ab + b^2 = 2ab + c^2 . Removing the ab that appears on both sides gives :: a^2 + b^2 = c^2 , which proves Pythagoras' theorem. ∎


The square of an odd number is also odd

By definition, if ''n'' is an odd integer, it can be expressed as : n = 2k + 1 for some integer ''k''. Thus :\begin n^2 &= (2k + 1)^2\\ &= (2k + 1)(2k + 1)\\ &=4k^2 + 2k + 2k + 1\\ &=4k^2 + 4k + 1\\ &=2(2k^2 + 2k) + 1. \end Since 2''k''2+ 2''k'' is an integer, ''n''2 is also odd. ∎


References


Sources

* (Ch. 1.)


External links


Direct Proof
from Larry W. Cusick'



from Patrick Keef and David Guichard'
Introduction to Higher Mathematics

Direct Proof
section of Richard Hammack'
Book of Proof
{{DEFAULTSORT:Direct Proof Mathematical proofs Logical truth