×
×

# Solutions for Chapter 2.1: Logical Form and Logical Equivalence

## Full solutions for Discrete Mathematics with Applications | 4th Edition

ISBN: 9780495391326

Solutions for Chapter 2.1: Logical Form and Logical Equivalence

Solutions for Chapter 2.1
4 5 0 238 Reviews
21
1
##### ISBN: 9780495391326

Chapter 2.1: Logical Form and Logical Equivalence includes 54 full step-by-step solutions. Discrete Mathematics with Applications was written by and is associated to the ISBN: 9780495391326. This textbook survival guide was created for the textbook: Discrete Mathematics with Applications , edition: 4. This expansive textbook survival guide covers the following chapters and their solutions. Since 54 problems in chapter 2.1: Logical Form and Logical Equivalence have been answered, more than 57343 students have viewed full step-by-step solutions from this chapter.

Key Math Terms and definitions covered in this textbook
• Adjacency matrix of a graph.

Square matrix with aij = 1 when there is an edge from node i to node j; otherwise aij = O. A = AT when edges go both ways (undirected). Adjacency matrix of a graph. Square matrix with aij = 1 when there is an edge from node i to node j; otherwise aij = O. A = AT when edges go both ways (undirected).

• Affine transformation

Tv = Av + Vo = linear transformation plus shift.

• Cofactor Cij.

Remove row i and column j; multiply the determinant by (-I)i + j •

• Column space C (A) =

space of all combinations of the columns of A.

• Commuting matrices AB = BA.

If diagonalizable, they share n eigenvectors.

• Diagonal matrix D.

dij = 0 if i #- j. Block-diagonal: zero outside square blocks Du.

• 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.

• Fibonacci numbers

0,1,1,2,3,5, ... satisfy Fn = Fn-l + Fn- 2 = (A7 -A~)I()q -A2). Growth rate Al = (1 + .J5) 12 is the largest eigenvalue of the Fibonacci matrix [ } A].

• Four Fundamental Subspaces C (A), N (A), C (AT), N (AT).

Use AT for complex A.

• Full row rank r = m.

Independent rows, at least one solution to Ax = b, column space is all of Rm. Full rank means full column rank or full row rank.

• Fundamental Theorem.

The nullspace N (A) and row space C (AT) are orthogonal complements in Rn(perpendicular from Ax = 0 with dimensions rand n - r). Applied to AT, the column space C(A) is the orthogonal complement of N(AT) in Rm.

• Gram-Schmidt orthogonalization A = QR.

Independent columns in A, orthonormal columns in Q. Each column q j of Q is a combination of the first j columns of A (and conversely, so R is upper triangular). Convention: diag(R) > o.

• Hankel matrix H.

Constant along each antidiagonal; hij depends on i + j.

• Left inverse A+.

If A has full column rank n, then A+ = (AT A)-I AT has A+ A = In.

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

• Network.

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

• Permutation matrix P.

There are n! orders of 1, ... , n. The n! P 's have the rows of I in those orders. P A puts the rows of A in the same order. P is even or odd (det P = 1 or -1) based on the number of row exchanges to reach I.

• Pivot.

The diagonal entry (first nonzero) at the time when a row is used in elimination.

• Projection matrix P onto subspace S.

Projection p = P b is the closest point to b in S, error e = b - Pb is perpendicularto S. p 2 = P = pT, eigenvalues are 1 or 0, eigenvectors are in S or S...L. If columns of A = basis for S then P = A (AT A) -1 AT.

• Spanning set.

Combinations of VI, ... ,Vm fill the space. The columns of A span C (A)!

×