Table of contents :

Ch1: Introduction to mathematical logic (3 weeks)

1) Notions of mathematical logic:
1.1) Logical connectors.
1.2) Logical quantifiers.
2) Reasoning methods:
2.1) Reasoning by induction.
2.2) Reasoning by contradiction (through the absurd).
2.3) Reasoning by contrapositive.
2.4) Reasoning by counter example.
Ch2: Sets, relations and applications (2 weeks)
1) Notions on set theory:
1.1) Operations on sets.
1.2) Calculation rules.
1.3) Cartesian product.
2) Binary relations in a set:
2.1) Definitions and properties.
2.2) Equivalence relations.
2.3) Order relationships.
2.4) Maximum and minimum.
3) Applications:
3.1) General definitions.
3.2) Injection, surjection and bijection.
Ch3 : The digital sequences (2 weeks)
1) Definitions.
2) Convergence and divergence.
3) Examples of sequences :
3.1) Arithmetic sequences.
3.2) Geometric sequences.
3.3) Adjacent sequences.
3.4) Cauchy sequences.
3.5) Recurring sequences.
Ch4 : Function of a real variable (3 weeks)
1) General (Reminders):
1.1) Definition of a function.
1.2) Domain of definition.
1.3) Graph of a function.
 1.4) Remarkable straight lines in the plane.
1.5) Points of intersection of two graphs.
1.6) Periodic, even and odd functions.
2) Limits and continuity:
2.1) Definitions (limits).
2.2) Calculation of limits.
2.3) Definitions (Continuity).
3) Differentiability:
3.1) Calculation of derivatives.
3.2) derivative of usual functions.
3.3) Fundamental theorems on differentiable functions.
4) Basic functions:
4.1) Power function.
4.2) Logarithm function (Logarithm, common logarithm and natural
logarithm).
4.3) Exponential function.
4.3) Trigonometric and hyperbolic functions and their inverses.
Ch5 : Taylor formulas and limited development (2 weeks)
1) Taylor formula:
1.1) Taylor-Young formula.
1.2) Taylor formula with Lagrange remainder.
1.3) Taylor formula with integral remainder.
2) Limited development:
2.1) Definition and existence.
2.2) Limited developments of the usual functions at point 0.
2.3) Developments limited to the neighborhood of any point .
2.4) Operations on limited developments.
A) Sum and product of limited developments.
B) Composition of limited developments.
C) Division.
D) Integration.
Ch6 : Linear algebra (4 weeks)
1) Internal (closed) binary operation.
1.1) Definition.
1.2) Properties.
1.3) Groups and commutative (Abelian) groups
2) External binary operation.
3) Vector space
3.1) Definition.
 3.2) Properties.
3.3) Vector subspace.
3.4) Sum and direct sum of vector subspaces.
4) Spanning set, linear independence and bases.
5) Linear applications.
 Chapter 1 : Introduction to mathematical logic

I. Notions of mathematical logic

Definition:
A proposition or an assertion is a statement that is true or false, but never both at the
same time.
Examples:
 “3 is a divisor of 27” is a true proposition.
 “− ” is a false proposition.
Remark:
A proposition can be simple (which contains a single statement) or compound which
is constructed from several simple propositions.
Examples:
 “2 + 2 = 4 and 16 is the square of 4” ----> Compound proposition.
 “The heating is off or it’s cold” ---> Compound proposition.
Notation:
We denote ('T','F') or ('1','0') to designate a proposition 'True' or 'False', respectively.

I.1. Logical connectors:

Let P and Q be two simple propositions. We can then construct a

compound proposition which is composed of P and Q by connecting them by

logical connectors.

a) Conjunction: Two statements joined by the word "AND" form a compound

statement called the conjunction of the two statements. We say " P and Q " and

we write " P  Q ". A conjunction of P and Q is only true if both P and Q

are true.
Examples:
 Let P = “ ” and Q = “lim ”:

P  Q is a true proposition because P and Q are true.

 Let P = “-2+6 = 3” and Q = “(-5) 2 =25”:

P  Q is a false proposition because P is false.

 b) Disjunction: Two statements joined by the word 'OR' form a compound
statement called the disjunction. We say " P or Q " and we write " P  Q ". A

disjunction is true if at least one of the propositions is true (one or both).

Examples:
 Let P = “ ” and Q = “lim ”:

P  Q is a true proposition because P and Q are true.

 Let P = “-2+6 = 3” and Q = “(-5) 2 =25”:

P  Q is a true proposition because Q is true. (Note that P is false).

Remark:
The notations '˄' and '˅' are similar to those of intersection and union (,) in set

theory. Indeed :
 means that And .
 means that Or .

c) Negation: The negation of a proposition P is a proposition opposed to that

of P . We say "non P " or " P bar" and we write " P ". If proposition P is

true then the negation P is false, the inverse is also valid.

Examples:
P = “ for all real number x , we have t »: P is a true proposition.

P = “ there exists a real number x such that t ”: P is a false

proposition.

d) Conditional statement (Implication): A logical implication is a proposition

of the type “ If P is true then Q is true” (conditional). We denote

" P  Q " and we read " P implies Q ".

Remark:
 The implication proposition P  Q is equivalent to P  Q .

 The negation of the implication proposition P  Q is P  Q .

 The converse of the implication proposition P  Q is Q  P .

 The inverse of the implication proposition P  Q is P  Q .

 The contrapositive of the implication proposition P  Q is Q  P .

Example:
 " − " is a true proposition .

e) Biconditional statement (Equivalence): Two propositions are said to be

equivalent if P  Q and Q  P . We write ” P  Q ” and we say ” P is

equivalent to Q ” or ” P is true if and only if Q is true”.

Example:
 “ xy  0  x  0 or y  0 ” is a true proposition.

All the previous definitions can be summarized in the following table called 'truth
table':

1 1 0 0 1 1 1 1
1 0 0 1 0 1 0 0
0 1 1 0 0 1 1 0
0 0 1 1 0 0 1 1

Properties:
1.

2.

3.

4. ( ) (contrapositive)

5. [ t ] (transitivity)

6. (association )

7.

8. (distribution)
 I.2. Logical quantifiers:

a) Quantifier “For all”: it is the universal quantifier which means “for all”, “for
any”, “for each” and denoted “ ”.
Examples:
 t true assertion which means that for any natural number
we have t .
 false statement because a square cannot be negative. We
must write x  , x 2    .

b) Quantifier “it exists”: it is the existential quantifier denoted “ ” which means

“it exists” (at least one), “for some”.
Examples:
 such that is false and means that there exists at least one real
number x such that its square is negative.

 n   : n 2  n  0 is true because it is enough to find at least one value for

example n=1.
Remark:
Another existential quantifier denoted “ “ means “there exists a unique” i.e. a
single and unique value.

Negations of quantifiers:
 The negation of the proposition “ ” is “ ”.
Example:
The negation of the proposition “ x ]  ,1] : x 2  1 “ is: “ x ]  ,1] : x  1 “.

 The negation of the proposition “ ” is “ ”

Example:

The negation of the proposition “ 0    : sin( )  cos( ) ” is
2
" sin cos ".

Remark: The order of quantifiers is important in propositions.

 Negation of an assertion with several quantifiers:

Example:
h t
: t
Exercise 1:

1. Mathematically translate the proposition “if a and b are two natural numbers,
then there exists a multiple of a which is greater than b ”.
2. Give the negation of the proposition − .
3. Give the negation of the proposition “ t ”.
t t
4. Translate the statement “ ” into informal language.
5. Let P and Q be two propositions such that P is true and Q is false. Is

 
proposition “ P  Q  P ” true?

6. Using the truth table, prove that the following statement is true:

PQ  PQ

Exercise 2:

Consider n a natural number and two real numbers. Write the contrapositives of
the following implications:

1. is prime or n is odd.

2. xy  0  x  0 and y  0 .

3. .

II. Reasoning methods:

II.1. Reasoning by induction:

We use the proof by induction when we want to prove that a property of type
h is true. To show that h ” is true it is enough to:
 Check that is true i.e. for n=0, the property is true.
 Assume that is true for and show that t is true.

Example:
Show by induction that
t
.
  Let's show that is true: We have:
t
for n =0, . So is true.

 Let , suppose that true i.e.

t
.

Let us show that t is true, that is to say let us show that

t t tt
.

We have:
t t
t t t t ( because is supposed true )

t t t t t
= ,

from where t is true at order n +1. So we have just demonstrated that is

true for every .

Exercise 3:

t
Show that for every natural number n we have − .

II.2. Reasoning by contradiction (through the absurd):

It consists of assuming the opposite of the stated proposition and showing that we
then end up with a contradiction.
Example:
Let a, b  0 , show by contradiction that

a b
if  then a  b .
1 b 1 a
Remember that the negation of P  Q is P  Q . We then assume that
a b
 and a  b .
1 b 1 a
So we have t t tt t ttt

−t − −t

−t tt − −t
Since a  b then a  b  0 . So we can divide both sides of the equality by a  b ,
hence
tt − .
Contradiction because a, b  0 hence a  b  0 . Therefore, for any a, b  0 , if if

a b
 then a  b .
1 b 1 a

Exercise 4:

Demonstrate through the absurd (the contradiction) that :

“If n is the square of a non-zero integer then 2n is not the square of any integer”.

II.3. Reasoning by contrapositive:

To demonstrate that , we demonstrate its contrapositive .

Example:

Show by contrapositive that “ if n 2 is even then n is even”.

Let us show the contrapositive which is “ if n is odd then n 2 is odd”.

We have n odd  k   : n  2k  1

 n 2  (2k  1) 2  4k 2  4k  1  2(2k 2  2k )  1

 p  , p  2 k 2  2 k : n 2  2 p  1

 n 2 is odd.

Exercise 5:

Let a be a real number. Show by contrapositive that:

a
“if a squared is not an integer multiple of 16, then is not an even integer”.
2
II.4. Reasoning by counter example:

To show that is false, we just need to find a counter example, i.e. we

need to find at least one x  E such that P (x ) is not valid ( t '').

Example:
Consider h − '' and show that it is false.
We just need to find a counter example. For example for x=1, x − , therefore

t here exists an x in  which does not satisfy x 2  1  0 . Consequently P is

false.

Exercise 6:

Show that the following statement is false:

“For any real number x such that its square is positive, we have x itself is
positive”.