Fundamentele

algebrice ale
informaticii

Curs
&

↑
A
10
A =
08

a det(A -

x() =

A -

x] =

(8) -

x(69) =

(1 x x)
det (A -x() =

I 1 06 x) =

=
( x)(b x)
-
-
=
(X 1)(x 3)
-
-

by = A ,
x Ma(c) I *
3
= z
X = -
X= 2

YX3
-
- z =
0

(x 2)(x2+2x 1) + = 0
-

Xi 2
X3 A=

O ↑ 0

od3 =

OE

a = ae[1 EiB}
33
= 1 :

= 8 = de 42 ; -

1 iB)
+

X =

(a)
1 B
A
-

31

155 1 -

5
B =

53- 1 13 + 1

A =
2 .
↳ -

E =

⑤ I
 cos-sin
= 2 .

cost
iT
sin 3

1+ 5 =
( ) =

=
282 :

Cos =

=
28r .

cos
sirsin
E(B 1) = -

B =
2
cost -

sin
Sin II cas
12
 E) gof =
Na Jog=1
=> Jiny Sif =

At B C

1 fig-inj =>
gof-ing
1) gof-inj =>
f-inj
a) J 9-surj
.
=>
gof-surj
a) gof-surj => 9-surj

3) J g-bij ) gof-bij
.
=
-

3) gof-bij = frinj i g-Surj

24.10.2023
 S
4) 2 Xn+ 1- 2XN
Xnzz =

Xo = 1 jx
= 2

↑ = 2x -

2 = ( -

2x + 2 =
0

A = 4 -

4 .

z =
-

11 . 2
= 2 =i =

(z
=
+ it) =

= (E i) + =

= in (200 i sin) +

↑n =
(E)" cecos +
sin)
Xo =
21 = 1

x = (c . +
) = 2

Cn + 22 = 2

1 + 2 = 2 )
=
22 = 1
 tris A) .
=
tri) = jbij
=> tr(A B) . =
fo -1)

A =

(2)
* -

trA A + det A I Da .

.
:

1(
3 A
def
-

· M
--
tr A = 0 A =
-2
2 3
-

-
A OA -

+32 = 01
-

A = 7 In

A3 = A A =
+2 A -
= 7A

= (A))" 13 %
" "
In

&
= =
1

A2k 74 (2 A
1
*A
+

= A2 A = -
-
= 7
31.10.2023
 trebrie sa respecte
Alegereo pivatulvi vimataarele

reguli :

1) pivotal + 0

↑ incepard de lo posul Cu
pivotul des nu ore

voie se
fie pe a linie sou caliena cu un
pivat
ales la enterior
un
pos

Pas 1 :
se
degepivat
Pasa :
se
importe linia
pivatului la pivat
Pos 3 : se reduce colsona pivotulvi
Pos reduce linia
4 : se
pivatulvi
Pos5 :
se
repeto tati acesti posi para
and
· nu se nei
prote dege
pivot
E citi de
rang unu
gasesc in
= se
S

ultime matrice
07.11.2023
 00100

O 000 8
I

8 100 O

O & 0 10

⑧
I & 1 -

31 -

10 101 -

31 -

10

1 1 1 1 1 -

A -

1111 A - 1

0 -100 15 N O
A 001 5
-

2 42426 M 2121 3

3 135 -

3 z5 3 A 35- 335

101 3 1 +8 200-41-14

10 D1 & 4 -

1 0 110 4

=
& 10 O A 501001
-= -
5 =

A 012 -
1 13 20 OD-19
3035-440 6002 -

728
14.11.2023
Curs
21.11.2023
 r(k ,
+ ) =
T

u(N ,
+ ) =
0

U(Q .. ) = Q
+

U(Th 0) ,
=
y +1)

② Mn(1R) , -monoid necom. 132

U (Mn (r) , ) =

[AcMn(m) det A +
oY = GLn(i,

GL2(R) A =
(5) <
GLz(M) (deta-eeu)

=
i - .. )
=

8 A B
.
+ BA =

4f A
: +
B)
(A) =
n
,
(B) =
m
(f : A +
By) = e" =
(B)
list) =
lp't
as
M + (M ,
0) =
e .
1 1m

v(m" , ) =

38cM"/8- bij JESIMIE Zim

 1)
A (2x
1
+
-

b) (A(x))"
*
=
Ene M
-

trebrie vf. prin inducte

28.11.2023
bs ! He ultreg e) Heeht sou Haehe
-
E"

"Pp He He d ice .
He i
Zhe Ital
He

he he e ,
run he ha electe

·
he .
nzehte = Ixielte : Keihr = =ha -
=
hi ! X , ele

contradictio
·
he heltz ,
e Exzetz : hehz = x2 =

th
hi Ha
controductive

bs ! G-grup 593 G ,
= 6
3

G
G-grup ,
X =

< X) =

14H(x- + = G)
·
> = G

· x[ = Xy

·
H = G ,
XeH = = X > &H
 Er =
cos isin
E" =
-(0Si + isinit) =
1

= Ns =
(1 ,
5 , 53
= ic =

[ikike]1 ,
i , i'ing E = + 1
, ti)
Ex i(k/g Th)
=
=
(i) +

=+ i) =

finito JG1 [2 , ,
En =
Eri (i) i)"

=> (n+ i)(2-E (1 + i)(

Er
-

1 = 1
=
=
=

=> J232-2 =
1 = E2-En = 0 = El =
E2
contradictio
Ri = (cos xisin)
= 1 + i) =
[2 (cos + isinE) In ex]

D5
G-grup ,
XeG

Spunem e x este de ordin

finit (peradic
*
doc J MEM a T . . x
*
= 2

Cel moi mic nu . N cu accosta proprietote se

numeste ordinul elem .

Xi se notenzi cu ordx
 TEMA 2

1: Se considerº
a matricea A = (aij )i;j=1;:::;n 2 Mn (R) (n  3) ; unde
(
0; dacº
ai=j
aij = ; 8 i; j 2 f1; :::; ng :
1; dacº
a i 6= j

a se calculeze: a) A100 ;
Sº b) det A; c) A1 :
r !
b
2: Fie numerele a; b 2 R+ si multimea G = ; +1 : Pe multimea R a numerelor
a
reale se considerº
a legea de compozitie
r
p p b p 
xy = a  xy  b  (x + y) +  b+1 ; 8 x; y 2 R:
a
a) Sº
a se arate cº
a G este parte stabilº
a a lui R Ón raport cu legea de compozitie "  " si cº
a
(G; ) este un grup comutativ, izomorf cu grupul (R; +) :
p p p
1+ b 2+ b n+ b
a se calculeze p
b) Sº  p  :::  p :
a a a

Problema 1: a) 1: b) 1: c) 2: a) 2: b) TOTAL
Punctaj 0:25 0:25 0:25 0:5 0:25 1.5 puncte
 a) 1000
& 11 0 l 211

A = A .

A = 1 01 -

101 - A 21

110 118 11 2

211 O 1 I 233

A = A! A =
121 .

101 = 3 2 3

110 33
n'e'
2

o 655

A = & =
323 .

10 A =
5 65

332110 55 6

6 55011 18 1111

A A! A
= =
565 .
101 =
11 10 11

5 5 6 A 10 111110
5.12.2023
12.12.2023
 (M o) - grup
.

X z eG
,
y ,

(xoy)0z =

f(j (x) +
J "(y))oz =

f((f f "(y)) f (z)

+
=
(x) + + =

f(f (f (y) f (z)))

"

(x)
-

= + + =

xof(f (y) *
y (z)) =

xo(yoz)
G
fie e e

of(e) f(f f (f())

-
+
x + M x (x) +
f(f (x) + e)
=

= =

f(f(x)) =
x

f(e)ox =
x =
f(e) elem neuter
. in M

XM
xox" = x ox =
f(e)
Xox" =

f(e)
 +

f(f"(x) f + (x)) =

f(e) #demonstran ce

1(x") (f
-
(x))
8
-

x" =

f(f- (x))

a ,
beG

H f(a + b) =

f(a)of(b)
f(a)of(b) f(f f(a) f f(b) f(a b)
+
= + =
+

=
forfism
1
f(x) = = 2 -

f(x) = 30fx0

lim f(x) 1

2 - Jef
=

X- -
d

=
(1 4) >
-

J-sigJi
If(x
.

=
 (1 00) .

(R ) ,
+

f: -(1 8) bij
. ,

f(x) 3x + 1
=

34 + 1
y
=

34 =

y 1
-

X =

logy -

f" (x) =

109y(x 1)
X > 1
,
y
x+
y
=

f(f"(x) +
f (y) f((ogy(x
= -

1) +
log(y 1)
-

zlogy(x 1)(y 1)
-
-

=
+ 1 =
(x 1)(y 1)
-
-

+ 1
19.12.2023
 XER

a denso in i
G*7(undnan CQ ar
Lis un =
x

f(un) f(x)
ax(
=> e =

N
= f(x) =
a
.

by f(un) =

!naun =

-
f(x) =
a
-

x
,
-xIM

(G ) -grup, f(x)
-1
..
f : Ge =
x

f automorfism # G obelion

f(x1) f(x2) Xi = (xi) Exc)) 1

inj G x)
-

:
xn x2 =
=

= =
,

=> X1 = X2

yeG Iron jv
surf
x =

f(x) f(y 1) (y + )
-

y
= =
=

Gendomorf . (

f(x -y) f(x) f(y) y)=

1
( ) +x + 2 : = .
=
(x =
x1 -

y
-

y
.

(((x 1)
+

y) (x +. y 1) (y y - )
1 1
(x
-

E)Xy
- -

yx
=
-

=
.
 =) Gabelion

5
G-grup finit a .
i

. f(x) =
x- este
automorf .

cord G-impor

XeG

x Ex
x ec f(x)
eg8bit)x
= = =

+ e

dar , fleh = e

olExci
& -able
·
+
St

X(x)

x(x =

1 21) (ii)
.
-

1
+ x = A + xB

# -

B
xkeMhee
 x

Prspozte
Ceongdnatie:
onpozte

tmemm/m

A18-a4b|oef bebl
4-446C1-t
t
GTupu tuotomogile

togeog
e

M N20245