Scribd
Upload
18 views4 pages

En 15 18

Uploaded by

arthasmenethil510
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
18 views4 pages

En 15 18

Uploaded by

arthasmenethil510
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Mathematical arguments

Set theory

x∈A x is an element of A; x lies in A;


x belongs to A; x is in A
x 6∈ A x is not an element of A; x does not lie in A;
x does not belong to A; x is not in A
x, y ∈ A (both) x and y are elements of A; . . . lie in A;
. . . belong to A; . . . are in A
x, y 6∈ A (neither) x nor y is an element of A; . . . lies in A;
. . . belongs to A; . . . is in A
∅ the empty set (= set with no elements)
A=∅ A is an empty set
A 6= ∅ A is non-empty
A∪B the union of (the sets) A and B; A union B
A∩B the intersection of (the sets) A and B; A intersection B
A×B the product of (the sets) A and B; A times B
A∩B =∅ A is disjoint from B; the intersection of A and B is empty
{x | . . .} the set of all x such that . . .
C the set of all complex numbers
Q the set of all rational numbers
R the set of all real numbers

A ∪ B contains those elements that belong to A or to B (or to both).


A ∩ B contains those elements that belong to both A and B.
A × B contains the ordered pairs (a, b), where a (resp., b) belongs to A (resp., to B).
An = A × · · · × A contains all ordered n-tuples of elements of A.
| {z }
n times

belong to appartenir à
disjoint from disjoint de
element élément
empty vide
non-empty non vide
intersection intersection
inverse l’inverse
the inverse map to f l’application réciproque de f
the inverse of f l’inverse de f
map application
bijective map application bijective
injective map application injective
surjective map application surjective
pair couple

15
ordered pair couple ordonné
triple triplet
quadruple quadruplet
n-tuple n-uplet
relation relation
equivalence relation relation d’équivalence
set ensemble
finite set ensemble fini
infinite set ensemble infini
union réunion

Logic

S ∨ T S or T
S ∧ T S and T
S =⇒ T S implies T; if S then T
S ⇐⇒ T S is equivalent to T; S iff T
¬S not S
∀x ∈ A... for each [= for every] x in A . . .
∃x ∈ A... there exists [= there is] an x in A (such that) . . .
∃! x ∈ A . . . there exists [= there is] a unique x in A (such that) . . .
6∃x ∈ A... there is no x in A (such that). . .

x > 0 ∧ y > 0 =⇒ x + y > 0 if both x and y are positive, so is x + y


6 ∃ x ∈ Q x2 = 2 no rational number has a square equal to two
∀ x ∈ R ∃ y ∈ Q |x − y| < 2/3 for every real number x there exists a rational
number y such that the absolute value of x minus y
is smaller than two thirds

Exercise. Read out the following statements.

x ∈ A ∩ B ⇐⇒ (x ∈ A ∧ x ∈ B), x ∈ A ∪ B ⇐⇒ (x ∈ A ∨ x ∈ B),
2 2
∀x ∈ R x ≥ 0, ¬∃ x ∈ R x < 0, ∀ y ∈ C ∃ z ∈ C y = z2.

Basic arguments

It follows from . . . that . . .


We deduce from . . . that . . .
Conversely, . . . implies that . . .
Equality (1) holds, by Proposition 2.
By definition, . . .

16
The following statements are equivalent.
Thanks to . . . , the properties . . . and . . . of . . . are equivalent to each other.
. . . has the following properties.
Theorem 1 holds unconditionally.
This result is conditional on Axiom A.
. . . is an immediate consequence of Theorem 3.
Note that . . . is well-defined, since . . .
As . . . satisfies . . . , formula (1) can be simplified as follows.
We conclude (the argument) by combining inequalities (2) and (3).
(Let us) denote by X the set of all . . .
Let X be the set of all . . .
Recall that . . . , by assumption.
It is enough to show that . . .
We are reduced to proving that . . .
The main idea is as follows.
We argue by contradiction. Assume that . . . exists.
The formal argument proceeds in several steps.
Consider first the special case when . . .
The assumptions . . . and . . . are independent (of each other), since . . .
. . . , which proves the required claim.
We use induction on n to show that . . .
On the other hand, . . .
. . . , which means that . . .
In other words, . . .

argument argument
assume supposer
assumption hypothèse
axiom axiome
case cas
special case cas particulier
claim v. affirmer
(the following) claim l’affirmation suivante; l’assertion suivante
concept notion
conclude conclure
conclusion conclusion
condition condition
a necessary and sufficient condition une condition nécessaire et suffisante
conjecture conjecture

17
consequence conséquence
consider considérer
contradict contredire
contradiction contradiction
conversely réciproquement
corollary corollaire
deduce déduire
define définir
well-defined bien défini(e)
definition définition
equivalent équivalent(e)
establish établir
example exemple
exercise exercice
explain expliquer
explanation explication
false faux, fausse
formal formel
hand main
on one hand d’une part
on the other hand d’autre part
iff [= if and only if ] si et seulement si
imply impliquer, entraı̂ner
induction on récurrence sur
lemma lemme
proof preuve; démonstration
property propriété
satisfy property P satisfaire à la propriété P ; vérifier la propriété P
proposition proposition
reasoning raisonnement
reduce to se ramener à
remark remarque(r)
required réquis(e)
result résultat
s.t. = such that
statement énoncé
t.f.a.e. = the following are equivalent
theorem théorème
true vrai
truth vérité
wlog = without loss of generality
word mot
in other words autrement dit

18

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy