数学 外文翻译 外文文献 英文翻译 范德蒙行列式的相关应用

范德蒙行列式的相关应用

（一）范德蒙行列式在行列式计算中的应用 范德蒙行列式的标准规范形式是：

1

2

2

2212

1

1

1

112111()n

n n i j n i j n n n n

x x x D x x x x x x x x ≥>≥---==

-∏

根据范德蒙行列式的特点，将所给行列式包括一些非范德蒙行列式利用各种方法将其化为范德蒙行列式，然后利用范德蒙行列式的结果，把它计算出来。常见的化法有以下几种：

1.所给行列式各列（或各行）都是某元素的不同次幂，但其幂次数排列与范德蒙行列式不完全相同，需利用行列式的性质（如提取公因式，调换各行（或各列）的次序，拆项等）将行列式化为范德蒙行列式。 例1 计算

2

2211

1222333n

n n n

D n n n =

解 n D 中各行元素都分别是一个数自左至右按递升顺序排列，但不是从0变到n r -。而是由1递升至n 。如提取各行的公因数，则方幂次数便从0变到1n -.

[]

21

212

1

1

111

1222!!(21)(31)(1)(32)

(2)

(1)1

3331

n n n n D n n n n n n n

n n ---==-------!(1)!(2)!2!1!n n n =--

例2 计算

11

1

1(1)()(1)()11

1

1

n n n n n n a a a n a a a n D a a a n ---+----=

-

-

解 本项中行列式的排列规律与范德蒙行列式的排列规律正好相反，为使1n D +中各列元素的方幂次数自上而下递升排列，将第1n +列依次与上行交换直至第1行，第n 行依次与上行交换直至第2行第2行依次与上行交换直至第n 行，

于是共经过

(1)

(1)(2)212

n n n n n ++-+-+

++=

次行的交换得到1n +阶范德蒙行列式：

[]

[](1)2

1111

(1)2

1

1

111

(1)

(1)()(1)

()(1)

(1)(2)

()2(1)((1))!

n n n n n n n

n

n n n

k a

a a n D a a a n a a a n a a a a a n a a a a n a n k ++---+=--=-----=--------------=∏ 若n D 的第i 行（列）由两个分行（列）所组成，其中任意相邻两行（列）均含相同分行（列）；且n D 中含有由n 个分行（列）组成的范德蒙行列式，那么将n D 的第i 行（列）乘以-1加到第1i +行（列），消除一些分行（列）即可化成范德蒙行列式： 例3 计算

12342

2

2

2

11

22

33

44

232323231122

3344

1

1111sin 1sin 1sin 1sin sin sin sin sin sin sin sin sin sin sin sin sin sin sin sin sin D +Φ+Φ+Φ+Φ=

Φ+ΦΦ+ΦΦ+ΦΦ+ΦΦ+ΦΦ+ΦΦ+ΦΦ+Φ

解 将D 的第一行乘以-1加到第二行得：

1

2

3

4

2

2

2

2

11

22

3344

2323232311223344

1111sin sin sin sin sin sin sin sin sin sin sin sin sin sin sin sin sin sin sin sin ΦΦΦΦΦ+ΦΦ+ΦΦ+ΦΦ+ΦΦ+ΦΦ+ΦΦ+ΦΦ+Φ

再将上述行列式的第2行乘以-1加到第3行，再在新行列式中的第3行乘以-1加到第4行得：

1234222214

1234

33341

2

3

4

1

111sin sin sin sin (sin sin )sin sin sin sin sin sin sin sin i j j i D ≤<≤ΦΦΦΦ=

=

Φ-ΦΦΦΦΦΦΦΦΦ∏

例4 计算

2

1112

22

2

2

111111111n

n

n

n n n

x x x x x x D x x x ++++++=

+++ （1）

解 先加边，那么

2

2

1111112

22

2

222

22

21000111111111

1

1111

1

1111

n

n

n

n n

n n n n

n

n n

x x x x x x D x x x x x x x x x x x x ---++

+=+++=+

++

再把第1行拆成两项之和，

2

2

1111112211112000111

1

n

n

n n n

n

n

n

n

n

x x x x x x D x x x x x x =

-

111

111

1

2()(1)

()

()[2(1)]

n

n

k j i k j j k n

i j k n

n

n

k j i i j k n

i i x x

x x x x x x x x x ≤<≤=≤<≤≤<≤===----=

---∏∏∏

∏∏∏

2.加行加列法

各行（或列）元素均为某一元素的不同方幂，但都缺少同一方幂的行列式，可用此方法： 例5 计算

222

1233

31212

111

3n

n n

n

n n

x x x D x x x x x x =

解 作1n +阶行列式：

12

222212133

3312

121111n

n n n

n

n

n n n

z

x x x z x x x D z x x x z x x x +=

=1

()

()n

i j k i l k j n

x z x x =≤<≤--∏∏

由所作行列式可知z 的系数为D -，而由上式可知z 的系数为：

21

1211

(1)

()()n

n n j k i n j k l

i x x x x x x -=≥>≥--∑∏

通过比较系数得：

12

11

()()n

n j k i n j k l

i D x x x x x x =≥>≥=-∑∏ 3.拉普拉斯展开法

运用公式D =1122n n M A M A M A ++来计算行列式的值：

例6 计算

111

111

122

122

111000

01

00

100

100

1000

1

n n n n n n n

n n

n

x x y y x x D y y x x y y ------=

解 取第1，3，

21n -行，第1，3，

21n -列展开得：

11

111111

2222

1111

11

1

1n n n n n n n

n

n

n

x x y y x x y y D x x

y y

------=

=

()()j i j i n j i l

x x y y ≥>≥--∏

4.乘积变换法 例7 设1

2

1

(0,1,

22)n

k k k k k n

i i s x

x x x k n ==++

+==-∑，计算行列式 0

11121

22

n n n n

n s s s s s s D s s s ---=

解

11121

1

1

12221

1

1n

n

n i

i

i i n

n

n n i

i

i

i i i n

n

n

n n n i

i

i i i n

x

x

x

x

x D x

x

x

-=====--====

∑∑∑∑∑∑∑

∑

2

1

11112212

22

22

2

12

211112

2

111

1

11()n n

n n

n n n n n

n

n

n

j i l i j n

x x x x x x x x x x x x x x

x

x x x x x -----≤<≤==

-∏

例8 计算行列式

000101011101()()()()()()()()()n

n n n n n n n n

n

n

n n n n a b a b a b a b a b a b D a b a b a b ++++++=

+++

解 在此行列式中，每一个元素都可以利用二项式定理展开，从而变成乘积的和。根据行列式的乘法规则，12D D D =，其中

1000

1

1

1

101n n

n

n n n n n

n n n n

n n n n n

C C a C a C C a C a

D C C a C a =

011110121

1

1

n n n n n n n n

b b b b b b D ---=

对2D 进行例2中的行的变换，就得到范德蒙行列式，于是

00

1

211121

11

n n

n n

n

n

n n

n

a a a a D D D C C

C

a a ==(1)2

(1)

n n +-0101111n n

n

n

n b b b b b b

=(1)122

00()(1)

()n n n n n

n

i j i j j i n

j i n

C C

C

a a

b b +≤<≤≤<≤---∏

∏

=12

0()()n

n n n

i j i j j i n

C C C a a b b ≤<≤--∏

5.升阶法

例9 计算行列式

2

2

11112222

2

2

22111122111

1

n n

n n n n n n n n n n n

n

n

n

x x x x x x x x D x x x x x x x x --------=

解 将D 升阶为下面的1n +阶行列式

2

2

1

1111122122

2

2

2

1

221111112212

2

1

11

111

n n n

n n n n n n n n n n n n n n n n n n n n n n n

x x x x x x x x x x x x

x x x

x x

x x x

x

x

x

x

x

----+-----------=

即插入一行与一列，使1

n +是关于12,,,n x x x x 的1n +阶范德蒙行列式，此处x 是

变数，于是

1

121()()

()()n n i j j i n

x x x x x x x x +≤<≤=----∏故

1

n +是一个关于x 的n 次

多项式，它可以写成

{}11

121()(1)()n n n i j n j i n

x x x x x x x -+≤<≤=

-+-++

++

∏

另一方面，将

1

n +按其第1n +行展开，即得

2111

1()(1)n n n n i j j i n

x x x Dx +-+≤<≤=

-+-+

∏

比较

1

n +中关于1n x -的系数，即得

121()

()n i j j i n

D x x x x x ≤<≤=+++-∏

(二) 范德蒙行列式在多项式理论中的应用 例1 设01(),n n f x c c x c x =++若()f x 至少有1n +个不同的根，则()0f x =。

证明 取121,,

n x x x +为()f x 的1n +个不同的根，则有齐次线形方程组

2011211201222220112110,0,

0,

n n n

n n n n n n c c x c x c x c c x c x c x c c x c x c x +++?++++=?++++=???

?++++=? (2)

其中01,,

n c c c 看作未知量

因为方程组（2）的系数行列式D 是Vander monde 行列式，且

1()0,j i i j n

D x x ≤<≤=

-≠∏

所以方程组（2）只有零解，从而有010,n c c c ====即

()f x 是零多项式。

例2 设12,n a a a 是数域F 中互不相同的数，12,,n b b b 是数域F 中任一

组给定的不全为零的数，则存在唯一的数域F 上次数小于n 的多项式

()f x ，使()i f a =i b ，1,2,

i n =

证明 设1011(),n n f x c c x c x --=+++由条件()i i f a b =，1,2,

i n =知

10111111

012

1221

011,

,

,

n n n n n n n n n c c a c a b c c a c a b c c a c a b ------?++

+=?

++

+=???

?+++=? （3）

因为12,,

n a a a 互不相同，所以方程组（3）的系数行列式

2

1112122

2

12111()01

n n n j i i j n

n n

n

n

a a a a a a D a a a a a --≤<≤-=

=

-≠∏

则方程组（3）有唯一解，即唯一的次数小于n 的多项式

1011(),n n f x c c x c x --=++

使得()i i f a b =，1,2,

i n =

例3设多项式1212(),n p p p n f x a x a x a x =++

+0,1,2,

i a i n ≠=，,i j p p

≠

,,1,2,

i j i j n ≠=，则()f x 不可能有非零且重数大于1n -的根。

证明 反设0α≠是()f x 的重数大于1n -的根，则()f α=0，()0,f α'=

(1)()0,n f α-=进而1(1)()0,()0,()0.n n f f f ααααα--'===即

12121212112211

1122220,0,(1)(2)(1)(2)(1)(2)0

n n n p p p n p p p

n n p p p n n n n a a a p a p a p a p p p n a p p p n a p p p n a ααααααααα?+++=?++=???

?--++--+++--+=?

（4）

把（4）看成关于1212,,,n p p p n a a a ααα为未知量的齐次线形方程组则（4）的系数

行列式

1211221112221

11(1)

(1)

(1)

(1)

(2)

(1)

(2)

(1)

(

2)

n n n n n n p p p D p p p p p p p p p n p p p n p p p n =

-----+--+--+

=

1

2

2221

2

11

1112111()0

n

n j i i j n

n n n n

p p p p p p p p p p p ≤<≤---=

-≠∏

所以方程组（4）只有零解，从而0,1,2,

i p i a i n α==，所以必有0,α=

这与0α≠矛盾，故()f x 没有非零且重数大于1n +的根。

附件：(外文资料原文)

New proof of the Vander monde determinant and

some applications

(A): a new method of proof: mathematical induction

We on the n for that the inductive method. （1）When 2n =，

211

2

11x x x x =- When the result is right.

（2）The Vander monde determinant conclusion assumptions for the class, now look at the level of .in

1

2

3

2

2221

2

3

-1

-1-1-11231111n

n n

n n n n n

x x x x D x x x x x x x x =

，Subtracting the 1n - rows 1x times, the first 1n - rows by subtracting 2n - 1x times, that is, a bottom-up sequentially subtracted from each row on row 1x timeshare 有

21

31122212

313

112

12

1

2

2123131111100

0n n n

n n n n n n n n

x x x x x x d x x x x x x x x x x x x x x x x x x ---------=------

21

31122212

313

11212

12

2123131n n n

n n n n n n n n x x x x x x x x x x x x x x x x x x x x x x x x ------------=--

-

22

3

2131122

2

3111()()()

n n

n n n n x x x x x x x x x x x x ---=---

The latter determinant is a 1n - Van Dear Mind determinant, according to the induction assumption, it is equal to all possible difference i j x x -()2j i n ≤<≤；Contains

i x difference all appear in front of the consequent conclusion van dear Mend determinant

of the level n the establishment of mathematical induction, the proof is completed ?

This result can be abbreviated as even the multiplication sign

2

3

2222

3

111

112111()

n

n i j j i n

n n n n

x x x x x x x x x x x ≤<≤---=

-∏

Immediately by the results obtained necessary and sufficient condition for van der Mond determinant is zero

123,,,,n x x x x

At least two equal number n

The application of the Vander monde determinant

（一）Vander monde determinant in the determinant calculation

The Vander monde determinant standards form ：

1

2

2

2212

1

1

1

112111()n

n n i j n i j n n n n

x x x D x x x x x x x x ≥>≥---==

-∏

According to the characteristics of the Vander monde determinant given determinant using various methods, including some non-Vander monde determinant into the Vander monde determinant, and then use the results of the Vander monde determinant, it calculated. The common method of following ：

1. Given determinant of the columns (or rows) are different powers of an element, but the number of power arrangement with the Vander monde determinant is not exactly the same, the need to use the nature of the determinant (such as extraction common divisor, change each line (or column) order, the dissolution of items, etc.) as the determinant of the Vander monde determinant.

Example 1.

2

22

111222333n

n n n

D n n n =

Solutions of n D elements of each row are a number from left to right in ascending order, but not from 0 to n . But by a delivery rosé. The common factor, such as extraction of each line number of a power from zero change to 1n -..

[]

21

212

1

1

111

1

222!!(21)(31)(1)(32)

(2)

(1)1

3331

n n n n D n n n n n n n

n n ---==-------!(1)!(2)!2!1!n n n =--

Example 2

11

1

1(1)()(1)()11

1

1

n n n n n n a a a n a a a n D a a a n ---+----=

-

-

Solution The law of the law of the determinant arranged with the arrangement of the Vander monde determinant on the contrary, to make the columns in the 1n D + elements of a power of frequency from top to bottom in ascending order, the 1n + columns uplink switch in turn until the first line, n rows sequentially exchanged with the uplink until the second row 2nd row sequentially with uplink switch until the first n rows, so after a total of

(1)

(1)(2)212

n n n n n ++-+-+

++=

Sub-line exchange Vander monde determinant of order 1n +：

[]

[](1)2

1111

(1)2

1

1

111

(1)

(1)()(1)

()(1)

(1)(2)

()2(1)((1))!

n n n n n n n

n

n n n

k a

a a n D a a a n a a a n a a a a a n a a a a n a n k ++---+=--=-----=--------------=∏ If n D i th row (column) consists of two branches (column), any two adjacent lines (columns) contain the same branch (column); and contains the Vander monde ranks n branches (column)type, then the n D i-th row (column) multiplied by -1 added to the 1i + -row (column) to eliminate some of the branches (column) into the Vander monde determinant ：

Example3

1234222211

22

33

44

2323232311223344

1

1111sin 1sin 1sin 1sin sin sin sin sin sin sin sin sin sin sin sin sin sin sin sin sin D +Φ+Φ+Φ+Φ=

Φ+ΦΦ+ΦΦ+ΦΦ+ΦΦ+ΦΦ+ΦΦ+ΦΦ+Φ

Solution will be the first line of the d multiplied by -1 to the second line we have:

1

2

3

4

222211

22

33

44

2323232311223344

1111sin sin sin sin sin sin sin sin sin sin sin sin sin sin sin sin sin sin sin sin ΦΦΦΦΦ+ΦΦ+ΦΦ+ΦΦ+ΦΦ+ΦΦ+ΦΦ+ΦΦ+Φ

Then the second row of the above determinant is multiplied by -1 added to line 3, the new determinant line 3 line 4 was multiplied by -1 added:

1234222214

1234

33341

2

3

4

1

111sin sin sin sin (sin sin )sin sin sin sin sin sin sin sin i j j i D ≤<≤ΦΦΦΦ=

=

Φ-ΦΦΦΦΦΦΦΦΦ∏

2 plus line to add law

Each row (or column) the different square a power of the whose elements are all the of an element, but are the lack of the the determinant of the same party a power of, available this method:

Example 4

2

22123

3

312

12

11

1

3n

n n

n n n

x x x D x x x x x x =

Solution for order determinant ：

12

22221213

33312

121111n

n n n

n

n

n n n

z

x x x z x x x D z x x x z x x x +=

=

1

()()n

i

j k i l k j n

x z x x =≤<≤--∏∏

z seen by made determinant coefficient D -, by the coefficients of the above equation z :

21

1211

(1)

()()n

n n j k i n j k l

i x x x x x x -=≥>≥--∑∏

By comparing the coefficients obtained:

12

11

()()n

n j k i n j k l

i D x x x x x x =≥>≥=-∑∏

3 Laplace expansion methods

Apply the formula D = 1122n n M A M A M A ++ to calculate the value of the

determinant ：

Example 5

1

11

111

122

122

111000

0100

1000

10

1000

1

n n n n n n n

n n

n

x x y y x x D y y

x x y y ------=

Dereference lines 1，3，

21n -, 1，3，21n - series expansion ：

11

111111

2222

11

11

11

1

1

n n n n n n n

n n

n

x x y y x x y y D x x y y ------=

=

()()j i j i n j i l

x x y y ≥>≥--∏

4 product transformation method Example 6

Set up 1

2

1

(0,1,

22)n

k k k k k n

i i s x

x x x k n ==++

+==-∑，Compute the determinant

11121

22

n n n n

n s s s s s s D s s s ---=

Solution

11121

1

1

12221

1

1n

n

n i

i

i i n

n

n

n i

i

i

i i i n

n

n

n n n i

i

i i i n

x

x

x

x

x D x

x

x

-=====--====

∑∑∑∑∑∑∑∑

2

1

11112212

22

2

2

2

12

211112

2

111

1

11()n n

n n

n n n n n

n

n

n

j i l i j n

x x x x x x x x x x x x x x

x

x x x x x -----≤<≤==

-

∏

. Ascending Order

Example 7 compute the determinant

2

2

1111222

2

2

2

221111221111

n n

n n n n n n n n n n n

n

n

n

x x x x x x x x D x x x x x x x x --------=

The solution D l order for the following 1n +-order determinant

2

2

1

1111122122

2

2

2

1

221111112212

2

1

11

111

n n n

n n n n n n n n n n n n n n n n n n n n n n n

x x x x x x x x x x x x

x x x

x x

x x x

x

x

x

x

x

----+-----------=

Insert a row with a

1n +,1

2,,,n x x x x , 1n + order Vander monde determinant, where

x is the variable, so therefore

1

121()()()

()n n i j j i n

x x x x x x x x +≤<≤=----∏

1n +

G H

polynomial, it can be written as

{}11

121()(1)()n n n i j n j i n

x x x x x x x -+≤<≤=

-+-++

++

∏

On the other hand, the

1n +

started their first 1n +-line, that was

2111

1()(1)n n n n i j j i n

x x x Dx +-+≤<≤=

-+-+

∏

Compare

1n +

1n x - factor that was

121()

()n i j j i n

D x x x x x ≤<≤=+++-∏

(B) The Vander monde determinant polynomial theory

Example 1 01(),n n f x c c x c x =++

set ()f x is at least 1n + type root,

()0f x =。

Proof of 121,,

n x x x + ()f x 1n + different root, homogeneous linear equations

20112112012222201121

10,0,

0,

n n n

n n n n n n c c x c x c x c c x c x c x c c x c x c x +++?++++=?++++=??

?

?++++=? (2) Where 01,,

n c c c as unknown amount

Vander monde Determinant D is because the coefficients of the equations (2), and

1()0,

j i i j n

D x x ≤<≤=

-≠∏

Equations (2) only the zero solution, thus

010,n c c c ====is ()f x zero polynomial.

Example 2 Let 12

,n a a a number different from each other in the number field F,

12,,n b b b is any number field F Group given not all zero number, then there exists a

unique number field F number of less than polynomial in n ()f x ，Make ()i f a =i b ，

1,2,i n =

Proof Let 1011(),n n f x c c x c x --=++

+, by the condition ()i i f a b = , 1,2,

i n =

know

10111111

121221011,

,

,

n n n n n n

n n n c c a c a b c c a c a b c c a c a b ------?+++=?

++

+=???

?+++=? （3）

12,,n a a a different from each other, so the coefficients of the equations (3) determinant

2

1112122

2

12111()01

n n n j i i j n

n n

n

n

a a a a a a D a a a a a --≤<≤-=

=

-≠∏

The equations (3) has a unique solution, that is only the number of times less than a polynomial in n

1011(),n n f x c c x c x --=++

Make ()i i f a b =，1,2,

i n =

Example 3 Let polynomial 1212(),n p p p n f x a x a x a x =+++0,1,2,

i a i n ≠=，

,i j p p ≠

,,1,2,

i j i j n ≠=，()f x impossible to have a non-zero weight is greater than the root

of 1n -.

Proof Anti weight greater than ()f x 0α≠ 1n - root, ()f α=0，()0,

f α'=

(1)()0,n f α-= And then 1(1)()0,()0,

()0.n n f f f ααααα--'=== That

12121212112211

1122220,0,

(1)(2)(1)(2)(1)(2)0

n n n p p p n p p p

n n p p p n n n n a a a p a p a p a p p p n a p p p n a p p p n a ααααααααα?+++=?++=??

?

?--++--+++--+=?（4） (4) as the unknown quantity in 1212,,,n p p

p

n a a a ααα homogeneous system of linear

equations (4) coefficient determinant

1211221112221

11(1)

(1)

(1)

(1)

(2)

(1)

(2)

(1)

(2)

n n n n n n p p p D p p p p p p p p p n p p p n p p p n =

-----+--+--+

=

1

2

2

221

2

11

1112111()0

n

n j i i j n

n n n n

p p p p p p p p p p p ≤<≤---=

-≠∏

Equations (4) only the zero solution, thus 0,1,2,i

p i a i n α

== must 0,α=

This is 0α≠ contradiction, it is non-zero root of multiplicity greater than 1n + ()f x

no