Scribd Logo
Upload

Welcome to Scribd!

  • Det D

    Uploaded by

    s
    12 views4 pages
    The document summarizes the calculation of the determinant of an n×n matrix Dn where the entries are of the form 1+x2, x, or 0 in a recursive manner. It is shown that the determinant satisfies the recursion Dn=(1+x2)Dn-1 - x2Dn-2 for x2≠1, x≠±1. Explicit formulas for the coefficients c1 and c2 in the solution Dn=c1+c2x2n are derived. For the cases where x2=1 and x=±1, it is proved by induction that the determinant is given by detDn=n+1.

    Original Description:

    Original Title

    det D

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document summarizes the calculation of the determinant of an n×n matrix Dn where the entries are of the form 1+x2, x, or 0 in a recursive manner. It is shown that the determinant satisfies the recursion Dn=(1+x2)Dn-1 - x2Dn-2 for x2≠1, x≠±1. Explicit formulas for the coefficients c1 and c2 in the solution Dn=c1+c2x2n are derived. For the cases where x2=1 and x=±1, it is proved by induction that the determinant is given by detDn=n+1.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    12 views4 pages

    Det D

    Uploaded by

    s
    The document summarizes the calculation of the determinant of an n×n matrix Dn where the entries are of the form 1+x2, x, or 0 in a recursive manner. It is shown that the determinant satisfies the recursion Dn=(1+x2)Dn-1 - x2Dn-2 for x2≠1, x≠±1. Explicit formulas for the coefficients c1 and c2 in the solution Dn=c1+c2x2n are derived. For the cases where x2=1 and x=±1, it is proved by induction that the determinant is given by detDn=n+1.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 4

    1 + 𝑥2 𝑥 0 ⋯ 0

    𝑥 1 + 𝑥2 𝑥 ⋯ 0
    | 𝑥 ⋯ 0 || =
    det Dn= | 0 1 + 𝑥2
    ⋮ ⋮ ⋮ ⋱ ⋮
    0 0 0 ⋯ 1 + 𝑥 2 𝑛𝑥𝑛

    1 + 𝑥2 𝑥 0 ⋯ 0
    2
    𝑥 1+𝑥 𝑥 ⋯ 0
    2 |
    =(1 + 𝑥 )* | 0 𝑥 2 ⋯ 0 || –x*
    1+𝑥
    ⋮ ⋮ ⋮ ⋱ ⋮
    0 0 0 ⋯ 1 + 𝑥 2 (𝑛−1)𝑥(𝑛−1)
    𝑥 0 0 ⋯ 0
    2
    𝑥 1+𝑥 𝑥 ⋯ 0
    |0 𝑥 1 + 𝑥 2 ⋯ 0 || = =(1 +
    |
    ⋮ ⋮ ⋮ ⋱ ⋮
    0 0 0 ⋯ 1 + 𝑥 2 (𝑛−1)𝑥(𝑛−1)
    1 + 𝑥2 𝑥 0 ⋯ 0
    2
    𝑥 1+𝑥 𝑥 ⋯ 0
    2 |
    𝑥 )* | 0 𝑥 2 ⋯ 0 || – x2 *
    1+𝑥
    ⋮ ⋮ ⋮ ⋱ ⋮
    0 0 0 ⋯ 1 + 𝑥 2 (𝑛−1)𝑥(𝑛−1)
    1 + 𝑥2 𝑥 0 ⋯ 0
    2
    𝑥 1+𝑥 𝑥 ⋯ 0
    *| 0| 𝑥 2 ⋯ 0 ||
    1+𝑥
    ⋮ ⋮ ⋮ ⋱ ⋮
    0 0 0 ⋯ 1 + 𝑥 2 (𝑛−2)𝑥(𝑛−2)

    Dn=(1 + 𝑥 2 ) *Dn-1 - x2 *Dn-2

    Za x2≠ 1 , x ≠ ±𝟏

    Dn-(1 + 𝑥 2 ) *Dn-1 + x2 *Dn-2=0

    r2-(1 + 𝑥 2 ) *r + x2 =0

    1+𝑥 2 ±√(1+𝑥 2 )2 −4𝑥 2 1+𝑥 2 ±√1+2𝑥 2 +𝑥 4 −4𝑥 2 1+𝑥 2 ±√(1−𝑥 2 )2 1+𝑥 2 ±(1−𝑥 2 )
    r1,2= = = =
    2 2 2 2

    1+𝑥 2 +1−𝑥 2
    r1= =1
    2
    1+𝑥 2 −(1−𝑥 2 ) 1+𝑥 2 −1+𝑥 2
    r2 = = = x2
    2 2

    Dn=c1 * r1n - c2 r2n

    Dn=c1 * 1 - c2 * x 2n

    n=1 D1 = 1+x2

    D1 = c1 * 1 + c2 * x 2 => c1 * 1 + c2 * x 2 = 1+x2

    n=2 D1 = (1+x2)2-x2

    D1 = c1 * 1 + c2 * x 4 => c1 * 1 + c2 * x 4 = (1+x2)2-x2

    c1 * 1 + c2 * x 2 = 1+x2

    c1 * 1 + c2 * x 4 = (1+x2)2 - 𝑥 2

    c1 * 1 + c2 * x 2 = 1+x2

    c1 * 1 + c2 * x 4 = 1 + 2𝑥 2 + 𝑥 4 − 𝑥 2

    c1 = 1+ x2 - c2 * x 2

    c1 * 1 + c 2 * x 4 = 𝑥 4 + 𝑥 2 + 1

    1 + x2 - c2 * x 2 + c2 * x 4 = 𝑥 4 + 𝑥 2 + 1

    - c2 * x 2 + c2 * x 4 = 𝑥 4

    c2 (x 4 + x 2) = 𝑥 4
    𝑥4 𝑥2
    c2 = =
    𝑥 4 −𝑥 2 𝑥 2 −1

    𝑥2 𝑥4 (1+𝑥 2 )(𝑥 2 −1)−𝑥 4 𝑥 2 −1+𝑥 4 −𝑥 2 −𝑥 4


    c1 = 1+ x2 - x 2* = 1+ x2 - = =
    𝑥 2 −1 𝑥 2 −1 𝑥 2 −1 𝑥 2 −1

    1
    c1 =
    1−𝑥 2

    1 𝑥2 1 𝑥 2 𝑥 2𝑛 1+𝑥 2 𝑥 2𝑛 1+𝑥 2(𝑛+1)


    Dn= 2
    - x 2n * = + = =
    1−𝑥 𝑥 2 −1 1−𝑥 2 1−𝑥 2 1−𝑥 2 1−𝑥 2
    Za x2 = 1 , x = ±𝟏

    1 + ±12 ±1 0 ⋯ 0
    ±1 1 + ±12 ±1 ⋯ 0
    det Dn= || 0 ±1 1 + ±12 ⋯ 0 | =
    |
    ⋮ ⋮ ⋮ ⋱ ⋮
    0 0 0 ⋯ 1 + ±12
    𝑛𝑥𝑛
    2 ±1 0 ⋯ 0
    ±1 2 ±1 ⋯ 0
    | 0 ±1 2 ⋯ 0|
    | |
    ⋮ ⋮ ⋮ ⋱ ⋮
    0 0 0 ⋯ 2 𝑛𝑥𝑛
    dokazujemo indukcijom

    det D1=2

    det D2=2*2-1*1=3

    pretpostavimo da vazi za neko n=k-2 i n=k-1 : det Dk-2=k-1, det Dk-1=k,

    dokazimo da vazi i za n=k, tj. da je det Dk=k+1,


    2 ±1 0 ⋯ 0 2 ±1 0 ⋯ 0
    ±1 2 ±1 ⋯ 0 ±1 2 ±1 ⋯ 0
    det Dk= || 0 ±1 2 ⋯ 0|| = 2* || 0 ±1 2 ⋯ 0|| -
    ⋮ ⋮ ⋮ ⋱ ⋮ ⋮ ⋮ ⋮ ⋱ ⋮
    0 0 0 ⋯ 2 𝑘𝑥𝑘 0 0 0 ⋯ 2 (𝑘−1)𝑥(𝑘−1)
    ±1 ±1 0 ⋯ 0
    0 2 ±1 ⋯ 0
    (±1)* | 0 ±1 2 ⋯ 0||
    | =
    ⋮ ⋮ ⋮ ⋱ ⋮
    0 0 0 ⋯ 2 (𝑘−1)𝑥(𝑘−1)
    2 ±1 0 ⋯ 0
    ±1 2 ±1 ⋯ 0
    2*| 0 ±1 2 ⋯ 0||
    | -(±1) ∗
    ⋮ ⋮ ⋮ ⋱ ⋮
    0 0 0 ⋯ 2 (𝑘−1)𝑥(𝑘−1)
    2 ±1 0 ⋯ 0
    ±1 2 ±1 ⋯ 0
    (±1)*| 0 ±1 2 ⋯ 0||
    | = 2* Dk-1 - (±1) ∗ (±1) ∗ Dk-2 = 2* Dk-1
    ⋮ ⋮ ⋮ ⋱ ⋮
    0 0 0 ⋯ 2 (𝑘−2)𝑥(𝑘−2)
    - 1 ∗ Dk-2 = 2* k - 1 ∗ (k-1) = 2k – k + 1 = k+1

    Dokazano.

    You might also like