-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMath Handbook.tex
More file actions
4643 lines (3956 loc) · 462 KB
/
Copy pathMath Handbook.tex
File metadata and controls
4643 lines (3956 loc) · 462 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
\documentclass[12pt]{article}
\usepackage{amsmath} % allows piecewise functions, p-arentheses styled matrix (pmatrix), % b-racket styled matrix (bmatrix), \binom{n}{k} %"n choose k", \ddots (diagonal dots), \vdots (vertical dots) , \begin{align*} (math mode centering), \begin{center} (text mode centering)
\usepackage{amsfonts} % allows using additional font commands, \mathbb
\usepackage{mathabx} % for \Asterix, \coAsterix
\usepackage{amssymb} % for varpropto - proportion symbol, \nmid (doesn't divide symbol), \hbar, \therefore \because
\usepackage{graphicx} % include graphics / image package
\usepackage{caption} % to insert captions to figures / images
\usepackage{refstyle} % be able to reference figures
\usepackage{fullpage} % page formatting
%\usepackage{tabto} % required by \tab command (sometimes glitches, use \quad, or \qquad instead)
\usepackage{mathtools} % needed for under / over braces, ceil & floor functions
\usepackage{textcomp} % needed for \sim (tilde) and \texttildelow
\usepackage{amssymb} % for (small)setminus, \upharpoonright (function restriction symbol), \bigstar
\usepackage{mathrsfs} % for caligraphic letters
\usepackage[normalem]{ulem} % for underlining \uline{}
\usepackage{enumitem} % for good looking bullet types
\usepackage{steinmetz} % for \phase{} phasor
\usepackage{tipa} % for \textopencorner negative angle
\usepackage{color}
\usepackage[dvipsnames]{xcolor} % for more color support
\usepackage{bm} % for better \boldsymbol support (makes bold in math mode)
\usepackage{efbox} % drawing box around characters
\usepackage{bookmark} % outputs bookmarks sections in PDF document
\hypersetup{bookmarks=true}
\usepackage{float} % to force figures under text with \figure{figureName}[H]
% without the {float} package, we can use [h] the figure stays in proper relation to other
% elements from source file. Also to output file [t]=top, [b]=bottom, [ht] is common option
\topskip0pt % for \begin{vplace}: centers text on page with \vspace*{\fill} centered text \vspace*{\fill}
% Fonts
\usepackage[utf8]{inputenc}
%\usepackage[T1]{fontenc} % OT1 (Old Text encoding) = not a good idea to have
\usepackage[greek, english]{babel}
\usepackage{lmodern} % for {\tiny textGoesHere}
% Automatically enables \displaystyle whenever initiating inline-math mode -- via either an opening-$ or a \(
\everymath{\displaystyle}
%Augmented Matrix
\newenvironment{amatrix}[1]{
\left(\begin{array}{@{}*{#1}{c}|c@{}}
}{
\end{array}\right)
}
% Macros
\def\cBullet{\textbullet \quad} % User tagged to SHIFT + F2
\def\mod{\text{mod\ }} % Modulus operation (relative in Number theory)
\def\adj{\text{adj\ }} % Adjoint matrix
\def\Dom{\text{Dom\ }} % Domain of function / relation
\def\Ran{\text{Ran\ }} % Range of function / relation
\def\sinc{\text{sinc\ }} % Sinc function
\def\sgn{\text{sgn\ }} % Signum function
\def\cosec{\text{cosec\ }} % Cosecant trigonometric function
\def\sec{\text{sec\ }} % secant
\def\sech{\text{sech\ }} % Hyperbolic secant
\def\cosech{\text{cosech\ }} % Hyperbolic cosecant
\def\Var{\text{Var\ }} % Variance
\def\Cov{\text{Cov\ }} % Covariance
\def\Re{\text{Re\ }} % Real part
\def\Im{\text{Im\ }} % Imaginary part
\def\ln{\text{ln\ }} % natural logarithm
\def\antilog{\text{antilog\ }} % antilogarithm
\def\boxcar{\text{boxcar\ }} % boxcar function
\def\rect{\text{rect\ }} % rectangular function
\def\tri{\text{tri\ }} % triangular function
\def\erf{\text{erf\ }} % error function
\def\erfc{\text{erfc\ }} % complementary error function
\def\grad{\text{grad\ }} % gradient of a scalar function
\def\div{\text{div\ }} % divergence of a vector field / function
\def\curl{\text{curl\ }} % curl of vector function
% Custom document commands
\newcommand\tab[1][1cm]{\hspace*{#1}} % \tab button character
\newcommand{\Tau}{\mathrm{T}} % Capital Tau
\newcommand{\Chi}{\mathrm{X}} % Capital Chi
\newcommand{\Beta}{\mathrm{B}} % Capital Beta
%\renewcommand{\labelitemi}{$\Rightarrow$} % arrow instead of bullet
\newcommand{\Conv}{\mathop{\scalebox{1.5}{\raisebox{-0.2ex}{$\ast$}}}} % Custom convolution symbol (needs mathabx)
\newcommand{\rotatedAngle}{\rotatebox[origin=c]{180}{\ensuremath\angle}} % Rotate a symbol
\DeclarePairedDelimiter{\ceil}{\lceil}{\rceil} % needs mathtools
\DeclarePairedDelimiter{\floor}{\lfloor}{\rfloor} % needs mathtools
\begin{document}
\tableofcontents
\title{Math Handbook}
\author{\textbf{\textgreek{Νίκος Λαζαρίδης}}}
\maketitle
\pagebreak
\vspace*{\fill}
If I have seen further, it is by standing on the shoulders of giants. - Isaac Newton (1676)
\vspace*{\fill}
\pagebreak
\section{Laws of Mathematics}
\begin{flushleft}
\textbullet \quad Associative Laws \\
$\displaystyle a + (b + c) = (a + b) + c $ : For addition \\
$\displaystyle a(bc)= (ab)c $ \hspace{54pt}: For multiplication \linebreak
Associativity is the direction of operation processing (right to left, or left to right) \linebreak
\textbullet \quad Commutative Laws \\
$\displaystyle a + b = b +a $ \hspace{54pt}: For addition \\
$\displaystyle ab = ba $ \hspace{83pt}: For multiplication \linebreak
\textbullet \quad Distributive Laws \\
$\displaystyle a(b + c) = ab + ac $ \hspace{30pt}: For multiplication\\
$\displaystyle \frac{b+c}{a} = \frac{b}{a} + \frac{c}{a}, a \neq 0 $ \hspace{15pt}: For division \\
\end{flushleft}
\pagebreak
\section{Logic }
\subsection{Sentential Logic}
De Morgan's Laws \\
\textbullet \quad $ \lnot (P \land Q) = \lnot P \lor \lnot Q $ \\
\textbullet \quad $ \lnot(P \lor Q) = \lnot P \land \lnot Q $
\begin{flushleft}
Commutative Laws \\
\cBullet $ P \land Q = Q \land P $ \linebreak
\cBullet $ P \lor Q = Q \lor P $ \linebreak
Associative Laws \\
\cBullet $ P \land (Q \land R) = (P \land Q) \land R $ \linebreak
\cBullet $ P \lor (Q \lor R) = (P \lor Q) \lor R $ \linebreak
Idempotent Laws (an element of a set is unchanged in value if operated on by itself) \\
\cBullet $ P \land P = P $ \linebreak
\cBullet $ P \lor P = P $ \linebreak
Distributive Laws \linebreak
\textbullet \quad $ P \land (Q \lor R) = (P \land Q) \lor (P \land R) $ \linebreak
\textbullet \quad $ P \lor (Q \land R) = (P \lor Q) \land (P \lor R) $ \linebreak
Absorption Laws \linebreak
\textbullet \quad $ P \lor (P \land Q) = P $ \linebreak
\textbullet \quad $ P \land (P \lor Q) = P $ \linebreak
Double Negation Law \linebreak
\textbullet \quad $ \lnot \lnot P = P $ \linebreak
Tautology Laws \linebreak
\textbullet \quad $ P \land ($tautology$) = P $ \linebreak
\textbullet \quad $ P \lor ($tautology$) = $ tautology \linebreak
\textbullet \quad $ \lnot ($tautology$) = $ contradiction \linebreak
Contradiction Laws \linebreak
\textbullet \quad $ P \land ($contradiction$) = $ contradiction \linebreak
\textbullet \quad $ P \lor ($contradiction$) = P $ \linebreak
\textbullet \quad $ \lnot($contradiction$) = $ tautology \linebreak
Conditional Laws \linebreak
\textbullet \quad $ P \rightarrow Q = \lnot P \lor Q $ \linebreak
\textbullet \quad $ P \rightarrow Q $, converse statement: $ Q \rightarrow P $ \linebreak
\textbullet \quad $ P \rightarrow Q = \lnot Q \rightarrow \lnot P $ : contrapositive law \linebreak
\textbullet \quad $ P \lor S \rightarrow Q = ( P \rightarrow Q) \land (S \rightarrow Q) $ \linebreak
\textbullet \quad $ (P \rightarrow Q) \land (P \rightarrow S) = P \rightarrow Q \land S $ \\
\textbullet \quad $ (P \rightarrow Q) \land (R \rightarrow \lnot Q) = P \rightarrow \lnot R $ \linebreak
\textbullet \quad $ P \rightarrow Q $ means: \\
\qquad $Q$, if $P$ or $Q$ is a necessary condition for $P$ \\
\qquad $P$ only if $Q$ i.e. $P$ is a sufficient condition for $Q$ \\
\textbullet \quad $P \leftrightarrow Q = (P \rightarrow Q) \land (Q \rightarrow P) $ : Biconditional law \linebreak
\subsection{Quantificational Logic}
\textbullet \quad $ \exists $ : existential quantifier (distributes over disjunction) \linebreak
\textbullet \quad $ \forall $ : universal quantifier (distributes over conjunction) \linebreak
and $\displaystyle \forall \left( x P(x) \right) \equiv \lnot \exists x \lnot P(x) $ \linebreak
\textgreek{πχ. όλα είναι κόκκινα} $\ \equiv \ $ \textgreek{δεν υπάρχει κανένα που να μην είναι κόκκινο}. \linebreak
Quantifier Negation Laws \linebreak
\textbullet \quad $ \lnot \exists x P(x) = \forall x \lnot P(x) $ \linebreak
\textbullet \quad $ \lnot \forall x P(x) = \exists x \lnot P(x) $ \linebreak
Abbreviation rules \linebreak
\textbullet \quad $ \forall x \big( x \in A \rightarrow P(x) \big) = \forall x \in A\ P(x) $ \linebreak
\textbullet \quad $ \exists x \big( x \in A \rightarrow P(x) \big) = \exists x \in A\ P(x) $ \linebreak
\pagebreak
\section{Set Theory}
\textbullet \quad Zermelo–Fraenkel set theory (ZFC - C stands for axiom of \uline{C}hoice) is the standard form of axiomatic set theory and as such is the most common foundation of mathematics. It is one of several axiomatic systems that were proposed in the early twentieth century to formulate a theory of sets free of paradoxes such as Russell's paradox. \linebreak
\textbullet \quad \uline{Axiom of Choice}, or AC, is an axiom of set theory equivalent to the statement that the Cartesian product of a collection of non-empty sets is non-empty. It states that for every indexed family ${\displaystyle (S_i)_{i\in I}}$ of nonempty sets there exists an indexed family ${\displaystyle (x_i)_{i\in I}}$ of elements such that $\displaystyle x_i\in S_i \ \forall i\in I$. The axiom of choice says that given any collection of bins, each containing at least one object, it is possible to make a selection of exactly one object from each bin. \linebreak
\textbullet \quad Truth set of $\displaystyle P(x) = \{ x | P(x) \} $ \linebreak
\textbullet \quad $\displaystyle B = \{ x\ |\underbrace{x \text{ is a prime number}}_{\displaystyle \text{elementhood test for the set B}} \} $ \linebreak
\textbullet \quad $\displaystyle A \cap B = (x \in A) \land (x \in B) $ : Conjunction \linebreak
\textbullet \quad $\displaystyle A \cup B = (x \in A) \lor (x \in B) $ : Disjunction \linebreak
\textbullet \quad $\displaystyle A \setminus B = x\in A \land x \notin B $ : A without B \linebreak
\textbullet \quad Predicate: A Boolean-valued function $\displaystyle P: X \rightarrow \{$true, false$ \} $ : called "The predicate on $X$". \linebreak
\textbullet \quad $\displaystyle A \triangle B = (A \setminus B) \cup (B \setminus A) = (A \cup B) \setminus (A \cap B) $ : Symmetric difference of A and B \linebreak
\textbullet \quad $ A \cap B \neq \emptyset \rightarrow \exists x(x \in A \land x \in B) $ \linebreak
\textbullet \quad $ A \cap B = \emptyset \rightarrow \lnot \exists x (x \in A \land x \in B) $ \linebreak
\textbullet \quad $\displaystyle \exists! x\ P(x) = \begin{cases}
\exists x P(x) \land \forall y \forall z \big[ (P(y) \land P(z)) \rightarrow y = z\big] \\
\exists x \big[P(x) \land \forall y (P(y) \rightarrow y=x) \big] \\
\exists x \big[P(x)\ \land \neq \exists y (P(y) \land y \neq x) \big]
\end{cases} $ \linebreak
\textbullet \quad Singleton Set: A set that contains only one element. \linebreak
\textbullet \quad Alphabet: A set with finite number of elements. \linebreak
\textbullet \quad $ C \setminus A = C \cap (\Omega \setminus A) $, $U = \Omega$ ie. the universal set \linebreak
\textbullet \quad A \uline{Convex set} is a region such that, for every pair of points within the region, every point on the straight line segment that joins the pair of points is also within the region. For example, a solid cube is a convex set, but anything that is hollow or has an indent, for example, a crescent shape, is not convex. \linebreak
\textbullet \quad A set is called \uline{denumerable} exactly when it can be put in one-to-one correspondence with the set of natural numbers. \linebreak
\textbullet \quad A set $\mathcal{S}$ is countable if there is a sequence $r_1, r_2, r_3, \ldots$ which consists of all the elements of $\mathcal{S}$. \linebreak
\textbullet \quad A \uline{linear order} on a set $S$ satisfies two properties: \linebreak
$ - $ For any $a,b \in S$, exactly one of $a < b, a = b$ or $a>b$ is true. \linebreak
$ - $ For all $a,b,c \in S$, if $ a < b$ and $b<c$ then $a<c$ (transitivity). \linebreak
Examples of sets with a natural linear order are integers, floats, characters and strings in C. \linebreak
\textbullet \quad A set of elements (vectors) in a vector space V is called a \uline{basis} (or a set of basis vectors) if the vectors are linearly independent and every vector in the vector space is a linear combination of this set. In more general terms, a basis is a linearly independent spanning set. \linebreak
\textbullet \quad A \uline{basis function} is an element of a particular basis for a function space. Every continuous function in the function space can be represented as a linear combination of basis functions, just as every vector in a vector space can be represented as a linear combination of basis vectors. \linebreak
\textbullet \quad Idempotence is a property of certain operations that they can be applied multiple times without changing the result of the initial application. \linebreak
For example, the absolute value unary operation or function is idempotent, since $||x|| = x$ \linebreak
\uline{Cartesian Product} \linebreak
Cartesian Product is the collection of all ordered pairs of two given sets such that the first elements of the pairs are chosen from one set and the second elements from the other set; this procedure generalizes to an infinite number of sets. \linebreak
\textbullet \quad $ A\times B = { (a,b) | a \in A \land b \in B} $ : Cartesian product of sets $A$, $B$ \linebreak
Properties \linebreak
\textbullet \quad $ A \times (B \cap C) = (A \times B) \cap (A \times C) $ \linebreak
\textbullet \quad $ A \times (B \cup C) = (A \times B) \cup (A \times C) $ \linebreak
\textbullet \quad $ (A \times B) \cap (C \times D) = (A \cap C) \times (B \cap D) $ \linebreak
\textbullet \quad $ (A \times B) \cup (C \times D) \subseteq (A \cup C) \times (B \cup D) $ \linebreak
\textbullet \quad $ A \times \emptyset = \emptyset $ \linebreak
\textbullet \quad $\displaystyle \big[(A = B) \lor (A = \emptyset \land B = \emptyset) \big] \rightarrow A \times B = B \times A $ \linebreak
\subsection{Family Sets}
\textbullet \quad $ \cap \mathcal{F} = \{x\ |\ \forall A \in \mathcal{F} (x \in A) \} = \{x\ | \ \forall A(A \in \mathcal{F} \rightarrow x \in A ) \} $ : Family Set $\mathcal{F}$ \linebreak
\textbullet \quad $ \cup \mathcal{F} = \{x | \exists A \in \mathcal{F} (x \in A) = \{x | \exists A (A \in \mathcal{F} \land x \in A) \} $ \linebreak
Alternative notation for family sets: \linebreak
\textbullet \quad $ \cup \mathcal{F} = \bigcap_{i \in I} A_i = \{x | \forall i \in I (x \in A_i)\} $ \linebreak
\textbullet \quad $ \cup \mathcal{F} = \bigcup_{i \in I} A_i = \{x | \exists i \in I (x \in A_i)\} $ \linebreak
\textbullet \quad \uline{Ordered pair}: an ordered pair $(a, b)$ is a pair of objects. The order in which the objects appear in the pair is important, ie. the ordered pair $(a, b)$ is different from the ordered pair $(b, a)$ unless $a = b$. (In contrast, the unordered pair $\{a, b\}$ equals the unordered pair $\{b, a\}$). \linebreak
\textbullet \quad $ x \in A \rightarrow x \in \cup \{A\} $ \linebreak
\textbullet \quad $ A \in \mathcal{F} \rightarrow A \subseteq \cup \mathcal{F} $ \linebreak
\textbullet \quad $ A (A \in \mathcal{F} \land x \in A) \rightarrow x \in \cup \mathcal{F}$ \linebreak
\textbullet \quad $ (x \in A \land x \in \cap \mathcal{F}) \rightarrow A \subseteq \cap \mathcal{F} $ \linebreak
\textbullet \quad $ A \subseteq B = \forall x (x \in A \rightarrow x \in B) $ \linebreak
\textbullet \quad $ A \not\subset B = \exists x (x \in A \land x \notin B) $ \linebreak
\textbullet \quad $ (A \subseteq B \land A \neq B) \rightarrow A \subset B $, ie. A is a proper subset of B \linebreak
\textbullet \quad $ \mathcal{P}(A) = \{x | x \subseteq A\} $ : Power set of A \linebreak
\textbullet \quad $ B = \mathcal{P}(A) \rightarrow \forall x (x\in B \rightarrow x \subseteq A) $ \linebreak
\textbullet \quad $ \mathcal{P}(A \cap B) = \mathcal{P}(A) \cap \mathcal{P}(B) $ \linebreak
\textbullet \quad If $A$ has $n$ elements then $\mathcal{P}(A)$ has $2^n$ elements and $\mathcal{P}_2(A)$ has $\begin{displaystyle} \frac{n(n-1)}{2} \end{displaystyle} $ elements \linebreak
Indexed Family notation of a set: \linebreak
\textbullet \quad $ A = \{ x_i | i \in I \} = \{ x | \exists i \in I (x = x_i) \} $, $I$ : index set \linebreak
\textbullet \quad $ x = \in \{ x_i | i \in I \} = \exists i \in I (x= x_i) $ \linebreak
\pagebreak
\section{Algebra}
\subsection{Algebraic Identities}
\textbullet \quad $ a^2 - b^2 = (a + b) (a - b) $ \linebreak
\textbullet \quad $ (a + b)^2 = a^2 + 2ab + b^2 $ \linebreak
\textbullet \quad $ (a - b)^2 = a^2 - 2ab + b^2 $ \linebreak
\textbullet \quad $ (a + b)^3 = a^3 + 3a^2b + 3ab^2 + b^3 $ \linebreak
\textbullet \quad $ (a - b)^3 = a^3 - 3a^2b + 3ab^2 - b^3 $ \linebreak
\textbullet \quad $ a^3 + b^3 = (a + b) (a^2 - ab + b^2) $ \linebreak
\textbullet \quad $ a^3 - b^3 = (a - b) (a^2 + ab + b^2) $ \linebreak
\textbullet \quad $ (a + b + c)^2 = a^2 + b^2 + c^2 + 2ab +2bc +2ca$ \linebreak
\textbullet \quad $ (a +b+c)^3 = a^3 + b^3 + c^3 + 3(a + b) (b + c) ( c + a) $ \linebreak
\textbullet \quad $ a^3 + b^3 + c^3 -3abc = (a + b + c) (a^2 + b^2 + c^2 -ab -bc -ca) $ : Euler's Identity \linebreak
\textbullet \quad $ a + b + c = 0 \rightarrow a^3 + b^3 + c^3 = 3abc $ \linebreak
\textbullet \quad $ a^2 + b^2 > 0 \rightarrow a \neq 0 \lor b \neq 0 $ \linebreak
\textbullet \quad $ a^2 + b^2 = 0 \rightarrow a = 0 \land b = 0 $ \linebreak
\textbullet \quad $ (a + b)^4 = a^4 + 4a^3b + 6a^2b^2 + 4ab^3 + b^4 $ \linebreak
\textbullet \quad $ (a - b)^4 = a^4 - 4a^3b + 6a^2b^2 -4ab^3 + b^4 $ \linebreak
\textbullet \quad $ a \varpropto b \rightarrow \frac{a}{b} = $ \textgreek{σταθ. , αν τα ποσά} $a, b$ \textgreek{είναι ανάλογα, τότε} $\exists k(a =kb) $ \textgreek{ο λόγος τους είναι σταθερός} \linebreak
\textbullet \quad $ a, b$ \textgreek{ομόσημοι} $\leftrightarrow a\cdot b > 0 \leftrightarrow a \setminus b > 0 $ \linebreak
\textbullet \quad $ a, b$ \textgreek{ετερόσημοι} $\leftrightarrow a\cdot b < 0 \leftrightarrow a \setminus b < 0 $ \linebreak
\textbullet \quad $ (a > b) \land (c > d) \rightarrow a + c > b + d $ \linebreak
\textbullet \quad $ (a > b) \land (c > d) \rightarrow a\cdot c > b\cdot d $ \linebreak
\textbullet \quad $ \forall a, b \in \mathbb{R}^* \displaystyle \Big(\frac{a}{b} + \frac{b}{a} \geq 2\Big) $ \linebreak
\textbullet \quad $ \forall a, b \in \mathbb{R}^* \forall n \in \mathbb{N}(n \geq 2) \displaystyle \Big(\frac{a_1}{a_2}+ \frac{a_2}{a_3} + ... + \frac{a_{n-1}}{a_n} + \frac{a_n}{a_1} \geq n \Big) $ \linebreak
\textbullet \quad Numbers that satisfy polynomial equations, are called \uline{algebraic} numbers. All algebraic numbers are connected with the integers. \linebreak
\textbullet \quad A transcendental number is a real or complex number that is not algebraic. A complex number is algebraic if both its real and imaginary part is algebraic. \linebreak
\textbullet \quad A transcendental function is an analytic function that does not satisfy a polynomial equation. \linebreak
\textbullet \quad \textgreek{Σύστημα 2 εξισώσεων (ε) και (έ)} $ \rightarrow l\cdot ($ \textgreek{ε} $) + l'\cdot $ \textgreek{έ} $) $ : \textgreek{γραμμικός συνδυασμός των (ε) και (ε'). Συστήματα που προκύπτουν με γραμμικό συνδυασμό είναι ισοδύναμα.} \linebreak
\textbullet \quad $ \forall n \in \mathbb{N} \Big[a^n -b^n = (a-b)(a^{n-1} + a^{n-2}b + a^{n-3}b^2 + ... + ab^{n-2} + b^{n-1}) \Big] $ \linebreak
\textbullet \quad $ \forall n \in \mathbb{N} \Big[a^n +b^n = (a+b)(a^{n-1} - a^{n-2}b + a^{n-3}b^2 - ... - ab^{n-2} + b^{n-1}) \Big] $ \linebreak
\textbullet \quad $ x \ll 1 \rightarrow (1 \pm x)^n \approx 1 \pm nx $ \linebreak
\textbullet \quad $ a, b \in \mathbb{R} \Big[ \big(a^2 + b^2 \geq ab \big) \land \big(- (a^2 + b^2) \leq -ab \big) \Big] $ \linebreak
\textbullet \quad $ \forall a, b \in \mathbb{R} \Big[ a^2 + b^2 \geq ab \land -(a^2 + b^2) \leq -ab \Big] $ \linebreak
\textbullet \quad $ \forall a_1, a_2, ..., a_n \in \mathbb{R}^*, \forall n \in \mathbb{N}(n\geq 2) \Big(\frac{a_1 + a_2 + ... + a_n}{n} \geq \sqrt{a_1a_2\cdots a_n} \Big) $ : Arithmetic - Geometric mean inequality \linebreak
\textbullet \quad $\displaystyle \forall a_1, a_2, ..., a_n \in \mathbb{R}^*, \forall n \in \mathbb{N}(n\geq 2) \Big(\frac{n}{\frac{1}{a_1} + \frac{1}{a_2} + \cdots + \frac{1}{a_n}} \geq \sqrt{a_1a_2\cdots a_n} \Big) $ : Harmonic - Geometric mean inequality \linebreak
\textbullet \quad $(a + b + c + d)^2 = a^2 + b^2 + c^2 +d^2 +2ab + 2ac + 2ad +2bc +2bd +2cd $ \linebreak
\textbullet \quad $ a^4 + b^4 + c^4 -2(a^2b^2 + b^2 c^2 +c^2a^2)=(a+b+c)\cdot(a-b+c)\cdot(a+b-c)(a-b-c) $ : De Moivre Identity \linebreak
Gauchy Identities \linebreak
\textbullet \quad $ (a+b)^3 -a^3 -b^3 =3ab(a+b) $ \linebreak
\textbullet \quad $ (a+b)^5 -a^5 -b^5 = 5ab(a+b)(a^2+ab+b^2) $ \linebreak
\textbullet \quad $ (a+b)^7 -a^7 -b^7 = 7ab(a+b)(a^2+ab+b^2)^2 $ \linebreak
\textgreek{Εξισώσεις της μορφής}: $ax^4 + bx^3 +cx^2 +bx +a = 0$, \textgreek{με} $a\neq 0$, \textgreek{λέγονται αντίστροφες. Τις λύνουμε θέτοντας}: $\displaystyle x+\frac{1}{x} = y $ \linebreak
\textbullet \quad $ 1 \text{grad} = \frac{9}{10}\ of \ 1^o \lor 1\text{grad} = \frac{\pi}{200}\ of \ 1 \text{rad}$ \linebreak
\textbullet \quad $ 45^o36'18" = 45^o + \big(\frac{36}{60}\big)^o + \big(\frac{18}{60\cdot 60}\big)^o = 45.605^o $ \linebreak
\subsection{Absolute Values}
\textbullet \quad $ |a| = a \leftrightarrow a \geq 0 $ \linebreak
\textbullet \quad $ |a| = -a \leftrightarrow a \leq 0 $ \linebreak
\textbullet \quad $ |x| > p \leftrightarrow (x < -p) \lor (x > p) $ \linebreak
\textbullet \quad $ |x| < p \leftrightarrow -p < x < p $ \linebreak
\textbullet \quad $ |x| = a \leftrightarrow (x = a) \lor (x = -a) $ \linebreak
\textbullet \quad $\displaystyle \forall a \in \mathbb{R} (|a|^2 = a^2) $ \linebreak
\textbullet \quad $\displaystyle |a\cdot b| = |a|\cdot |b| $ \linebreak
\textbullet \quad $\displaystyle |P(x) | \geq x \leftrightarrow P(x) \leq -|x| \land P(x) \geq |x|\ , \ \forall x \in \mathbb{R} $ \linebreak
\textbullet \quad $\displaystyle |P(x)| \leq x \leftrightarrow -|x| \leq P(x) \leq |x| $ \linebreak
\textbullet \quad $ \big| |a| - |b| \big| \leq |a \pm b | \leq |a| + |b| \ , \forall a, b \in \mathbb{R} $ \linebreak
\textbullet \quad $\displaystyle \forall x, x_0 \in \mathbb{R} , p \in \mathbb{R}^+ \big( | x - x_0| < p \leftrightarrow x_0 - p < x < x_0 + p \big) $ \linebreak
\textbullet \quad $\displaystyle \forall x, x_o \in \mathbb{R} , p \in \mathbb{R}^+ \big( | x - x_0| > p \leftrightarrow x < x_0 - p \lor x > x_0 + p \big) $ \linebreak
\textbullet \quad $\displaystyle \forall x, x_0 \in \mathbb{R}, p \in \mathbb{R}^+ \big[ |x-x_0| < p \leftrightarrow d(x,x_0) < p \leftrightarrow x \in (x_0 -p, x_0 + p) \big] $ \linebreak
\textbullet \quad\ $\displaystyle \forall x, x_0 \in \mathbb{R}, p \in \mathbb{R}^+ \big[ |x-x_0| > p \leftrightarrow d(x, x_0) > p \leftrightarrow x\in (- \infty, x_0 - p ) \cup (x_0 + p, + \infty ) \big] $ \linebreak
\textbullet \quad $ |a -b | = |b -a| $ \linebreak
\subsection{Powers, Radicals}
\textbullet \quad $\displaystyle \forall k \in \mathbb{N}^* \big[(\sqrt[n]{a})^k = \sqrt[n]{a^k} \big] $ \linebreak
\textbullet \quad $\displaystyle \forall a \geq 0 \ (a^{1/ n} = \sqrt[n]{a} $ \linebreak
\textbullet \quad $\displaystyle a \sqrt[n]{b} = \sqrt[n]{a^n \cdot b} $ \linebreak
\textbullet \quad $\displaystyle \sqrt[k]{\sqrt[n]{a}} \sqrt[k\cdot n]{a} $ \linebreak
\textbullet \quad $\displaystyle a < b \leftrightarrow \sqrt[n]{a} < \sqrt[n]{b} \ , \forall a \geq 0 $ \linebreak
\textbullet \quad $\displaystyle a^n = \underbrace{a \cdot a \cdot a \cdot a \cdots a}_{n\ \text{times}} $ \linebreak
\textbullet \quad $\displaystyle a^n \cdot a^m = a^{n + m} $ \linebreak
\textbullet \quad $\displaystyle a^n \cdot b^n = (a\cdot b)^n $ \linebreak
\textbullet \quad $\displaystyle \frac{a^n}{a^m} = a^{n-m} $ \linebreak
\textbullet \quad $\displaystyle a^{-n} = \frac{1}{a^n} $ \linebreak
\textbullet \quad $\displaystyle \frac{a^n}{b^n} = \big( \frac{a}{b}\big)^n $ \linebreak
\textbullet \quad $ (a^n)^m = a^{n\cdot m} $ \linebreak
\textbullet \quad $ a^{n^m} = a^{(n^m)} $ \linebreak
\textbullet \quad $\displaystyle a^{n/m} = \sqrt[m]{a^n} $ \linebreak
\textbullet \quad $\displaystyle \sqrt[m]{(a^n)} = a^{n/m} $ \linebreak
\textbullet \quad $ a^0 = 1 $ \linebreak
\textbullet \quad $ 0^n = 0 \ , \forall n > 0 $ \linebreak
\textbullet \quad $ 1^ n = 1 \ , \forall n \in \mathbb{R} $ \linebreak
\textbullet \quad $\displaystyle (-1)^n = \begin{cases}
1 & n= 2k \ , n,k\in \mathbb{Z} \\
-1 & n = 2k + 1 \\
\end{cases} $ \linebreak
\textbullet \quad $\displaystyle \forall a \in \mathbb{R}, n \in \mathbb{Z} (-a)^n = \begin{cases}
a^n & n = 2k , k\in \mathbb{Z} \\
-a^n & n = 2 k + 1 \\
\end{cases} $ \linebreak
\textbullet \quad $\displaystyle (a+ \sqrt{b} ) (a - \sqrt{b}) = a^2 -b $ \linebreak
\textbullet \quad $\displaystyle \overset{\sim}{X} = \sqrt{\overset{-}{X}^2} , \ \overset{\sim}{X}: \ $ \textgreek{ενεργός τιμή του μεγέθους} $ X $ \\ \hspace{78pt} $ \overset{-}{X}: \ $\textgreek{μέση τιμή του μεγέθους}$ X $ \linebreak
\textbullet \quad Surds are numbers left in square root form, or cube root form etc. They are therefore irrational numbers. \linebreak
\subsection{Logarithms}
\textgreek{Το} $ \log_b x $ \textgreek{είναι ο εκθέτης στον οποίο πρέπει να υψώσουμε το } $ b$\textgreek{, για την εύρεση του} $x$ \linebreak
\textbullet \quad $ y = log_b x \leftrightarrow x = b^y \ , x> 0 , b>0, b\neq 1 $ \linebreak
\textbullet \quad $\displaystyle log_b (x\cdot y) = log_b x + log_b y $ \linebreak
\textbullet \quad $\displaystyle log_b (x / y) = log_b x - log_b y $ \linebreak
\textbullet \quad $\displaystyle log_b (x^n) = n log_b x $ \linebreak
\textbullet \quad $\displaystyle log_b x = \frac{log_a x}{log_a b} , log_a x \cdot log_a b = log_b x \big( log_a b = \frac{1}{log_b a} \big) $ \linebreak
\textbullet \quad $\displaystyle log_b b = 1 $ \linebreak
\textbullet \quad $\displaystyle log_b 1 = 0 \leftrightarrow 1 = b^0 $ \linebreak
\textbullet \quad $\displaystyle log_e a = \ln a $ : Natural logarithm, $e = 2.71828$ : Euler's number \linebreak
\textbullet \quad $\displaystyle b^{log_b x} = x $ , \textgreek{αφού} $\displaystyle \antilog_b (log_b (x)) = x $ \linebreak
\textbullet \quad $\displaystyle log_b b^x = x $ \linebreak
\textbullet \quad $\displaystyle log_a b \cdot log_b a = 1 $ \linebreak
\textbullet \quad $\displaystyle log_a x = log_a^2 x^2 $ \linebreak
\textbullet \quad $\displaystyle log_a \theta + log_{\frac{1}{a}} \theta = 0 $ \linebreak
\textbullet \quad $\displaystyle a > b \rightarrow log_a b < 1 $ \linebreak
\textbullet \quad $\displaystyle a < b \rightarrow log_a b > 1 $ \linebreak
\textbullet \quad $\displaystyle a = b \rightarrow log_a b = 1 $ \linebreak
\textbullet \quad $\displaystyle x^{log \ x} = a^{log \ x} $ \linebreak
\textbullet \quad $\displaystyle a^x = e^{x\ \ln \ a} , $ \textgreek{αφού}: $ a = e^{\ln \ a} $ \linebreak
\textbullet \quad $\displaystyle n^{\log \log n} = e^{\log n \log \log n}$ (natural logarithms) \linebreak
\subsection{Theorems}
\textbullet \quad \uline{Remainder Theorem}: Polynomial $P(x)$ division with $x-p$, yields $P(x) = (x-\rho) \cdot \pi(x) + \upsilon \ , \upsilon =P(\rho) $ \linebreak
\textbullet \quad \uline{Factor Theorem}: A polynomial $F(x)$ has a factor $x-k $ iff $ f(k) = 0 ($ i.e. $k$ is a root of $f ) $ \linebreak
\textbullet \quad \uline{Rational Root Theorem}: Suppose polynomial equation with interger coefficients: $\displaystyle a_n x^n + a_{n-1} x^{n-1} + \ldots + a_1 x + a_0 = 0 $. Then the rational solution: $ x_0 = p / q $ (expressed in lowest terms) of the equation, satisfies: (a) $p$ is an integer factor of the constant term $a_0$ and (b) $q$ is an integer factor of the leading coefficient $a_n$. \linebreak
\textbullet \quad \uline{\textgreek{Ταυτότητα Ευκλείδειας διαίρεσης}}: $\displaystyle \Delta(\chi) \cdot \pi (\chi) + \upsilon (\chi)$ \textgreek{Δ(χ): Διαιρετέος, δ(χ): διαιρέτης, π(χ): πηλίκο, υ(χ): υπόλοιπο } \linebreak
\textbullet \quad \uline{Horner's Method} \\
\begin{tabular}{|c|c|c|c|c} % Table: 5 {c}entered columns with vertical lines between them
\hline
$a_n$ & $a_{n-1}$ & $a_{n-2}$ & $\ldots$ & $a_1$ \tiny{$(a_{n-n +1})$} \\ \hline % next row \hline: adds horizontal lines and borders
$ $ & $a_n x_0$ & $a_nx_0 ^2 + a_{n-1} x_0$ & $\ldots$ & $a_n x_0 ^{n-1} + \ldots + a_2 x_0 $ \\ \hline
$ a_n $ & $ a_n x_0 + a_{n -1} $ & $ a_n x_0 ^2 + a_{n-1} x_0 + a_{n-2} $ & $ \ldots $ & $ a_n x_0 ^{n-1} + a_{n-1}x_0^{n+2} + \ldots + a_2 x_0 + a_1 $ \\ \hline
\end{tabular}
\begin{tabular}{c|c|}
\hline
$a_0$ & $x_0$ \\ \hline
$a_n x_0 ^n + \ldots + a_2 x_0 ^2 + a_1 x_0$ & $ $ \\ \hline
$ $ & $ $ \\ \hline
\end{tabular}
\linebreak
- $\displaystyle \Delta(x) = a_n x^n + a_{n-1} x^{n-1} + \ldots + a_1 x + a_0, \delta(x) = x_0 $ \\
- $\displaystyle \pi(x) = a_n x^{n-1} + (a_n x_0 + a_{n-1}) x^{n-2} + (a_n x_0 ^2 + a_{n-1} x_0 + a_{n-2} ) x^{n-3} + \ldots + (a_n x_0 ^{n-1} + a_{n-1} x_0 ^{n-2} + \ldots + a_2 x_0 + a_1 ) $ \\
- $\displaystyle \upsilon(x) = \Delta (x_0) $ \linebreak
\textbullet \quad The simplest form of factorization is the extraction of the HCF from an expression. \linebreak
\textbullet \quad \uline{Fundamental Theorem of Algebra}: Every non-constant single-variable polynomial with complex coefficients has at least one complex root (Alternatively: ) Every polynomial expression $\displaystyle f(x) = a_n x^n + a_{n-1} x^{n-1} + \ldots + a_1 x + a_0 $ can be written as a product of $ n $ linear factors in the form: $\displaystyle f(x) = a_n (x - r_1)(x-r_2)(\ldots)(x-r_n), a_i, r_i \in \mathbb{C} $ \linebreak
\textbullet \quad If $a_1, a_2, a_3, \ldots, a_n $ are the roots of: $\displaystyle p_0 x^n + p_1 x^{n-1} + p_2 x^{n-2} + \ldots + p_{n-1} x+ p_n = 0 \ (p_0 \neq 0)$ , then \\
- sum of the roots $ = -p_1 / p_0 $ \linebreak
- sum of the roots, two at a time $ = p_2 / p_0 $ \linebreak
- sum of the roots, three at a time $ = -p_3 / p_0 $ \linebreak
- sum of the roots, $n$ at a time $ = (-1)^n p_n / p_0 $ \linebreak
\textbullet \quad Transforming a cubic: $\displaystyle x^3 + a x^2 + b x + c = 0 $, to its reduced form: $\displaystyle y^3 + p y + q = 0 $, by the substitution: $\displaystyle x = y - \frac{a}{3} $, only when $ a> 0 $. \linebreak
\textbullet \quad \uline{Tartaglia's solution} for a real root of a cubic equation of the form: $\displaystyle x^3 + ax + b = 0, a > 0 $ is: \\
$\displaystyle x = \Bigg\{ -\frac{b}{2} + \sqrt{\frac{a^3}{27} + \frac{b^2}{4}}\ \Bigg\}^{\frac{1}{3}} + \Bigg\{-\frac{b}{2} - \sqrt{\frac{a^3}{27} + \frac{b^2}{4}} \Bigg\}^{ \frac{1}{3}} $ \linebreak
\textbullet \quad Solution of a \uline{Quartic} equation. There are three ways:
\begin{enumerate}
\item Numerically,
\item Ferrari-Cardano procedure, or one of its kin,
\item By design, it could be one of the relatively few such equations that collapse, because there are some very simple roots.
\end{enumerate}
\textbullet \quad \uline{Continued fraction (CF)}: an expression obtained through an iterative process of representing a number as the sum of its integer part and the reciprocal of another number, then writing this other number as the sum of its integer part and another reciprocal, and so on. There are two kinds of continued fractions, 1. Finite (or terminated) continued fractions and 2. Infinite continued fractions. In a finite continued fraction, the iteration/recursion is terminated after finitely many steps by using an integer in lieu of another continued fraction. In contrast, an infinite continued fraction is an infinite expression. In either case, all integers in the sequence, other than the first, must be positive. The integers $a_i$ are called the coefficients, or terms of the continued fraction. \linebreak
\textbullet \quad Finite continued fraction: \linebreak
$$ a_0 + \frac{1}{a_1 + \frac{1}{a_2 + \frac{1}{\vdots + \frac{1}{a_n}}}} $$
Such a continued fraction is sometimes represented as: $[a_0, a_1, \ldots , a_n]$, denoting the coefficients. \linebreak
\textbullet \quad Infinite continued fraction: \linebreak
$$ [a_0, a_1, a_2, \ldots ] = \lim_{n\to \infty} x_n $$
\pagebreak
\section{Trigonometry}
\uline{Trigonometric Identities} \linebreak
\textbullet \quad $\displaystyle \sin (x) = \sin (\theta) \leftrightarrow (x = 2\kappa\pi + \theta) \lor (x = 2\kappa \pi + (\pi - \theta)) $ \linebreak
\textbullet \quad $\displaystyle \cos (x) = \cos (\theta) \leftrightarrow (x = 2\kappa \pi + \theta) \lor (x = 2\kappa \pi - \theta) $ \linebreak
\textbullet \quad $\displaystyle \tan (x) = \tan (\theta) \leftrightarrow x = \kappa \pi + \theta $ \linebreak
\textbullet \quad $\displaystyle \cot (x) = \cot (\theta) \leftrightarrow x = \kappa \pi + \theta $ \linebreak
\textbullet \quad $\displaystyle \sin ^2(x) + \cos ^2(x) = 1 $ \linebreak
\textbullet \quad $\displaystyle \sec ^2(x) -\tan ^2(x) = 1 $ \linebreak
\textbullet \quad $\displaystyle \cosec ^2(x) -\cot ^2(x) = 1 $ \linebreak
\textbullet \quad $\displaystyle \sin (2\theta) = 2\sin (\theta)\cos (\theta) $ \linebreak
\textbullet \quad $\displaystyle \cos (2\theta) = 2\cos ^2(\theta) - 1 = 1 - 2\sin ^2(\theta) $ \linebreak
\textbullet \quad $\displaystyle \tan (2\theta) = \frac{2\tan \theta}{1-\tan ^2\theta} $ \linebreak
\textbullet \quad $\displaystyle \tan (x) = \frac{\sin (x) }{\cos (x)} = \frac{1}{\cot (x)} $ \linebreak
\textbullet \quad $\displaystyle \cosec (x) = \frac{1}{\sin (x)} $ \linebreak
\textbullet \quad $\displaystyle \sec (x) = \frac{1}{\cos (x)} $ \linebreak
\textbullet \quad $\displaystyle \sin (A+ B) = \sin A \ \cos B + \cos A \ \sin B $ \linebreak
\textbullet \quad $\displaystyle \sin (A - B) = \sin A \ \cos B - \cos A \ \sin B $ \linebreak
\textbullet \quad $\displaystyle \cos (A + B) = \cos A \ \cos B - \sin A \ \sin B $ \linebreak
\textbullet \quad $\displaystyle \cos (A - B) = \cos A \ \cos B + \sin A \ \sin B $ \linebreak
\textbullet \quad $\displaystyle \tan (A + B) = \frac{\tan A + \tan B}{1 -\tan A \ \tan B} $ \linebreak
\textbullet \quad $\displaystyle \tan (A - B) = \frac{\tan A - \tan B}{1 + \tan A \ \tan B} $ \linebreak
\textbullet \quad $\displaystyle \cos ^2 x = \frac{1 + \cos 2x}{2} $ \linebreak
\textbullet \quad $\displaystyle \cos ^2 x = \frac{1 - \cos 2x}{2 } $ \linebreak
\textbullet \quad $\displaystyle 2\sin A \cos B = \sin (A + B) + \sin (A -B) $ \linebreak
\textbullet \quad $\displaystyle 2\cos A \sin B = \sin (A + B) - \sin (A - B) $ \linebreak
\textbullet \quad $\displaystyle 2\cos A \cos B = \cos (A + B) + \cos (A - B) $ \linebreak
\textbullet \quad $\displaystyle 2\sin A \sin B = \cos (A - B) - \cos (A + B) $ \linebreak
\textbullet \quad $\displaystyle \sin A + \sin B = 2\sin \left( \frac{A + B}{2}\right) \cos \left(\frac{A-B}{2} \right) $ \linebreak
\textbullet \quad $\displaystyle \sin A - \sin B = 2\sin \left( \frac{A-B}{2} \right) \cos \left( \frac{A + B}{2} \right) $ \linebreak
\textbullet \quad $\displaystyle \cos A + \cos B = 2\cos \left( \frac{A + B}{2} \right) \cos \left( \frac{A - B}{2} \right) $ \linebreak
\textbullet \quad $\displaystyle \cos A - \cos B = -2\sin \left( \frac{A + B}{2} \right) \sin \left( \frac{A - B}{2} \right) $ \linebreak
\textbullet \quad $\displaystyle a, b \neq 0 \longrightarrow \forall x \in \mathbb{R}: \alpha \ \sin (x) + \beta \ \cos (x) = \rho \ \sin (x + \phi) , $ \\ $\displaystyle \rho = \sqrt{\alpha^2 + \beta^2}, \phi \in \mathbb{R}: \tan (\phi) = \frac{\beta}{\alpha} $ \linebreak
\textbullet \quad $\displaystyle \sin (-\omega) = \sin (\omega) $ \linebreak
\textbullet \quad $\displaystyle \cos (-\omega) = \cos (\omega) $ \linebreak
\textgreek{Γωνίες με άθροισμα 180 μοίρες} $ ( { \omega + \omega' = 180^o} )$ \linebreak
\textbullet \quad $\displaystyle \sin (180^o - \omega) = \sin (\omega) $ \linebreak
\textbullet \quad $\displaystyle \cos (180^o - \omega) = -\cos (\omega) $ \linebreak
\textbullet \quad $\displaystyle \tan (180^o - \omega) = -\tan ( \omega) $ \linebreak
\textbullet \quad $\displaystyle \cot (180^o - \omega) = -\cot (\omega) $ \linebreak
\textgreek{Γωνίες που διαφέρουν κατά 180 μοίρες} $ (\omega' = 180^o + \omega ) $ \linebreak
\textbullet \quad $\displaystyle \sin (180^o + \omega) = -\sin (\omega) $ \linebreak
\textbullet \quad $\displaystyle \cos (180^o + \omega) = -\cos (\omega) $ \linebreak
\textbullet \quad $\displaystyle \tan (180^o + \omega) = \tan (\omega) $ \linebreak
\textbullet \quad $\displaystyle \cot (180^o + \omega) = \cot (\omega) $ \linebreak
\textgreek{Γωνίες με άθροισμα 90 μοίρες} $ \omega' + \omega = 90^o $ \linebreak
\textbullet \quad $\displaystyle \sin (90^o - \omega) = \cos (\omega) = -\sin (\omega - 90^o) $ \linebreak
\textbullet \quad $\displaystyle \cos (90^o - \omega) = \sin (\omega) = \cos (\omega - 90^o) $ \linebreak
\textbullet \quad $\displaystyle \tan (90^o - \omega) = \cot (\omega) $ \linebreak
\textbullet \quad $\displaystyle \cot (90^o - \omega) = \tan (\omega) $ \linebreak
\textbullet \quad $\displaystyle \tan (\theta) = \frac{a}{b} \rightarrow \sin (\theta) = \frac{a}{\sqrt{a^2 + b^2}} \lor \cos (\theta) = \frac{b}{\sqrt{a^2 + b^2}} $ \linebreak
\textbullet \quad $\displaystyle \sin (2a) = \frac{2\tan \ a}{1 + \tan ^2 a} $ \linebreak
\textbullet \quad $\displaystyle \cos (2a) = \frac{1 -\tan ^2 a}{1 + \tan ^2 a} $ \linebreak
\textbullet \quad $\displaystyle \tan ^2 a - \sin ^2 a = \tan ^2 a \cdot \sin ^2 a $ \linebreak
\textbullet \quad $\displaystyle \sin (a + b) \cdot \sin (a -b ) = \sin ^2 a - \sin ^2 b $ \linebreak
\textbullet \quad $\displaystyle \sin (3x) = 3\sin x - 4\sin ^3 x $ \linebreak
\textbullet \quad $\displaystyle \cos (3x) = 4\cos ^3 x - 3\cos x $ \linebreak
\textbullet \quad $\displaystyle \tan (3x) = 3\tan x - \tan ^3 x $ \linebreak
\textbullet \quad $\displaystyle \cot (nx) - \tan (nx) = 2\cot (2nx) $ \linebreak
\textbullet \quad $\displaystyle \cos (\sin ^{-1} (x) ) = \sin (cos ^{-1} (x)) = \sqrt{1 - x^2} $ \linebreak
\textbullet \quad $\displaystyle \tan (\sec ^{-1} (x) = \sqrt{x^2 - 1} $ \linebreak
\textbullet \quad $\displaystyle \cos (\tan ^{-1} (x)) = \frac{1}{\sqrt{1 + x^2}} $ \linebreak
\uline{ \textgreek{Ταυτότητες για στοιχεία τριγώνου}} \linebreak
\textbullet \quad $\displaystyle \tan A + \tan B + \tan C = \tan A \cdot \tan B \cdot \tan C $ \linebreak
\textbullet \quad $\displaystyle \sin A + \sin B + \sin C = 4\cos \frac{A}{2} \cdot \cos \frac{B}{2} \cdot \cos \frac{C}{2} $ \linebreak
\textbullet \quad $\displaystyle \cos A + \cos B + \cos C = 1 + 4\sin \frac{A}{2} \ \sin \frac{B}{2} \ \sin \frac{C}{2} $ \linebreak
\textbullet \quad $\displaystyle \sin 2A + \sin 2B + \sin 2C = 4 \sin A \ \sin B \ \sin C $ \linebreak
\textbullet \quad $\displaystyle \cos 2A + \cos 2B + cos2C = 1 - 4\cos A \ \cos B \ \cos C $ \linebreak
\textbullet \quad $\displaystyle \cot \frac{A}{2} + \cot \frac{B}{2} + \cot \frac{C}{2} = \ \cot \frac{A}{2} \cdot \cot \frac{B}{2} \cdot \cot \frac{C}{2} $ \linebreak
\textbullet \quad $\displaystyle \tan \frac{A}{2} \cdot \tan \frac{B}{2} + \tan \frac{B}{2} \cdot \tan \frac{C}{2} + \tan \frac{C}{2} \cdot \tan \frac{A}{2} = 1 $ \linebreak
\textbullet \quad $\displaystyle \cot A \cdot \cot B + \cot B \cdot \cot C + \cot C \cdot \cot A = 1 $ \linebreak
\textbullet \quad $\displaystyle \frac{a}{\sin A} = \frac{b}{\sin B} = \frac{c}{\sin C} = 2R $ \textgreek{: Νόμος Ημιτόνων,} \\ \textgreek{όπου} $R:$ \textgreek{ακτίνα περιγεγγραμένου κύκλου του τριγώνου.} \linebreak
\textgreek{Νόμος Συνημιτόνων} \linebreak
\textbullet \quad $\displaystyle a^2 = b^2 + c^2 -2bc\ \cos A $ \linebreak
\textbullet \quad $\displaystyle b^2 = a^2 + c^2 -2ac\ \cos B $ \linebreak
\textbullet \quad $\displaystyle c^2 = a^2 + b^2 -2ab \ \cos C $ \linebreak
\textbullet \quad $\displaystyle \frac{a-b}{a+ b} = \frac{\tan \frac{A-B}{2}}{\tan \frac{A+B}{2}} = \tan \left( \frac{A-B}{2} \right) \cdot \tan \left( \frac{C}{2} \right) $ \textgreek{: Νόμος Εφαπτομένων} \linebreak
- \textgreek{Με το νόμο των ημιτόνων μπορούμε να επιλύσουμε ένα τρίγωνο, όταν δίνονται 1. Μια πλευρά και δύο γωνίες του, ή 2. Δύο πλευρές και μια από τις μη περιεχόμενες γωνίες του} \linebreak
- \textgreek{Με το νόμο των συνημιτόνων μπορούμε να υπολογίσουμε μια οποιαδήποτε πλευρά ενός τριγώνου, αρκεί να δοθούν οι άλλες δύο και η περιεχόμενη τους γωνία.} \linebreak
- \textgreek{Ο νόμος εφαπτομένων μπορεί να χρησιμοποιηθεί σε ένα τρίγωνο, εάν δίνονται: 1. δύο πλευρές και η περιεχόμενη γωνία τους, ή 2. αν είναι γνωστές δύο γωνίες και μια πλευρά του} \linebreak
\textbullet \quad $\displaystyle \sin \left( \frac{\pi}{8} \right) = \frac{\sqrt{2 -\sqrt{2}}}{2} $ \linebreak
\textbullet \quad $\displaystyle \cos \left( \frac{\pi}{8} \right) = \frac{\sqrt{2 + \sqrt{2}}}{2} $ \linebreak
\textbullet \quad $\displaystyle \tan \left( \frac{\pi}{8} \right) = \sqrt{2} - 1 $ \linebreak
\textbullet \quad $\displaystyle \cot \left( \frac{\pi}{8} \right) = \sqrt{2} + 1 $ \linebreak
\textbullet \quad $\displaystyle \sin \left( \frac{\pi}{12} \right) = \frac{\sqrt{6} - \sqrt{2}}{4} $ \linebreak
\textbullet \quad $\displaystyle \cos \left( \frac{\pi}{12} \right) = \frac{\sqrt{6} - \sqrt{2}}{4} $ \linebreak
\textbullet \quad $\displaystyle \tan \left( \frac{\pi}{12} \right) = 2 - \sqrt{3} $ \linebreak
\textbullet \quad $\displaystyle \cot \left( \frac{\pi}{12} \right) = 2 + \sqrt{3} $ \linebreak
\pagebreak
\section{Proofs}
A proof is a method for ascertaining truth. \linebreak
A mathematical proof is a verification of a proposition, by a chain of logical deductions from a set of axioms. \linebreak
Good proofs have seven characteristics (CCC-BE-OO). They are:
\begin{itemize}
\item correct
\item complete
\item clear
\item brief
\item elegant
\item (well) organized
\item ordered
\end{itemize}
\subsection{Proof Techniques}
\textbullet \quad To prove a \uline{Goal} of the form:
\begin{enumerate}
\item $\lnot P$ : a) Reexpress it as a positive statement \linebreak
b) Use proof by contradiction, i.e. assume $P$ and try to reach a contradiction.
\item $P \rightarrow Q$ : a) Assume $P$ is true and prove $Q$. \linebreak
b) Prove the contrapositive, i.e. assume $Q$ is false and prove that $P$ is false.
\item $P\land Q $ : Prove $P$ and $Q$ separately. In other words treat $P$ and $Q$ as two separate goals.
\item $P \lor Q$ : a) Assume $P$ is false and prove $Q$, or assume $Q$ is false and prove $P$. \linebreak
b) Use proof by cases. In each case either prove $P$, or prove $Q$.
\item $P \leftrightarrow Q$ : prove $P \rightarrow Q$ and $Q \rightarrow P $.
\item $\forall x P(x)$ : Let $x$ stand for an arbitrary object and prove $P(x)$. (if the letter $x$ already stands for something in the proof, you will have to use a different letter.)
\item $\exists x P(x)$ : Find a value of $x$ that makes $P(x)$ true. Prove $P(x)$ for this value of $x$.
\item $\exists ! xP(x)$ : \linebreak
a) Prove $\exists xP(x)$ (existence) and $\displaystyle \lnot y\left(P(y) \land y \neq x \right) $ (uniqueness). \linebreak
b) Prove the equivalent statement $ \exists x \left[P(x) \land \forall y(P(y) \rightarrow y = x) \right] $, or some other similar one.
\item $\forall n \in \mathbb{N} P(n)$ : a) Mathematical Induction: Prove $P(0)$ (base case) and $\displaystyle \forall n \in \mathbb{N} (P(n) \rightarrow P(n+1)) $ (inductive step). \linebreak
b) Strong Induction: Prove $\displaystyle \forall n \in \mathbb{N} \left[ (\forall i < n P(i)) \rightarrow P(n) \right] $. \linebreak
We can prove a stronger form of an induction, thus proving the more lenient form. \linebreak
\end{enumerate}
\textbullet \quad To use a \uline{Given} of the form:
\begin{enumerate}
\item $\lnot P$ : a) Reexpress as a positive statement. \linebreak
b) In a proof by contradiction you can reach a contradiction by proving $P$.
\item $P \rightarrow Q$ : a) If you are also given $P$, or you can prove that $P$ is true, then you can conclude that $Q$ is true. \linebreak b) Use the contrapositive.
\item $P \land Q$ : Treat this as two givens $P$ and $Q$.
\item $P \lor Q$ : a) Use proof by cases. In case 1 assume $P$ and in case 2 assume $Q$. \linebreak
b) If you are also given $\lnot P$, or you can prove $\lnot P$ then you can conclude $Q$. Similarly, if you know $\lnot Q$, then you can conclude $P$.
\item $P \leftrightarrow Q$ : Treat this as two givens: $P \rightarrow Q$ and $Q\rightarrow P$.
\item $\forall x P(x)$ : You can plug in any value, say $a$, for $x$, and conclude $P(a)$.
\item $\exists x P(x)$ : Introduce a new variable, say $x_0$, into the proof, to stand for a parrticular object for which $P(x_0)$ is true. \linebreak
\end{enumerate}
\textbullet \quad Techniques that can be used in any proof:
\begin{enumerate}
\item Proof by Contradiction: Assume the goal is false and derive a contradiction.
\item Proof by Cases: Consider several cases that are exhaustive, i.e. that include all the posibilities. Prove the goal in each case.\linebreak
\end{enumerate}
\subsection{Problem Solving}
\uline{Methodology - 4 Phases}
\begin{enumerate}
\item Understand the problem. See clearly what is required.
\item Figure out how the various items are connected, how the unknown is linked to the data, in order to obtain the idea of the solution, to make a plan.
\item Carry out the plan.
\item Look back at the completed solution, review, examine and discuss it. This way we consolidate our knowledge and develop our ability to solve problems. \linebreak
\end{enumerate}
\uline{Key suggestions} \linebreak
{\color{red} Rephrase your problem. This will provide a different perspective, which will stimulate your brain cells and awaken more memories and ideas from slumber}.
\begin{itemize}
\item Did you examine all the data \textbf{(p.t.f.)} / the hypothesis \textbf{(p.t.p)} ?
\item Did you use the whole condition (what links the data to the unknown) ?
\item If at first it doesn't seem possible to satisfy the complete solution, we have two options. Whether we can solve a related (simpler analogous) problem and whether we can solve a part of the original problem.
\item Restate the givens in order for them to match some mathematical definition. Having used the definition you eliminate the technical term. Then proceed using the definition. Can you restate the problem still differently ?
\item At first visualize the problem as a whole as clearly and as vividly as you can. Do not concern yourself with details.
\item Isolate the principal parts of the problem. The hypothesis and the conclusion are the principal parts of a "problem to prove". The unknown, the data and the conditions are the principal parts of a "problem to find". Go through the principal parts of the problem. Consider them one by one, consider them in turn, consider them in various combinations, relating each detail to other details and each to the whole of the problem.
\item Start when you feel sure of your grasp of the main connection and you feel confident that you can supply the minor details that may be needed.
\item Convince yourself about the correctness of each step by formal reasoning, or by intuitive insight, or both ways if you can.
\item If your problem is very complex you may distinguish "great" steps and "small" ones. First check the great steps and get down to the smaller ones afterwards. Can you see \uline{clearly} that the step is correct ? Yes, i can see it clearly and distinctly. Intuition is ahead, but could formal reasoning overtake it ? Can you also PROVE that it is correct ?
\item When you reach the result, scrutinize the method that led you to the solution, try to see its point and try to make use of it for other problems.
\item If you cannot solve the proposed problem try to solve first some related problem.
\item Solve by Generalization, Specialization, Analogy, Decomposing and Recombining.
\begin{itemize}
\item Generalization: Pick from the set an object that does not comply with it.
\item Specialization: find a special case of the original problem.
\end{itemize}
\item Look for other hints and clues that may have been stated in the problem. \uline{Read the problem carefully}. \linebreak
\end{itemize}
\uline{Possible ways for solving problems}
\begin{itemize}
\item Inference by analogy.
\item Inference by induction (induction is naturally based on analogy). Induction tries to find regularity and coherence behind the observations. Its most conspicuous instruments are generalization, specialization, analogy.
\item Analysis (or solution backwards, or regressive reasoning). We start from what is required, we take it for granted. We inquire from what antecedent the desired result could be derived. We pass from antecedent to antecedent, until we eventually come upon something already known or admittedly true.
\item Synthesis (or progressive reasoning). We start from the point which we reached last of all in the analysis, from the thing already known or admittedly true. We derive from it what preceded it in the analysis and go on making derivations until we finally succeed in arriving to what is required. Synthesis retraces faithfully the steps of the analysis. \linebreak
\end{itemize}
\textbf{Remember}
\begin{itemize}
\item We cannot hope to solve any worthwhile problem without intense concentration. In order to keep the attention alive, the object on which it is directed must unceasingly change.
\item Don't rush, or you will most certainly make mistakes. Be calm and carry on.
\item First check for any constrictions that must be set before starting up the problem. \linebreak
\end{itemize}
\subsubsection{Analytical vs Numerical solutions}
\begin{enumerate}
\item Analytical solutions can be obtained exactly with pencil and paper,
\item Numerical solutions cannot be obtained exactly in finite time and typically cannot be solved using pencil and paper.
\end{enumerate}
\pagebreak
\section{Relations}
\textbullet \quad The set $R$ is a relation from $A$ to $B$ : $R\subset A \times B$ \linebreak
\textbullet \quad Domain of $R$ is the set: $\Dom (F) = \{ a \in A | \exists b \in B ((a,b) \in B) \} $ \linebreak
\textbullet \quad Range of $R$ is the set: $\Ran (R) = \{ b \in B | \exists a \in A ((a,b) \in R) \} $ \linebreak
\textbullet \quad Inverse of $R$ is the relation $R^{-1}$ from $B$ to $A$, defined as: $\displaystyle R^{-1} = \{(b,a) \in B \times A | (a,b) \in R\} $ \linebreak
\textbullet \quad Composition of sets $\displaystyle R \subset A \times B$ and $\displaystyle S \subset B \times C$ is the relation: $\displaystyle S \circ R = \{(a,c) \in A \times C | \exists b \in B ( (a,b) \in R \land (b, c) \in S ) \} $ \linebreak
Alternative notations for $(a,b) \in R$ are $aRb,\ R(a,b)$. \linebreak
\textbullet \quad Also $\displaystyle (a,c) \in A \times C \begin{cases}
\quad (a,b) \in R \land (b, c) \in S \rightarrow (a,c) \in (S \circ R) \\
or, \ (b,c) \in S \land (a,bc) \in R \rightarrow (a,c) \in (S \circ R) \\
or, \ (a,b) \in R \land (b, c) \notin S \rightarrow (S \circ R)
\end{cases}$ \linebreak
\textbullet \quad $(R^{-1})^{-1} = R$ \linebreak
\textbullet \quad $(\Dom(R^{-1}) = \Ran(R) $ \linebreak
\textbullet \quad $(\Ran(R^{-1}) = \Dom (R) $ \linebreak
\textbullet \quad $ T \circ (S \circ R) = (R \circ S) \circ R $ \linebreak
\textbullet \quad $ (S \circ R)^{-1} = R^{-1} \circ S^{-1} $ \linebreak
\textbullet \quad If $A$ is a set, then $\displaystyle i_A = \{(x,y) \in A \times A | x = y \}$ is the identity relation on $A$. Every element of $A$ is related to itself \uline{only}. \begin{small}e.g. $\displaystyle A=\{1,2,3\} \rightarrow i_A = \{(1,1),(2,2),(3,3)\}\ $] \linebreak \end{small}
\textbullet \quad Suppose $R$ is a binary relation on $A$ (i.e. $\displaystyle R \subset A\times A = A^2$). Then $R$ is \uline{reflexive} (on $A$), if $\displaystyle \forall x \in A \left[(x,x) \in R \right]$, i.e. every element of $A$ is related to itself. Alternatively, $R$ is reflexive iff $i_A \subset R$ \linebreak
\textbullet \quad $R$ is \uline{symmetric}, if $\displaystyle \forall x, y \in A \left[ (x,y) \in R \rightarrow(y,x) \in R \right]$. Alternatively, $R$ is symmetric iff $R= R^{-1}$. \linebreak
\textbullet \quad $R$ is \uline{transitive}, if $\displaystyle \forall x,y,z \in A \left[ (xRy \land yRz) \rightarrow xRz \right]$. Alternatively, $R$ is transitive iff $R\circ \subset R$. \linebreak
\textbullet \quad $R$ is \uline{antisymmetric}, if $\displaystyle \forall a, b \in A \left[ (a,b) \in R \land (b,a) \in R \rightarrow a = b \right]$. Alternatively, $R$ is antisymmetric if $\displaystyle \forall a,b \in A \left[ R(a,b) \land a\neq b \rightarrow \lnot R(b,a) \right] $ \linebreak
\textbullet \quad $R$ is \uline{asymmetric}, if $\displaystyle \forall a, b \in A (aRb \rightarrow \lnot bRa ) $ \linebreak
\textbullet \quad A relation $\displaystyle R\subset A \times A$ is called a \uline{partial order} (on $A$), if it is
\begin{enumerate}
\item reflexive,
\item transitive and
\item antisymmetric.
\end{enumerate}
In a particular context, it can be stated that $R$ is a partial order (on $A$), if an object can be at least as large as another. \linebreak
\textbullet \quad A relation $\displaystyle R\subset A \times A$ is called a \uline{total order}, if it is a partial order and in addition it has the property: $\displaystyle \forall x,y \in A \ (xRy \lor yRx)$. \linebreak
\textbullet \quad Two distinct elements are called "\uline{comparable}" when one of them is greater than the other. This is the definition of "comparable". When you have a partially ordered set, some pairs of elements can be not comparable. i.e. you can have two elements $x$ and $y$ such that $x\leq y$ is false and $y\leq x$ is also false. A total order ensures that all items of this set are comparable. \linebreak
\textbullet \quad A relation $\displaystyle R \subset A \times A$ is called a \uline{preorder} if it is
\begin{enumerate}
\item reflexive and
\item transitive.
\end{enumerate}
\textbullet \quad A \uline{binary relation} $R$ is a relation on a set $A$, i.e. $R\subset A \times A$, or $R \subset A^2$. Thus it is a collection of ordered pairs of elements of $A$. The terms correspondence, dyadic relation and 2-place relation are synonyms for binary relation. \linebreak
\textbullet \quad $R$ is called an \uline{equivalence relation} (on $A$) if it is
\begin{enumerate}
\item reflexive,
\item symmetric and
\item transitive.
\end{enumerate}
\textbullet \quad Suppose $R$ is a partial order on a set $A,B \subset A, \ b\in B$ and $a\in A$. Then
\begin{itemize} %[leftmargin=1em]
\renewcommand{\labelitemi}{$\rightarrow$}
\item $b$ is called an $R$-smallest element of $B$, if $\forall x \in B \left[ (b,x) \in R \right]$.
\item $b$ is called an $R$-minimal element of $B$, if $\lnot \exists x\in B (xRb \land x \neq b) $.
\item $b$ is the largest element of $B$, if $\forall x \in B (xRb)$. Alternatively for set theory, $S$ is the largest set of the family $ \mathcal{F}: \exists S \in \mathcal{F} \ \forall T\in \mathcal{F} (T \subset S) $.
\item $b$ is a maximal element of $B$, if $\lnot \exists x \in B (bRx \land x\neq b)$.
\item $a$ is called a lower bound for $B$, if $\forall x \in B (aRx)$
\item $a$ is called an upper bound for $B$, if $\forall x \in B (xRa)$
\end{itemize}
\textbullet \quad Let $U$ be the set of all upper bounds for $B$ and let $L$ be the set of all lower bounds. Then
\begin{itemize}
\renewcommand{\labelitemi}{$\rightarrow$}
\item if $U$ has a smallest element, then this smallest element is called the least upper bound (l.u.b.) of $B$.
\item if $L$ has a largest element, then this largest element is called the greatest lower bound (g.l.b) of $B$.
\end{itemize}
\subsection{Closures}
\textbullet \quad A relation $S \subset A \times A$ is the \uline{reflexive closure} of $R$ if it has the following 3 properties:
\begin{enumerate}
\item $R \subset S$,
\item $S$ is reflexive,
\item for every relation $T \subset A \times A$, if $R \subset T$ and $T$ is reflexive, then $S \subset T$.
\end{enumerate}
\textbullet \quad Auseful reflexive closure: $S = R\cup i_A $ \linebreak
\textbullet \quad A relation $S \subset A \times A$ is the \uline{symmetric closure} of $R$, if:
\begin{enumerate}
\item $R\subset S$,
\item $S$ is symmetric,
\item for every relation $T\subset A \times A$, if $R\subset T$ and $T$ is symmetric, then $S \subset T$.
\end{enumerate}
\textbullet \quad Useful symmetric closure: $S = R \cup R^{-1}$ \linebreak
\textbullet \quad A relation $S \subset A \times A$ is the \uline{transitive closure} of $R$, if:
\begin{enumerate}
\item $R \subset S$,
\item $S$ is transitive,
\item For every relation $T\subset A \times A$, if $R \subset T$ and $T$ is transitive, then $S \subset T$.
\end{enumerate}
\textbullet \quad Suppose $R$ is a relation on $A$. Then $R$ is said to be \uline{irreflexive} if $\forall x \in A \left[(x,x) \notin R \right]$. \linebreak
\textbullet \quad $R\subset A \times A$ is called a \uline{strict partial order} if it is irreflexive and transitive. \linebreak
\textbullet \quad $R\subset A \times A$ is called a \uline{strict total order} if it is a strict partial order and in addition it satisfies the \uline{requirement of trichotomy}: $\displaystyle \forall x, y \in A (xRy \lor yRx \lor x=y) $ \linebreak
\textbullet \quad Suppose $R$ is an equivalence relation on a set $A$ and $x \in A$. Then the \uline{equivalence class} of $x$ with respect to $R$ is the set $\displaystyle [x]_R = \{ y\in A | yRx \}$ (or $[x]$ if $R$ is clear from contect). \linebreak
\textbullet \quad The set of all equivalence classes of elements of $A$ is called $A$ modulo $R$ and it is denoted by $A \ R$. Thus, $\displaystyle A/R = \{[x]_R \ | x \in A \} = \{ X \subset A | \exists x \in A ( X = [x]_R ) \} $. \linebreak
\textbullet \quad Suppose $A$ is a set and $\mathcal{F} \subset P(A)$. We will say that $\mathcal{F}$ is pairwise disjoint if every pair of distinct elements of $\mathcal{F}$ are disjoint, or in other words: $\displaystyle \forall X, Y \in \mathcal{F} \left(X \neq Y \rightarrow X \cap Y = \emptyset \right)$. \linebreak
\textbullet \quad $\mathcal{F}$ is called a partition of $A$ if it has the following properties:
\begin{enumerate}
\item $\cup \mathcal{F} = A$,
\item $\mathcal{F}$ is pairwise disjoint,
\item $\forall X \in \mathcal{F} \left(X\neq \subset \right) $
\end{enumerate}
\textbullet \quad Suppose $R$ is an equivalence relation on $A$. Then:
\begin{itemize}
\renewcommand{\labelitemi}{$\rightarrow$}
\item $\forall x \in A \ x\in [x]$ i.e. $xRx$ (or $z \in [y] \rightarrow zRy )$
\item $\forall x,y \in A\ (y \in [x]$ iff $[y] = [x]$ \linebreak
\end{itemize}
\textbullet \quad $\displaystyle C_m = \{ (x,y) \in \mathbb{Z} \times \mathbb{Z} | x \equiv y(\mod m) \}$ is an equivalence relation on $\mathbb{Z} $. \linebreak
\textbullet \quad There is an equivalence relation $R$ on $A$ such that $A/R = \mathcal{F}$. \linebreak
\pagebreak
\section{Functions}
\textbullet \quad $f(x) = g(x)$ : \uline{Equivalence}. An equality of functions \linebreak
\textbullet \quad $x^2 = 25$ : \uline{Equation}. The equality holds only for a few values of $x$! \linebreak
\textbullet \quad Suppose $f$ is a relation from $A$ to $B$. Then $f$ is called a function from $A$ to $B$, denoted as $\displaystyle f: A\rightarrow B$, if $\forall a \in A \exists ! b \in B \left[(a,b) \in f \right]$. $\Dom(f) = A, \ \Ran(f) = \{f(a) | a\in A\} \subset B$. \linebreak
\textbullet \quad In contrast with a function, a mapping is a relation which may map an element of its domain to multiple elements of its range. \linebreak
\textbullet \quad $\displaystyle \forall a \in A \ \forall b\in B (b = f(a) \leftrightarrow (a,b) \in f) $, $b$ is the value of $f$ at $a$, of "$f$ of $a$".\linebreak
\textbullet \quad \textgreek{Δύο συναρτήσεις} $f,g$ \textgreek{λέγονται} \uline{\textgreek{ίσες}} \textgreek{όταν}
\begin{itemize}
\renewcommand{\labelitemi}{$\rightarrow$}
\item \textgreek{έχουν το ίδιο πεδίο ορισμού} $A$
\item $\forall x \in A (f(x) = g(x))$
\end{itemize}
\textbullet \quad \textgreek{Αν $f, g$ είναι δύο συναρτήσεις με πεδίο ορισμού} $A, B$ \textgreek{αντιστοίχως, τότε ονομάζουμε \uline{σύνθεση της $f$ με την $g$} και τη συμβολίζουμε με} $g\circ f$, \textgreek{τη συνάρτηση}: $\displaystyle g \circ f = (g \circ f)(x) = g(f(x))$. \linebreak
\textgreek{Η} $g\circ f$ \textgreek{ορίζεται εφόσον} $A \neq \emptyset$, \textgreek{όπου} $A = \Dom(f)$. \textgreek{Αν ορίζεται και η} $f\circ g = f(g(x))$, \textgreek{τότε οι} $f\circ g$ \textgreek{και} $g\circ g$ \textgreek{δεν είναι υποχρεωτικά ίσες}. \linebreak
\textbullet \quad \textgreek{Αν} $f,g,h$ \textgreek{είναι τρείς συναρτήσεις και ορίζεται η} $h \circ (g\circ f)$, \textgreek{τότε ορίζεται και η} $(h\circ g) \circ f$ \textgreek{και ισχύει}: $\displaystyle h\circ (g\circ f) = (h\circ g) \circ f$. \textgreek{Τη συνάρτηση αυτή τη λέμε σύνθεση των} $f, g$ \textgreek{και} $h$ \textgreek{και τη συμβολίζουμε με} $\displaystyle h\circ g \circ f$. \linebreak
\textbullet \quad $\displaystyle f \uparrow \Delta$ , $\Delta \subset \Dom (f)$, \textgreek{όταν} $\forall x_1, x_2 \in \Delta [x_1 < x_2 \rightarrow f(x_1) < f(x_2)] \ \ f$ \textgreek{γνησίως αύξουσα συνάρτηση} / increasing function. \linebreak
\textbullet \quad $\displaystyle f \downarrow \Delta$, $\Delta \subset\Dom (f)$, \textgreek{όταν} $\forall x_1, x_2 \in \Delta [ x_1 < x_2 \rightarrow f(x_1) > f(x_2) ] \ \ f$ \textgreek{γνησίως φθίνουσα συνάρτηση} / decreasing function. \linebreak
\textbullet \quad \textgreek{Έστω} $f, A = \Dom (f)$ :
\begin{itemize}
\renewcommand{\labelitemi}{$\rightarrow$}
\item $\displaystyle \forall x \in A [ \exists ! x_0 \in A (f(x_0) \leq f(x) ) \rightarrow f(x_0) = \min (f(x)) ] $
\item $\displaystyle \forall x \in A [ \exists ! x_0 \in A (f(x_0) \geq f(x)) \rightarrow f(x_0) = \max (f(x)) ] $
\end{itemize}
\textbullet \quad \textgreek{Έστω} $f: A \rightarrow \mathbb{R}$. \textgreek{Αν υπάρχει η αντίστροφη της} $g: f(A) \rightarrow \mathbb{R}$ \textgreek{έχουμε}: $f(x) = y \leftrightarrow f^{-1} (y) = x$. \linebreak
\textbullet \quad \textgreek{Οι γραφικές παραστάσεις των} $f$ \textgreek{και} $f^{-1}$ \textgreek{είναι συμμετρικές ως προς την ευθεία}: $y=x$. \linebreak
\textbullet \quad Suppose $f$ and $g$ are functions from $A$ to $B$. If $\forall a \in A(f(a) = g(a))$, then $f=g$. \linebreak
\textbullet \quad Suppose $f: A \rightarrow B $ and $g: B\rightarrow C$. Then $g\circ f: A \rightarrow C$ and $\forall a\in A$, the value of $g \circ f$ at $a$ is given by the formula $(g\circ f)(a) = g(f(a))$. \linebreak
$\big[(a,c) \in g\circ f, \text{so} (g\circ f)(a) = c = g(b) = g(f(a)) \big] $ \linebreak
\textbullet \quad Suppose $f: A \rightarrow B$ and $C \subset A$. The set $f\cap (C \times B)$, which is a relation from $C$ to $B$ is called a \uline{restriction} of $f$ to $C$, denoted as $f \upharpoonright C$. In other words $ f\upharpoonright C = f\cap (C \times B)$. The restriction is obtained by choosing a smaller domain for the original function. \linebreak
\textbullet \quad Suppose $f:A\rightarrow A \left[ \exists a \in A \ \forall X \in A (f(x) = a) \right] \rightarrow f$ is called a constant function. \linebreak
\textbullet \quad Let $f: \mathbb{R} \rightarrow \mathbb{R}$ and $g: \mathbb{R} \rightarrow \mathbb{R}$. We say that "$f$ is big-oh of $g$" and write $f(x) = O(g(x))$, to describe the limiting behavior of a function when the argument tends towards a particular value or infinity, usually in terms of simpler functions. So:
\begin{enumerate}
\item $f= O(\phi)$ means that $|f| < A \times \phi$, for some constant $A$ and all values of $x$.
\item $f = o(\phi)$ means that $f/\phi \rightarrow 0$.
\end{enumerate}
$O(x)$ and $o(x)$ are the Landau symbols. \linebreak
\textbullet \quad A description of a function in terms of big O notation usually only provides an upper bound on the growth rate of the function. \linebreak
\textbullet \quad Suppose $f: A \rightarrow B$. We will say that $f$ is one-to-one (\textgreek{ένα προς ένα}), or $1-1$, or injection, or injective if $\lnot \exists a_1, a_2 \in A (f(a_1) = f(a_2) \land a_1 \neq a_2) $. The situtation that must not occur is that there are two different elements of the domain of $f$, $a_1$ and $a_2$, such that $f(a_1) = f(a_2)$ \linebreak
\textbullet \quad Suppose $f: A \rightarrow B$. We say that $f$ is onto, or surjection, or subjective if $\forall b \in B \exists a \in A (f(a) = b) $. \linebreak This means that every element of $B$ is the image under $f$ of some element of $A$ (\textgreek{μονοσήμαντη}). \linebreak
The definitions that follow are equivalent to those of one-to-one and onto.
\begin{itemize}
\renewcommand{\labelitemi}{$\rightarrow$}
\item $f$ is one-to-one iff $\displaystyle \forall a_1, a_2 \in A (f(a_1) = f(a_2) \rightarrow a_1 = a_2 ) $
\item $f$ is onto iff $\Ran(f) = B$
\end{itemize}
\textbullet \quad Suppose $f: A \rightarrow B$ and $g: B \rightarrow C$. It follows $f \circ f: A \rightarrow C $.
\begin{itemize}
\renewcommand{\labelitemi}{$\rightarrow$}
\item If $f$ and $g$ are both $1-1$, then so if $g\circ f$.
\item If $f$ and $g$ are both onto, then so is $g\circ f$.
\end{itemize}
\textbullet \quad Functions that are both one-to-one and onto are called bijections, or bijectives, or one-to-one correspondences ($1-1$ \textgreek{και επί}). Such a function is invertible. \linebreak
\textbullet \quad Suppose $f: A\rightarrow B$. Then the following statements are equivalent:
\begin{enumerate}
\item $f$ is one-to-one and onto,
\item $f^{-1}: B \rightarrow A$,
\item There is a function $g:B\rightarrow A$ such that $g\circ f = i_A (A \rightarrow B \rightarrow A)$ and $f\circ g = i_b (B\rightarrow A \rightarrow b)$.
\end{enumerate}
\textbullet \quad Suppose $g: B \rightarrow A$. Then $g = i_A \circ g = g \circ i_B$ \linebreak
\textbullet \quad Suppose $f: A \rightarrow B$. If there exists a function $g: B\rightarrow A$ such that $g \circ f = i_A$ and $f\circ g = i_B$ then $f$ is one-to-one and onto and $g=f^{-1}$. \linebreak
\textbullet \quad If there is a function $g:B \rightarrow A$ such that $g\circ f = i_A$ then $f$ is one-to-one. \linebreak
\textbullet \quad If there is a function $g:B \rightarrow A$ such that $f\circ g = i_B$ then $f$ is onto. \linebreak
\textbullet \quad Suppose $f:A \rightarrow B$ and $X \subset A$. Then the image of $X$ under $f$ is the set $f(X)$ defined as follows: \linebreak $f(X) = \{f(x) | x \in X \} = \{ b \in B | \exists x \in X (f(x) = b) \} $ \linebreak
If $Y \subset B$, then the inverse image of $Y$ under $f$ is the set $f^{-1} (Y)$ defined as follows: \linebreak
$f^{-1}(Y) = \{ a \in A | f(a) \in Y \}$ \linebreak
\textbullet \quad Suppose $f: A \rightarrow B$ and $W$ and $X$ are subsets of $A$. Then $\displaystyle f(W \cap X) \subset f(W) \cap f(X)$. Furthermore, if $f$ is one-to-one, then $\displaystyle f(W\cap X) = f(W) \cap f(X)$. \linebreak
\uline{Algebraic properties of functions} \linebreak
\textbullet \quad Functions shifted Left / Right: Given a function $f(x)$ and a value $c>0$, the graph of $f(x+c) / f(x-c)$ will be a shift of the graph of $f(x)$ left / right by "$c$" units. \linebreak
\textbullet \quad Functions shifted Up / Down: Given a function $f(x)$ and a value $c > 0 $, the graph of $f(x) + c / f(x) - c$ will be a shift of the graph of $f(x)$ up / down by "$c$" units. \linebreak
\textbullet \quad Functions vertically scaled: Given function $f(x)$, the function $a\cdot f(x)$ will stretch all $y$-values of $f(x)$ by multiplying each one by $a \in \mathbb{R}$. \linebreak
\textbullet \quad Functions horizontally scaled: Given function $f(x)$, the function $f(\alpha x)$ will adjust all $x$-values of $f(x)$, by multiplying each one by $a$. \linebreak
\textbullet \quad A scale is a non-rigid translation in that it does alter the shape and size of the function graph. \linebreak
\textbullet \quad Not all functions are even, or odd, but most can be written as a sum of an even part $f_e$ and an odd $f_0$ part. Every function $f$ can be written: $\displaystyle f(x) = f_e(x) + f_0(x)$ \linebreak
$$f_e(x) = \frac{f(x) + f(-x)}{2} \quad \land \quad f_0(x) = \frac{f(x) - f(-x)}{2} $$
\textbullet \quad A continuous function is, roughly speaking, a function for which sufficiently small changes in the input results in arbitrarily small changes in the output. \linebreak
\textbullet \quad $ax^2 + bx +c = 0, \ a\neq 0$ : Trinomial \linebreak
$\displaystyle S = x_1 + x_2 = -\frac{b}{a} \quad \land P = x_1 \cdot x_2 = \frac{c}{a} $ : \textgreek{Τύποι του} Vieta \linebreak
$\displaystyle \therefore a(x-x_1)(x-x_2) = 0$ \linebreak
$\displaystyle x^2 -(x_1 + x_2) x + x_1 x_2 = 0 \leftrightarrow x^2 - Sx + P = 0 $ \linebreak
\textbullet \quad \textgreek{Λογαριθμική συνάρτηση με βάση} $a$ \textgreek{είναι η} $\displaystyle f:(0,+\infty) \rightarrow \mathbb{R}$, \textgreek{με} $\displaystyle f(x) - \log_a x$ \linebreak
\textbullet \quad \textgreek{Εκθετική μεταβολή}: $\displaystyle Q(t) = Q_0 e^{ct}$ \qquad ($c>0$ : \textgreek{εκθετική άυξηση} $ \lor $ ($c>0$ : \textgreek{εκθετική απόσβεση}) \linebreak
$Q_0$ : \textgreek{αρχική τιμή} $@ t=0$ \linebreak
\textbullet \quad Factorization of Quadratic $ax^2 +bx +c$, when $a=1$
\begin{itemize}
\renewcommand{\labelitemi}{$\rightarrow$}
\item if $c$ is positive: a) $f_1, f_2$ are factors of $c$ and both have the sign of $b$,
b) The sum of $f_1$ and $f_2$ is $b$
\item if $c$ is negative: a) $f_1, f_2$ are factors of $c$ and have opposite signs, the numerically larger having sign of $b$,
b) the difference between $f_1$ \& $f_2$ ish
We finally denote them as $\displaystyle (x-f_1)(x-f_2)$
\end{itemize}
\textbullet \quad Factorization of Quadratic $ax^2 + bx +c$, when $a\neq 1$.
\begin{itemize}
\renewcommand{\labelitemi}{$\rightarrow$}
\item We obtain $|ac|$
\item We write down all the possible factors of $|ac|$.
\item We follow similar procedure as above
\item Once we find $f_1, f_2$ we write them: $\displaystyle ax^2 +f_1 x+ f_2 x + c$ and then this is factorised by grouping.
\end{itemize}
\textbullet \quad If $\displaystyle D=b^2 -4ac$ is a perfect square, the quadratic has 2 simple factors. \linebreak
\subsection{Even and Odd functions}
\textbullet \quad Not every function is even, or odd but many can be written as the sum of an even part and an odd part, like so: \linebreak
for $f(x)$ : $\displaystyle f_e(x) = \frac{f(x) + f(-x)}{2} \ \land \ f_0(x) = \frac{f(x) - f(-x)}{2} $ \linebreak
\uline{Properties} \linebreak
Properties involving Addition and Subtraction \linebreak
\textbullet \quad Odd functions are symmetric in the 1st and 3rd quadrants. \linebreak
\textbullet \quad If a function is odd, its absolute value is even. \linebreak
\textbullet \quad The sum of two even | odd functions is even | odd and any constant multiple of an even | odd function is even | odd. \linebreak
\textbullet \quad The difference between two even odd functions is even | odd. \linebreak
\textbullet \quad The sum of an even and an odd function is neither even, nor odd. \linebreak
Properties involving Multiplication and Division: \linebreak
\textbullet \quad The product of two even | odd functions is an even | odd function \linebreak
\textbullet \quad The product of an even function and an odd function is an odd function \linebreak
\textbullet \quad The quotient of two even | odd functions is an even | even function \linebreak
\textbullet \quad The quotient of an even function and an odd function is an odd function \linebreak
Properties involving Composition: \linebreak
\textbullet \quad The composition of two even | odd functions is even | odd. \linebreak
\textbullet \quad The composition of an even function and an odd function is even. \linebreak
\textbullet \quad The composition of either an odd, or an even function with an even function is even (but not vice versa). \linebreak
Calculus Properties: \linebreak
\textbullet \quad The derivative of an even | odd function is odd | even. \linebreak
\textbullet \quad The integral of an odd function from -A to A is zero (where A is finite and the function has no vertical asymptotes between -A and A). \linebreak
\textbullet \quad The integral of an even function from -A to A is twice the integral from 0 to +A (where A is finite and the function has no vertical asymptotes between -A and A. This also holds true, when A is infinite, but only if the integral converges). \linebreak
(The integral of a function is the set of all its antiderivatives.) \linebreak
Series Properties: \linebreak
\textbullet \quad The MacLaurin series of an even | odd function includes only even | odd powers. \linebreak
\textbullet \quad The Fourier series of a periodic even | odd function includes only consine | sine terms (If it is even it also includes $a_0$ which may be regarded as $a_n\cos (nx)$ with $n=0$.) \linebreak
Periodicity: \linebreak
\textbullet \quad If $f(x)=f(x+\pi)$, the Fourier series for $f(x)$ contains only even harmonics (cosine \& sine). \linebreak
\textbullet \quad If $f(x) = -f(x+ \pi)$, the Fourier series for $f(x)$ contains only odd harmonics. \linebreak
\pagebreak
\section{Graph Theory}
\textbullet \quad A graph is a nonempty finite set of vertices, along with a set $E$ of $2$-element subsets of $V$. The elements of $V$ are called vertices, the elements of $E$ are called edges. \linebreak
\uline{Example} \linebreak
The graph G (\figref{graphG}) is not a regular graph, because it has loop $V_1$ around a vertex. Such graphs, with loops, are called multigraphs. \linebreak
\begin{figure}[H]
\centering
\includegraphics[scale=2]{graphG}
\caption{Graph G}
\label{fig:graphG}
\end{figure}
Vertex set: $\displaystyle V = \left\{ V_1, V_2, V_3, V_4, V_5, V_6 \right\}$ \linebreak
Edge set: $\displaystyle E= \left\{ \{V_1,V_2\}, \{V_1,V_3\}, \{V_1, V_4\}, \{V_4, V_5\}, \{V_5, V_6\} \right\}$ defines sets of edges, ie. vertices directly connecting each other. \linebreak
\textbullet \quad \uline{Cardinality} of a graph is the number of its vertices. eg. $|G| = 6$ \linebreak
\textbullet \quad \uline{Degree of }$\uline{V_1} = \deg (V_1) = 3$ : The degree of a vertex, say $V_1$ (Graph G), is the number of vertices it is directly connected with. \linebreak
\textbullet \quad The edges don't need to be straight, as long as the connections are preserved. Such graphs are called \uline{isomorphic}. For example, graphs G and G' are isomorphic. \linebreak
\begin{figure}[H]
\centering
\includegraphics[scale=1]{graphG_}
\caption{Graph G'}
\label{fig:graphG_}
\end{figure}
\textbullet \quad \uline{Adjacency List}: We list vertices adjacent to each vertex. eg. For graph G, we have: \linebreak
$V_1: V_2, V_3, V_4$ \linebreak
$V_2: V_1$ \linebreak
$V_3: V_1$ \linebreak
$V_4: V_1, V_5$ \linebreak
$V_5: V_4, V_6$ \linebreak
$V_6: V_5$ \linebreak
\textbullet \quad \uline{Adjacency Matrix}: In every place of the matrix we insert a $1$, if there is a connection between the corresponding vertices, or a $0$ if there is not. For graph G, the adjacency matrix is the one pictured below (\figref{adjacencyMatricGraphG}) \linebreak
\begin{figure}[ht]
\centering
\includegraphics[scale=1]{adjacencyMatricGraphG}
\caption{Adjacency Matric for the Graph G}
\label{fig:adjacencyMatricGraphG}
\end{figure}
\textbullet \quad Graph C below (\figref{graphC}) is called a circuit, because there is at least one vertex, say D, from which we can start and without ever backtracking or lifting the pen, we can return back to it through a route, specified by the edges of the graph. Possible routes in this case are DABCD, DCBAD. \linebreak
\begin{figure}[ht]
\centering
\includegraphics[scale=1]{graphC}
\caption{Graph C - A circuit}
\label{fig:graphC}
\end{figure}
\textbullet \quad A \uline{cyclic graph} is a graph containing at least one graph cycle. A graph that is not cyclic is said to be acyclic. A cyclic graph possessing exactly one (undirected, simple) cycle is called a unicyclic graph. Cyclic graphs are not trees. \linebreak
\textbullet \quad A \uline{tree} (\figref{graphGtree}) is an \uline{undirected graph} in which any two vertices are connected by exactly one path. In other words, any acyclic connected graph is a tree. \linebreak
\textbullet \quad A \uline{forest} is an undirected graph, all of whose connected components are trees; in other words, the graph consists of a disjoint union of trees. Equivalently, a forest is an undirected acyclic graph. \linebreak
\begin{figure}[ht]
\centering
\includegraphics[scale=1]{graphGtree}
\caption{Graph G is in fact a Tree}
\label{fig:graphGtree}
\end{figure}
\textbullet \quad A Eulerian trail, or Eulerian path is a trail in a graph which visits every edge exactly once. \linebreak
\textbullet \quad A Eulerian circuit, or Eulerian cycle is an Eulerian trail which starts and ends on the same vertex. \linebreak
\textbullet \quad We have a graph $G = (V, E) $, where $V, E$ the sets of vertices and edges in the graph respectively. \linebreak
$\displaystyle \sum \limits_{v\in V} d(v) = 2|E| $, where $d(v)$ the grade of vertex $v$ \linebreak