In algebra , the New Year's Eve matrix for two polynomials is a special matrix with the coefficients of the polynomials , the determinant of which gives the resultant of the polynomials. It is named after the British mathematician James J. Sylvester .
definition
Be a commutative ring . For two polynomials and from the polynomial ring with
R.
{\ displaystyle R}
f
{\ displaystyle f}
G
{\ displaystyle g}
R.
[
X
]
{\ displaystyle R [X]}
f
=
∑
i
=
0
m
f
i
X
i
{\ displaystyle f = \ sum _ {i = 0} ^ {m} f_ {i} X ^ {i}}
and
G
=
∑
i
=
0
n
G
i
X
i
{\ displaystyle g = \ sum _ {i = 0} ^ {n} g_ {i} X ^ {i}}
of degree is called the square matrix
m
,
n
≥
1
{\ displaystyle m, n \ geq 1}
(
m
+
n
)
{\ displaystyle (m + n)}
Syl
(
f
,
G
)
=
(
f
m
⋯
f
0
f
m
⋯
f
0
⋱
⋱
f
m
⋯
f
0
G
n
⋯
G
0
G
n
⋯
G
0
⋱
⋱
G
n
⋯
G
0
)
{\ displaystyle \ operatorname {Syl} (f, g) = {\ begin {pmatrix} f_ {m} && \ cdots && f_ {0} &&& \\ & f_ {m} && \ cdots && f_ {0} && \\ && \ ddots &&&& \ ddots & \\ &&& f_ {m} && \ cdots && f_ {0} \\ g_ {n} && \ cdots && g_ {0} &&& \\ & g_ {n} && \ cdots && g_ {0} && \\ && \ ddots &&&& \ ddots & \\ &&& g_ {n} && \ cdots && g_ {0} \\\ end {pmatrix}}}
the New Year's Eve matrix to and . In the illustration, unspecified coefficients are to be understood as zero.
f
{\ displaystyle f}
G
{\ displaystyle g}
properties
For is the matrix that emerges from the New Year's Eve matrix by deleting the last rows of coefficients, the last rows of coefficients and the last columns with the exception of the -th The polynomial
0
≤
i
≤
j
≤
m
+
n
{\ displaystyle 0 \ leq i \ leq j \ leq m + n}
M.
j
i
{\ displaystyle M_ {ji}}
j
{\ displaystyle j}
f
{\ displaystyle f}
j
{\ displaystyle j}
G
{\ displaystyle g}
2
j
+
1
{\ displaystyle 2y + 1}
(
m
+
n
-
i
-
j
)
{\ displaystyle (m + nij)}
S.
j
(
f
,
G
)
=
∑
i
=
0
j
(
det
M.
j
i
)
X
i
{\ displaystyle S_ {j} (f, g) = \ sum _ {i = 0} ^ {j} \ left (\ det M_ {ji} \ right) \, X ^ {i}}
is then the -th sub-resultant of and ; their guide coefficient
j
{\ displaystyle j}
f
{\ displaystyle f}
G
{\ displaystyle g}
psc
j
(
f
,
G
)
=
det
M.
j
j
{\ displaystyle \ operatorname {psc} _ {j} (f, g) = \ det M_ {jj}}
is the -th major sub-result coefficient . The -th major sub-result coefficient
j
{\ displaystyle j}
0
{\ displaystyle 0}
res
(
f
,
G
)
=
det
Syl
(
f
,
G
)
{\ displaystyle \ operatorname {res} (f, g) = \ det \ operatorname {Syl} (f, g)}
finally is the resultant of and .
f
{\ displaystyle f}
G
{\ displaystyle g}
meaning
The main sub-result coefficients have an important meaning as a “measure” of the greatest common divisor of polynomials: The degree of for two polynomials not equal to 0 over a commutative factorial integrity ring is exactly the smallest with .
gcd
(
f
,
G
)
{\ displaystyle \ operatorname {ggT} (f, g)}
k
≥
0
{\ displaystyle k \ geq 0}
psc
k
(
f
,
G
)
≠
0
{\ displaystyle \ operatorname {psc} _ {k} (f, g) \ neq 0}
<img src="https://de.wikipedia.org/wiki/Special:CentralAutoLogin/start?type=1x1" alt="" title="" width="1" height="1" style="border: none; position: absolute;">