×
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 4-1: Classifying Triangles

Full solutions for Geometry | 1st Edition

ISBN: 9780030923456

Solutions for Chapter 4-1: Classifying Triangles

Solutions for Chapter 4-1
4 5 0 287 Reviews
26
2
Textbook: Geometry
Edition: 1
Author: Rinehart, Winston Holt
ISBN: 9780030923456

This textbook survival guide was created for the textbook: Geometry, edition: 1. Chapter 4-1: Classifying Triangles includes 58 full step-by-step solutions. Geometry was written by and is associated to the ISBN: 9780030923456. Since 58 problems in chapter 4-1: Classifying Triangles have been answered, more than 44284 students have viewed full step-by-step solutions from this chapter. This expansive textbook survival guide covers the following chapters and their solutions.

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

  • Augmented matrix [A b].

    Ax = b is solvable when b is in the column space of A; then [A b] has the same rank as A. Elimination on [A b] keeps equations correct.

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

    The n roots are the eigenvalues of A.

  • Cholesky factorization

    A = CTC = (L.J]))(L.J]))T for positive definite A.

  • Column space C (A) =

    space of all combinations of the columns of A.

  • Complete solution x = x p + Xn to Ax = b.

    (Particular x p) + (x n in nullspace).

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

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

    Use AT for complex A.

  • Hessenberg matrix H.

    Triangular matrix with one extra nonzero adjacent diagonal.

  • Inverse matrix A-I.

    Square matrix with A-I A = I and AA-l = I. No inverse if det A = 0 and rank(A) < n and Ax = 0 for a nonzero vector x. The inverses of AB and AT are B-1 A-I and (A-I)T. Cofactor formula (A-l)ij = Cji! detA.

  • Iterative method.

    A sequence of steps intended to approach the desired solution.

  • Kronecker product (tensor product) A ® B.

    Blocks aij B, eigenvalues Ap(A)Aq(B).

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

    Vector addition and scalar multiplication.

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

  • Network.

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

  • Rank one matrix A = uvT f=. O.

    Column and row spaces = lines cu and cv.

  • Rayleigh quotient q (x) = X T Ax I x T x for symmetric A: Amin < q (x) < Amax.

    Those extremes are reached at the eigenvectors x for Amin(A) and Amax(A).

  • Row picture of Ax = b.

    Each equation gives a plane in Rn; the planes intersect at x.

  • Standard basis for Rn.

    Columns of n by n identity matrix (written i ,j ,k in R3).

  • Triangle inequality II u + v II < II u II + II v II.

    For matrix norms II A + B II < II A II + II B II·

×
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