Log in to StudySoup
Get Full Access to Math - Textbook Survival Guide
Join StudySoup for FREE
Get Full Access to Math - Textbook Survival Guide

Solutions for Chapter Chapter 8: Algebra

Full solutions for Mathematics: A Discrete Introduction | 3rd Edition

ISBN: 9780840049421

Solutions for Chapter Chapter 8: Algebra

Solutions for Chapter Chapter 8
4 5 0 337 Reviews
Textbook: Mathematics: A Discrete Introduction
Edition: 3
Author: Edward A. Scheinerman
ISBN: 9780840049421

This expansive textbook survival guide covers the following chapters and their solutions. This textbook survival guide was created for the textbook: Mathematics: A Discrete Introduction, edition: 3. Chapter Chapter 8: Algebra includes 21 full step-by-step solutions. Since 21 problems in chapter Chapter 8: Algebra have been answered, more than 9306 students have viewed full step-by-step solutions from this chapter. Mathematics: A Discrete Introduction was written by and is associated to the ISBN: 9780840049421.

Key Math Terms and definitions covered in this textbook
  • Cayley-Hamilton Theorem.

    peA) = det(A - AI) has peA) = zero matrix.

  • Change of basis matrix M.

    The old basis vectors v j are combinations L mij Wi of the new basis vectors. The coordinates of CI VI + ... + cnvn = dl wI + ... + dn Wn are related by d = M c. (For n = 2 set VI = mll WI +m21 W2, V2 = m12WI +m22w2.)

  • Characteristic equation det(A - AI) = O.

    The n roots are the eigenvalues of A.

  • Diagonalizable matrix A.

    Must have n independent eigenvectors (in the columns of S; automatic with n different eigenvalues). Then S-I AS = A = eigenvalue matrix.

  • Elimination matrix = Elementary matrix Eij.

    The identity matrix with an extra -eij in the i, j entry (i #- j). Then Eij A subtracts eij times row j of A from row i.

  • Exponential eAt = I + At + (At)2 12! + ...

    has derivative AeAt; eAt u(O) solves u' = Au.

  • Factorization

    A = L U. If elimination takes A to U without row exchanges, then the lower triangular L with multipliers eij (and eii = 1) brings U back to A.

  • Free columns of A.

    Columns without pivots; these are combinations of earlier columns.

  • Linear combination cv + d w or L C jV j.

    Vector addition and scalar multiplication.

  • Linearly dependent VI, ... , Vn.

    A combination other than all Ci = 0 gives L Ci Vi = O.

  • Minimal polynomial of A.

    The lowest degree polynomial with meA) = zero matrix. This is peA) = det(A - AI) if no eigenvalues are repeated; always meA) divides peA).

  • Multiplier eij.

    The pivot row j is multiplied by eij and subtracted from row i to eliminate the i, j entry: eij = (entry to eliminate) / (jth pivot).

  • Network.

    A directed graph that has constants Cl, ... , Cm associated with the edges.

  • Orthogonal subspaces.

    Every v in V is orthogonal to every w in W.

  • Reduced row echelon form R = rref(A).

    Pivots = 1; zeros above and below pivots; the r nonzero rows of R give a basis for the row space of A.

  • Right inverse A+.

    If A has full row rank m, then A+ = AT(AAT)-l has AA+ = 1m.

  • Schwarz inequality

    Iv·wl < IIvll IIwll.Then IvTAwl2 < (vT Av)(wT Aw) for pos def A.

  • Trace of A

    = sum of diagonal entries = sum of eigenvalues of A. Tr AB = Tr BA.

  • Transpose matrix AT.

    Entries AL = Ajj. AT is n by In, AT A is square, symmetric, positive semidefinite. The transposes of AB and A-I are BT AT and (AT)-I.

  • Wavelets Wjk(t).

    Stretch and shift the time axis to create Wjk(t) = woo(2j t - k).

Log in to StudySoup
Get Full Access to Math - Textbook Survival Guide
Join StudySoup for FREE
Get Full Access to Math - Textbook Survival Guide
Reset your password