高等代数
高等代数
2430XH10030 李添意
September 2024
1 Problem 1
Consider the matrix of coefficients of the system
2x1 − 3x2 − 7x3 + 5x4 + 2x5 = 0
x − 2x − 4x + 3x + x = 0
1 2 3 4 5
2x 1 − 4x 3 + 2x 4 + x 5 = 0
x1 − 5x2 − 7x3 + 6x4 + 2x5 = 0
2 −3 −7 5 2
1 −2 −4 3 1
which is A = 2 0 −4 2 1. Now perform a series of elementary row
1 −5 −7 6 2
operations on A so that A is transformed into a row-reduced echelon matrix:
2 −3 −7 5 2 1 −2 −4 3 1
1 −2 −4 3 1 (1) 2 −3 −7 5 2
2 0 −4 2 1 −→ 2 0 −4 2 1
1 −5 −7 6 2 1 −5 −7 6 2
1 −2 −4 3 1
(2) 0 1 1 −1 0
−→
0 4 4 −4 −1
0 −3 −3 3 1
1 0 −2 1 1
(3) 0 1 1 −1 0
−→
0 0 0 0 −1
0 0 0 0 1
1 0 −2 1 0
(4) 0 1 1 −1 0
−→ 0 0 0
0 1
0 0 0 0 0
1
(-2) times row 1, and row 4 by row 4 plus (-1) times row 1;
(3) refers to replacing row 1 by row 1 plus 2 times row 2, row 3 by (-4) times
row 2, and row 4 by 3 times row 2;
(4) refers to multiplying row 3 by (-1) and then replacing row 4 by row 4 plus
(-1) times row 3.
Hence the solution set of AX = 0 is {(2x3 −x4 , −x3 +x4 , x3 , x4 , 0) | x3 , x4 ∈ R}.
Note that one obvious solution of the original system is (1, 2, 0, 0, 1), so the
desired solution set should be
1 2 −1
2 −1 1
5×1
α∈R α = 0 + x3 1 + x4 0 .
0 0 1
1 0 0
2 Problem 2
The original system is equivalent to
2x1 − 3x2 − 7x3 + 5x4 + 2x5 + 2x0 = 0
x − 2x − 4x + 3x + x + 2x = 0
1 2 3 4 5 0
2x1 − 4x3 + 2x4 + x5 − 3x0 = 0
x1 − 5x2 − 7x3 + 6x4 + 2x5 + 7x0 = 0
and
that x0 = 1. Now perform
elementary row operations on the matrix A =
2 −3 −7 5 2 2
1 −2 −4 3 1 2
:
2 0 −4 2 1 −3
1 −5 −7 6 2 7
2
2 −3 −7 5 2 2 1 −2 −4 3 1 2
1
−2 −4 3 1 2 (1) 2 −3 −7 5 2
−→ 2
2 0 −4 2 1 −3 2 0 −4 2 1 −3
1 −5 −7 6 2 7 1 −5 −7 6 2 7
1 −2 −4 3 1 2
(2) 0 1 1 −1 0 −2
−→
0 4 4 −4 −1 −7
0 −3 −3 3 1 5
1 0 −2 1 1 −2
(3) 0 1 1 −1 0 −2
−→
0 0 0 0 −1 1
0 0 0 0 1 −1
1 0 −2 1 0 −1
(4) 0 1 1 −1 0 −2
−→
0 0 0 0 1 −1
0 0 0 0 0 0
where (1), (2), (3), (4) stand for the same meaning as is listed in the problem
above.
So the solution set should be {(2x3 − x4 + x0 , −x3 + x4 + 2x0 , x3 , x4 , x0 , x0 ) |
x3 , x4 , x0 ∈ R, x0 ̸= 0}. Hence the solution set to the original system should be
{(2 xx03 − xx04 + 1, − xx30 + xx40 + 2, xx30 , xx40 , 1) | x3 , x4 ∈ R}, or just
1 2 −1
2 −1 1
5×1
α∈R α = 0 + x3 1 + x4 0 .
0 0 1
1 0 0
3 Problem 3
(m, n, p, q) = c1 α1 + c2 α2 + c3 α3 + c4 α4 is equivalent to the system
c1 + c2 + c3 + c4 = m
c + c − c − c = n
1 2 3 4
c1 − c 2 + c 3 − c4 =p
c1 − c2 − c3 + c4 = q
or
c1 + c2 = m+n
2
c + c = m−n
3 4 2
c1 − c2 = p+q2
c3 − c4 = p−q
2
3
or
m+n+p+q
c1 = 4
c m+n−p−q
2 = 4
m−n+p−q
c3 = 4
m−n−p+q
c4 =
4
But adding the first equation and the fourth one gives 2c1 = 7, while adding
the second and the third one gives 2c1 = 3. Contradiction. So such 3-tuples of
(c1 , c2 , c3 ) that (4, 1, 2, 3) = c1 α1 + c2 α2 + c3 α3 does not exist. ■
4 Problem 4
Comparing the coefficents on the left hand side and the right hand side gives
that
c4 = 1
4c4 + c3 = 2
6c4 + 3c3 + c2 = 0
4c4 + 3c3 + 2c2 + c1 = 2
c + c + c + c + c = 4
4 3 2 1 0
4
5 Problem 5
x1 + x2 + x3 + x4 = 1 · · · (1)
5x1 + 3x2 − 4x3 + 5x4 = 5 · · · (a)
2x + 2x − 3x + 4x = 2 · · · (2)
1 2 3 4
2x2 − x3 + 4x4 = 0 · · · (b)
3x1 + x2 − x3 + x4 = 3 · · · (3)
2x1 + 4x2 − 4x3 + 8x4 = 2 · · · (c)
4x1 + 2x2 + 2x4 = 4 · · · (4)
Note that (2) + (3) yields (a); (1) + (2) − (3) yields (b); (1) + 2 × (2) − (3)
yields (c), while (a) + 3 × (b) − (c) yields (1); (c) − (b) yields (2); (a) + (b) − (c)
yields (3); 2 × (a) + 4 × (b) − 3 × (c) yields (4). Hence by definition, these two
systems are equivalent. ■
6 Problem 6
We just need to verify that [sin α : 1 − cos α] ̸= [sin β : 1 − cos β] holds for any
0 ≤ α < β < 2π. Otherwise, we have sin α − sin α cos β = sin β − sin β cos α, or
α+β α−β α−β α−β
2 cos sin = 2 sin cos
2 2 2 2
α−β
But 2 ∈ (−π, 0) ∪ (0, π), hence
α+β α−β
cos = cos
2 2
or
α β
sin = 0
sin
2 2
Then α = 0 and [0 : 0] = [sin β : 1 − cos β]. Contradiction!
The geometric interpretation of [a : 1 − b] is the slope of the line connecting
(−a, b) and (0, 1) on the plane. ■
7 Problem 7
def y1 x1
d([x0 : x1 ], [y0 : y1 ]) = arctan − arctan
y0 x0
Thanks for reading.