Introduction To Formal Proof

Contents

• Introduction to theory of computation

• Introduction to formal proof

• Additional forms of proof

• Inductive proofs
Introduction

It is a mathematical model which computes an algorithm in a

step by step manner
• Eg. If x is an input which gives to the computing system with
a computation fn and the output is received as y
So,
y= fn(x) or
fn(x)=y
Theory of computation (TOC) describes
 basic ideas
 models of computing
 Introduction

Computation means execution of algorithm

Or
Computation is a sequence of steps that can be performed by computer

TOC suggests abstract models of computation represented

mathematically

A computer which performs computation are not actual computers. They

are abstract machines.

Eg

-Turing machine derives an universal model

-Finite automata derives a restricted model
 Applications of TOC

• Language Design
• Compiler Design
• Robotics
• Artificial Intelligence
• Knowledge Engineering
Concepts of automata theory
Alphabets
Strings
Operations
Properties
Languages
Notations
Operations
Grammars
Graphs & Trees
 Proof

Formal Proof
• Deduction Proof
• Reduction to definition
• Other theorem forms
• If
• If..only if
• Theorem not in if..then statement

Additional Forms of proof

Induction proof
Inductions based on integer
General form of integer induction
Structural induction
Mutual induction
Mathematical Notations-Proofs

Formal Proof

A formal proof or a derivation is a finite sequence of

sentences. Each is an axiom follows by rule of inference.

Types

Deductive proof (Sequence of steps in it)

Inductive proof ( contains iteration of steps in it)

 Deductive proof

• Deductive Proof consists of a sequence of statements where true value

leads to the initial statement called hypothesis to a conclusion statement

Hypothesisconclusion

• If H then C
Example

• Eg. 1. If x>=4 then 2x>=x2, this statement is similar to if H then C format.

• H is true for x=6
• H is false for x=2

• Eg. 2. If x is the sum of squares of four positive integers then 2x>=x2

Reduction to Definition

• If you are not sure how to start a proof then convert all
the terms as hypothesis to their definitions

• Eg. Let ‘S’ be a finite subset of infinite set ‘U’

Let ‘T’ be the complement of ‘S’ with respect to ‘U’
then T is infinite
 Other theorem forms

a) if..then
If H then C
H implies C
H only if C
C if H
Whenever H holds C follows (or)
If H holds then C follows
Eg. If x>=4 then 2x>=x2
 Other theorem forms

b) if and only-if (iff)

A iff B (or)
A is equivalent to B (or)
A exactly when B
 Additional Forms of proof

• Proof by sets

• Proof by contrapositive

• Proof by contradiction

• Proof by counter
 Proof by sets

• If E and F are two expressions representing sets then

the statement E=F means two sets are represented
same.
• By commutative law of union for the two sets
RUS=SUR

Eg. RU(S ∩ T)=(RUS) ∩(RUT)

 Proof by contrapositive

• If any statement is like if H then C, it should be

written in contrapositive
If not C then not H

• Eg. If x>=4 then 2x>=x2

Proof by contradiction

• If H then C, HC

• If H and not C implies falsehood H ^ CF

• Eg. S is a finite subset of universal infinite set U. T

be the complement of S and is in a subset of U.
then T is infinite set
 Proof by counter

• In a real life to solve a problem we may try to find

a solution or if we cannot find a solution we will
prove that the statement is false.

• Eg. All primes are odd

• Eg. There is no pair of integers a and b such that
a mod b=b mod a
 INDUCTIVE PROOF

• It is a special form of proof that deals about the objects in recursion.

• Induction Principle:

If we prove S(i) and we prove that for all n>=I,

S(n)=>S(n+1), then we may conclude that s(n) for all n>=1.
It has two parts.
1.Basis part.
2.Inductive part.

• Basis step: We have to show S(i) for a particular integer

value “i”, here “i “ may be zero or one.

• Inductive step: We assume n>=i, where “i “ is the basis

integer and we have to show that if S(n) then S(n+1)
i.e., S(n) =>S(n+1).
Induction Problems
Induction Problems
Induction Problems
THANK YOU