Académique Documents
Professionnel Documents
Culture Documents
Repaso de matrices
Matrices
Elemento: aij
Tamao: m n
Matriz cuadrada: n n
(orden n)
Elementos de la diagonal: ann
Vector columna
(matriz n x 1)
Vector fila
(matriz 1 x n)
a1
a2
#
an
( a1 a2 " an )
Suma:
3
2 1
4 7 8
A= 0 4
6 , B = 9
3
5
6 10 5
1 1
2+4
A+B = 0+9
6 +1
1+ 7
3 + (8) 6
4+3
6+5 = 9
10 + (1) 5 + 2 5
6
7
9
11
3
A+B=B+A
A + (B + C) = (A + B) + C
(k1k2) A = k1(k2A)
1A=A
k1(A + B) = k1A + k1B
(k1 + k2) A = k1A + k2A
Multiplicacin:
4 7
9 2
,B=
(a) A =
8
3 5
6
49 + 76 4(2) + 78 78 48
AB =
=
39 + 56 3(2) + 56 57 34
5 8
(b) A = 1 0 , B = 4 3
0
2
2 7
5(4) + 82 5(3) + 80 4 15
AB = 1(4) + 02 1(3) + 00 = 4 3
2(4) + 72 2(3) + 70 6 6
Nota: En general, AB BA
a12
T
A =
#
a1n
a22 " am 2
#
a2 n " amn
(i) (AT)T = A
(ii) (A + B)T = AT + BT
(iii) (AB)T = BTAT
(iv) (kA)T = kAT
Nota:
(A + B + C)T = AT + BT + CT
(ABC)T = CTBTAT
Matriz cero
A+0=A
A + (A) = 0
0 0
0
0 0
0= ,0=
, 0 = 0 0
0
0 0
0 0
Matrices triangulares
1
0
0
2 3 4
5 6 7
0 8 9
0 0 1
Triangular superior
2 0 0 0 0
1 6 0 0 0
8 9 3 0 0
1 1 1 2 0
15 2 3 4 1
Triangular inferior
Matriz diagonal:
Matriz cuadrada n n, i j, aij = 0
7
0
0
0
1
0
1
5 0
1 0
=5
0 5
0 1
Matriz identidad:
A: m n, entonces
Im A = A In = A
1 0 0 "
0 1 0 "
#
0 0 0 "
0
#
1
8
A = 2 5 6
7 6 4
1 2 7
T
A = 2 5 6 = A
7 6 4
Matriz aumentada
asociada, para resolver
el sistema de ecuaciones
lineales.
b1
b2
#
bm
10
2x1 + 6x2 + x3 = 7
x1 + 2x2 x3 = 1
5x1 + 7x2 4x3 = 9
2 R1 + R2
5 R1 + R3
3 R2 + R3
1 7
2 6
1 2 1 1
5 7 4 9
2 1 1
1
2
3 9
0
0 3
1
14
1 2 1 1
3
9
0 1
2
2
0 0 11 55
2
2
2 R2
11R3
R12
1 2 1 1
1 7
2 6
5 7 4
9
2 1 1
1
3
9
1
2
2
0
0 3
1
14
1 2 1 1
3
9
0 1
2
2
0 0
1
5
x1 + 2 x2 x3 = 1
x3 = 5, x2 = 3, x1 = 10
3
9
x2 + x3 =
2
2
x3 = 5
11
4
2
111 R2
1
111 R3
0
0
3 2
1
5
3
7
3 2
1 1
1
5
19
7
3
3
4 R1 + R2
2 R1 + R3
3 R2 + R1
R2 + R3
0
0
0
0
3 2
11 11 33
11 11 33
0
1
2
1 1 3
0
0
0
Entonces:
x2 x3 = 3
x1 + x3 = 2
Haciendo x3 = t, tenemos x2 = 3 + t, x1 = 2 t.
12
Resolver: x1 + x2 = 1
4x1 x2 = 6
2x1 3x2 = 8
1
1
1
1 0 1
4 1 6 0 1 2
2 3
0 0 16
8
0 + 0 = 16 !! No tiene soluciones.
13
Vectores fila:
u1 = (a11 a12 a1n),
u2 = (a21 a22, a2n),,
um = (am1 am2 amn)
Vectores columna:
a11
a12
a1n
a21
a22
a2 n
v1 =
, v2 =
, ", v n =
#
#
#
am1
am 2
amn
El rango de una
matriz A m n, es el
mximo nmero de
vectores fila
linealmente
independientes.
3
1 1 3 121R2R+ R3 1 1 1
1 1 3 32RR1++RR2 1
1
2
1
3
4
1
A = 2 2
8 2 0 1 2 2
6 8 0 4
3
0
0 0
0
0
2 4 1
5 7 8
14
rang A = 2.
AX = 0
Siempre hay soluciones
(consistente)
Solucin nica X = 0
(solucin trivial)
rang(A) = n
Infinitas soluciones
Rang(A) < n
n r parmetros
15
AX = B, B0
Consistente
rang(A) = rang(AB)
Solucin nica
rang(A) = n
Inconsistente
rang(A) < rang(AB)
Infinitas soluciones
rang(A) < n
n r parmetros
16
Determinantes
a11 a12
det A =
= a11a22 a12 a21
a21 a22
a11
a12
a13
det A = a21
a22
a23
a31
a32
a33
= a11a22 a33 + a12 a23 a31 + a13 a21a32 a13 a22 a31
a11a23 a32 a12 a21a33 .
det A = a11
a22
a32
a23
a21 a23
+ a12
a33
a31 a33
a21 a22
+ a13
a31 a32
17
a11
det A = a21
a31
a22
C11 =
a32
a23
a33
a12
a22
a32
a13
a23
a33
El cofactor de aij es
Cij = (1)i+ j Mij
donde Mij se llama menor.
a21 a23
C12 =
a31 a33
a21 a22
C13 =
a31 a32
2 4
2 4 7
A = 6 0 3
det A = 6 0
1 5 3
1 5
2 4 7
1+1
1+1 0
C11 = (1) 6 0 3 = (1)
5
1 5 3
2
C12 = (1)1+ 2 6
1
2
C13 = (1)1+3 6
1
4
0
5
4
0
5
7
1+ 2 6
3 = (1)
1
3
7
1+3 6
3 = (1)
1
3
7
3 = 2C11 + 4C12 + 7C13
3
3
3
3
3
0
5
19
2 4 7
det A = 6 0 3 = 2C11 + 4C12 + 7C13
1 5 3
1+1 0 3
1+ 2 6 3
1+3 6 0
det A = 2(1)
+ 4(1)
+ 7(1)
5 3
1 3
1 5
= 2[0(3) 3(5)] 4[6(3) 3(1)] + 7[6(5) 0(1)] = 120
Ms corto desarrollando por la segunda fila...
= 6(1)
4 7
5 3
+ 3(1)
2+3
2 4
1 5
20
6 5 0
A = 1 8 7
2 4 0
6 5
0
det A = 1 8 7 = 0C13 + ( 7)C23 + 0C33
0
2 4
6 5 0
= (7)(1)
2 +3
1 8 7 = (7)(1)
2 4 0
2+3
6 5
2 4
det AT = det A
5
7
det A =
= 41
3 4
5
3
det A =
= 41
7 4
T
A = 4 2 2
9 2 2
6 2 2
det A = 4 2 2 = 0
9 2 2
22
det B = det A
2
1 3
4 1 9
det B = 6 0 7 = 6 0 7 = det A
4 1 9
2
1 3
23
det B = k det A
det B = kai1Ci1 + kai 2Ci 2 + " + kain Cin
=
= k det A
5 8
1 8
1 1
=5
= 58
20 16
4 16
4 2
= 582
1 1
2 1
= 80(1 2) = 80
24
, B=
5
1 1
3
12 22
AB =
6 9
25
det B = det A
1 2 3 R + R 5
1
2
5
1 3
0
7 = B
A = 3 0 7 3
4 1 4
11 4 2
0
0
a11
A = a21 a22
0
a
a
a
31 32
33
det A = a11
a22
a32
a33
A=
5
0
0
0
6
0
0
9 4
0
2
4 2
matriz diagonal
3 0 0
A = 0 6 0
0 0 4
3 0
0
2 6
0
det A =
5 9 4
7 2
0
0
=
0
4 2
3 6 ( 4) (2) = 144
3 0 0
det A = 0 6 0 = (3)64 = 72
0 0 4
27
Demostracin
Sea B la matriz que obtenemos de A al
cambiarle los elementos de la i-sima fila
por los de su k-sima fila:
bi1 = ak1, bi2 = ak2, , bin = akn
B tendr entonces dos filas idnticas de
modo que det B = 0, y:
2 7
6
A = 4 3 2
2
4
8
+ 7
=6
+ 2
3 2
4 3
4 2
= 6(25) + 2(40) + 7(10) = 0
2 7
30
Inversa de un matriz
Sea A una matriz n n. Si existe una matriz
n n B tal que
AB = BA = I
donde I es la matriz identidad n n, entonces
se dice que A es una matriz no singular o
invertible. Y B es la matriz inversa de A.
Si A carece de inversa, se dice que es una
matriz singular.
Sean A, B matrices no singulares.
(i)
(A-1)-1 = A
(ii) (AB)-1 = B-1A-1
(iii) (AT)-1 = (A-1)T
31
Matriz adjunta
Sea A una matriz n n. La matriz formada por
la transpuesta de la matriz de cofactores
correspondientes a los elementos de A:
T
#
#
#
1
A =
adj A
det A
1
Para n =3:
a11 a12 a13 C11 C21 C31
a
a
C
C
31 32
33 13
23
33
0
0
det A
= 0
det A
0
0
0
det
A
33
1 4
A=
2 10
1 10 4 5 2
A =
=
1
2 2
1 1
2
1
1 4 5 2 5 4 2 + 2 1 0
AA =
=
=
1
2 10 1
10 10 4 + 5 0 1
2
1
5 2 1 4 5 4 20 20 1 0
A A=
=
=
1
1 + 1 4 + 5 0 1
1
2 2 10
1
34
2 2 0
A = 2 1 1
3 0 1
1 1
2 1
C11 =
= 1 C12 =
=5
0 1
3 1
2 0
= 2
C21 =
0 1
C31 =
2 0
1 1
=2
2 1
= 3
C13 =
3 0
2 0
2 2
= 2 C23 =
=6
C22 =
3 1
3 0
C32 =
2 0
2
= 2 C33 =
2 2
2
=6
1
2 112 16
1 2
6
5
1
1
1
1
2 2 = 12
A = 5
6
6
12
1
1
1
3
6
6
2
2
35
2 0 1
A = 2 3 4
5 5 6
2 0 1 1 0 0
2 3 4 0 1 0
5 5 6 0 0 1
2 R1
2 R1 + R2
5 R1 + R3
1 0
2 3
5 5
1 0
0 3
0 5
1 0 " 0
0 1 " 0
#
#
0 0 " 1
0 0
0 1 0
0 0 1
4
6
1
5
17
1
5
0 0
1 0
0 1
36
3 R2
1 R
5 3
R2 + R3
30 R3
12 R3 + R1
5 3 R3 + R2
0
0
0
0
0
0
0
1
1
1
5
17
1
0
5
1
1
0
10
2
3
30
2
3
1
1
1
1
1
3
2
2
3
6
2
3
1
0
3
0 15
0
0
1
0
3
13 15
0 0
1
0
3
10 6
0
5 3
5 3
2
1 0 0 2
1
17 10
17 10 A = 8
0 1 0 8
5 10
0 0 1
5
10
6
37
1 1 2
A = 2 4
5
6 0 3
1 1 2 1
5 0
2 4
6 0 3 0
1 1
2 R1 + R2
0 6
6 0
1 1
6 R1 + R3
0 6
0 6
R2 + R3
Singular
0 0
1 0
0 1
1 0 0
2
9 2 1 0
0 0 1
3
2
1 0 0
9 2 1 0
9 6 0 1
1 0 0
1 1 2
9 2
1 0
0 6
0 0
38
0
4
1
1
AX = B
Si m = n, y A es no singular, entonces:
X = A-1B
39
2 x1 9 x2 = 15
3 x1 + 6 x2 = 16
2 9 x1 15
=
6 x2 16
3
2 9
= 39 0
3
6
2 9
1 6 9
=
39 3 2
6
3
x1 1 6 9 15 1 234 6
=
= 1
=
x2 39 3 2 16 39 13 3
x1 = 6 , x2 = 1/ 3
40
2 x1 + x3 = 2
5 x1 + 5 x2 + 6 x3 = 1
2 x1 + 3x2 + 4 x3 = 4
x1 2
x2 = 2
x 5
3
2
= 8
5
2 0 1
A = 2 3 4
5 5 6
0 1 2
3 4 4
5 6 1
5 3 2 19
17 10 4 = 62
6 1 36
10
x1 = 19 , x2 = 62 , x3 = 36
41
#
det A
Regla
de
Cramer
42
Problemas de autovalores
DEFINICIN
Autovalores y autovectores
44
1
Verifica que K = 1
1
la matriz:
es el autovector de
0 1 3
A= 2
3
3
2
1
1
Solucin
0 1 3 1 2
1
AK = 2 3
3 1 = 2 = (2) 1 = (2)K
2
1 2
1
1
1
Autovalor
45
(A I)K = 0
Que es lo mismo que un sistema de ecuaciones
lineales homogneo. Si queremos que K sea una
solucin distinta de cero, debera ocurrir que:
det (A I) = 0
Observa que det (A I) nos proporcionar un
polinomio de grado n, que llamaremos ecuacin
46
caracterstica.
2
1
1
A = 6 1 0
1 2 1
(A I)K = 0
1
det( A I ) = 6
1
3 2 + 12 = 0
( + 4) ( 3) = 0
= 0, 4, 3.
2
1
1
0
=0
(i) 1 = 0
(A 1I)K = 0
6 R1 + R2
2
1 0
1
2
1
0
R1 + R3 1
( A + 0I | 0) = 6 1 0 0 0 13 6 0
1 2 1 0
0
0
0
0
1 0 2 R2 + R1 1 0 113 0
113 R2 1 2
6
6
0 1 13 0 0 1 13 0
0 0 0 0
0 0 0 0
1
6
k1 = k3 , k2 = k3
13
13
Tomando k3 = 13
K1 = 6
13
48
(ii) 2 = 4
2 1 0
5
( A + 4I | 0) = 6
3 0 0
1 2 3 0
(A 2I)K = 0
19 R2
18 R3
1 2 3 0
0 1 2 0
0 1 2 0
R3
R13
6 R + R
2 3 0
1 2 3 0 5 R11+ R32 1
6 3 0 0 0 9 18 0
5 2
0 8 16 0
1
0
2 R2 + R1
2 R2 + R3
1 0
1 0
0 1 2 0
0 0
0
0
k1 = k3 , k2 = 2k3. Tomando k3 = 1:
1
K2 = 2
1
49
(iii) 3 = 3
(A 3I)K = 0
2
1 0
2
( A 3I | 0) = 6 4
0 0
1 2 4 0
1 0
0 1
0 0
1 0
3
0
2
0 0
2
K 3 = 3
2
50
det( A I ) =
3 4
A=
1 7
= ( 5) 2 = 0
1 = 2 = 5 es un autovalor de multiplicidad 2.
A partir de (A 5I|0), tenemos: 2k + 4k = 0
1
Tomando k2 = 1, tenemos
2
k1 = 2, y entonces
K1 =
1
k1 + 2k2 = 0
51
9 1 1
A = 1 9 1
1 1 9
9
1
1
det( A I ) = 1
9
1 = ( 11)( 8) 2 = 0
1
1
9
52
( A 11I | 0) = 1 2
1 0
1
1
2
0
1 0 1 0
0 1 1 0
0 0 0 0
53
(ii) 2 = 8,
1 1 1 0
( A 8I | 0)3 = 1 1 1 0
1 1 1 0
1 1 1 0
0 0 0 0
0 0 0 0
1
K 2 = 1,
0
54
AK = K, A K = K , A K = K
55
= 2 10 + 29 = 0
(A 1I)K = 0
1 = 5 + 2i , 2 = 1 = 5 2i
1 = 5 + 2i
6 1
A=
5 4
(1 2i )k1 k2 = 0
5k1 (1 + 2i )k2 = 0
2 = 1 = 5 2i,
1
K1 =
1 2i
1
K 2 = K1 =
1 + 2i
56
A = AAA
A
"
m factores
57
Teorema de Cayley-Hamilton
Ecuacin caracterstica: det (A I) = 0
n 1
(1) + cn1
n n
+ " + c1 + c0 = 0
(1) A + cn1A
n
n 1
Comprobarlo con:
2 4
A=
1 3
2 2 = 0.
Y por el teorema de CayleyHamilton:
A2 A 2I = 0
Am = c1A + c0I y m = c1 + c0
2 2 = 0; 1 = 1 , 2 = 2:
( 1) m = c0 + c1 ( 1)
m
2 = c0 + c1 ( 2)
c0 = 1/3[2m + 2( 1) m ], c1 = 1/3[2m (1) m ]
1 [ 2 m + 4( 1) m ]
A m = 3
1 [ 2 m ( 1) m ]
m
m
[
2
(
1
)
]
1 [ 2 m + 2 ( 1) m ]
3
4
60
61
Calcula
Am
para:
1 1 2
A = 1 2
1
0 1 1
Solucin
3 + 2 2 + 2 = 0, = 1, 1, 2.
Am = c0I + c1A +c2A2
m = c0 + c1 + c2 2
Con 1 = 1, 2 = 1, 3 = 2, obtenemos:
(1)m
= c0 c1 + c2
1 = c0 + c1 + c2
2m = c0 +2c1 + 4c2
c0 =
m
m
[
3
+
(
1
)
2
],
3
c1 = 2[1 (1) m ],
c2 =
m
m +1
[
3
+
(
1
)
+
2
]
6
62
m
A =
1 2m
1 [3 2m+1 ( 1) m ]
6
m
m
[
2
(
1
)
]
3
2m
m
m
[
2
(
1
)
]
3
m +1
m
+
+
[
9
2
7
(
1
)
]
6
m
2 1
1 [ 3 + 2 m +1 + 7( 1) m ]
6
10
A = 1023 1024 1023
341 341 342
63
2 4
A=
1 3
A2 A 2I = 0,
I = (1/2)A2 (1/2)A,
2 4
1 2 4 1 1 0 32 2
= 1
=
2 1 3 20 1 2 1
1 3
64
K AK = K K
T
0 = ( ) K K
T
K K = ( | k1 | + | k2 | +" + | kn | ) 0
T
= 0 es real.
65
Autovectores ortogonales
Al igual que definimos el producto escalar
entre vectores:
x y = x1 y1 + x2 y2 + + xn yn
podemos definirlo con matrices (vectores
fila o columna):
X Y XT Y = x1 y1 + x2 y2 + + xn yn
|| X || X X = x + x + " + x
T
2
1
2
2
2
n
Demostracin
Sean 1,, 2 dos autovalores distintos
correspondientes a los autovectores K1 y K2.
AK1 = 1K1 , AK2 = 2K2
(AK1)T = K1TAT = K1TA = 1K1T
K1TAK2 = 1K1TK2
AK2 = 2K2,
K1TAK2 = 2K1TK2
0 = 1K1TK2 2K1TK2
0 = (1 2) K1TK2
Como 1 2, entonces K1TK2 = 0.
67
0 1 0 = 0, 1, 2 y
1
1
1
A = 1 1 1
K3 = 2
0
,
K
=
1
,
K
=
1
2
1 0
1
1
1
1
T
K1 K 2 = (1 0 1) 1 = 1(1) + 01 + 1( 1) = 0
1
1
T
K1 K 3 = (1 0 1) 2 = 11 + 02 + 1(1) = 0
1
1
T
K 2 K 3 = (1 1 1) 2 = (1)1 + 12 + 1(1) = 0
1
68
Matriz ortogonal:
Una matriz A n n no singular es ortogonal si:
A-1 = AT
A es ortogonal si ATA = I.
1 0 0
I = 0 1 0
0 0 1
ITI
13
2
T
A A = 3
2
3
= II = I
2
2
1
3
3
3
13 2 3
2
2
A= 3
3
2
1
3
3
2 3 13 2 3
2
1
2
3
3
3
2 2
1
3
3
3
3
2
3
1
1 0 0
1
3 = 0 1 0 = I
0 0 1
2
69
XT X
n 1
T
T
X2 X2 " X2 Xn 0 1 " 0
=
#
#
#
T
T
Xn X2 " Xn Xn 0 0 " 1
3 3
2
2
A= 3
3
2
1
3
3
1
T
X1 X 2
1
3
2
3
= ( 13
13
23
23
2
2
1
X1 = 3 , X 2 = 3 , X3 = 3 ,
2
1
2
3
3
3
23
2 4 2
2
2
2
3 ) 3 = + = 0
3
9 9 9
1
3
23
1 2 2 4
T
1
2
2
X1 X3 = ( 3 3 3 ) 3 = + = 0
2 9 9 9
3
23
1
4 2 2
T
2
2
1
X 2 X3 = ( 3 3 3 ) 3 = + + = 0
9 9 9
2
3
71
0 1 0
A = 1 1 1
0
1
0
Vimos
|| K1 || = K1T K1 = 2,
|| K 2 || = K T2 K 2 = 3,
|| K 3 || = K T3 K 3 = 6
P=
1
2
0
1
2
1
1
3
6
1
2
3
6
1
1
3
6
1
1
1
K 1 = 0 , K 2 = 1 , K 3 = 2
1
1
1
2
0 ,
1 ,
3
1
6
2
6
1
Autovalor dominante
| k | > | i | ,
i =1, 2 , 3 ," , n
0 4
1 = 2, 2 = 2
A = 0 5 1
0 0 5
1 = 2, 2 = 3 = 574
i = 1, 2, 3, "
X1 = AX0
X 2 = AX1 = A 2 X0
Vector n 1
Supongamos que
A tiene un autovalor
dominante.
X m = AX m1 = A m X0
AX 0 = c11K 1 + c2 2 K 2 + " + cn n K n
75
(...)
2 2
n
m
= 1 c1K1 + c2 K + " + cn K n
1
1
A X0
m
m
1 c1K1
76
A X0
m
m
1 c1K1
Am X 0 = X m
De modo que Xm ser una aproximacin al autovector
dominante.
Puesto que AK = K, AKK= KK
AK K
=
K K
AX m X m
1
Xm Xm
Cociente de Rayleigh.
2
4
A=
3 1
1
X0 =
1
4 2 1 6
X1 = AX0 =
=
3 1 1 2
4 2 6 28
X 2 = AX1 =
=
3 1 2 16
Xi
144
68
712
364
3576 17848
1772 8956
7
89304
44588
A X0
m
m
1 c1K1
X 7 = 89304
0.4933
78
2 1 4.9986
4
AX 7 =
3 1 0.4993 2.5007
T
4.9986 1
AX7X7 =
= 6.2472
2.5007 0.4993
T
1 1
X7X7 =
= 1.2493
0.4993 0.4993
AX7X7 6.2472
1
=
= 5.0006
X7X7
1.2493
1
1
1 = 5, 2 = 2, K1 = , K 2 =
0 .5
3
79
Matriz diagonalizable
Si existe una matriz P, tal que P-1AP = D
sea diagonal, entonces decimos que A es
diagonalizable.
TEOREMA
80
Demostracin
Puesto que P = (K1, K2, K3) es no singular,
entonces existe P-1 y
AP = ( AK1 AK 2
= (K 1 K 2
AK 3 ) = (1K1 2K 2
1 0
K 3 ) 0 2
0 0
3K 3 )
0 = PD
3
As que P-1AP = D.
81
3 4
A=
1 7
2
K1 =
Tenemos que = 5, 5.
1
Y solo podemos encontrar un autovector.
La matriz no puede diagonalizarse.
82
5 9
Diagonaliza: A =
6 10
5
9
det( A I ) =
= 2 5 + 4 = ( 1)( 4)
6
10
= 1, 4.
P = (K 1
3
1
K1 = , K 2 =
2
1
3 1
1 1
1
K2) =
,
P =
2 1
3
2
1 1 5 9 3 1 1 0
P AP =
=
=D
3 6 10 2 1 0 4
2
1
83
2
1
1
A = 6 1 0
1 2 1
P = (K 1 K 2
1 = 0 , 2 = 4 , 3 = 3 ,
1
1
2
K1 = 6 , K 2 = 2 , K 3 = 3
13
1
2
2
1 1
K3) = 6 2
3
13
1
2
112
9
1
P = 28
8
21
0 112
3
2
7
28
1
2
7
21
2
1 1 1
2
112 0 112 1
1
3
2
3
1 0 6 2
P AP = 28 7
28 6
8
2 1 2 1 13
1
2
21 17
21
0 0
0
= 0 4 0 = D
0
0
3
84
0 1 0
A = 1 0 0
0 0 1
= 1, 1, 1.
= 1
1
K 1 = 1
0
1 1 0
1 1 0
= 1 ( A I | 0) = 1 1 0 0 0 0
0 0 0
0 0 0
1
0
K 2 = 1 , K 3 = 0
junto con K1, forman tres vectores
linealmente independientes. Luego la
0
1
matriz es diagonalizable.
1 1 0
P = 1 1 0
0 0 1
P-1AP = D
1 0 0
D = 0 1 0
0 0 1
85