# Linear Algebra Exercises

Content type
User Generated
Subject
Linear Algebra
Type
Other
Rating
Showing Page:
1/5
Algebra
First Middle Last
Name of Institution

Showing Page:
2/5
ALGEBRA 2
In a rectangular array of nonnegative real numbers with r rows and c columns, and with r < c,
each column contains at least one positive element.
Prove: There exists a positive element for which the sum of the elements of the intersecting row
(its row sum) is larger than the sum of the elements of the intersecting column (its column sum).
Solution
We will use induction to prove the statement.
Step 1: Proving that the statement holds for the base case, r = 1
Considering r = 1, a single row would have at least two elements. As each column contains at
least one positive element, all the elements would be positive.
Hence, the row sum is bigger than any column (which would be a single element)
Step 2: Proving that the statement holds for r assuming it is correct for any number of
rows less then r. (Note: A row intersecting a column means that they have a mutual positive
element)
Scenario 1: There is a subset of k rows, where the columns set that would intersect any of them
would have a size of < k. For example, row having zero values, or two rows that have single
nonzero elements in the same column.
If such a subset exists, then we can remove out both the k rows and all the intersecting columns.
We will have a new formation of the matrix, with fewer rows and less columns. Therefore, there
will be more columns as compared to rows since more rows than columns have been eliminated.

Showing Page:
3/5

End of Preview - Want to read all 5 pages?
Access Now
Unformatted Attachment Preview
1 Running Head: ALGEBRA Algebra First Middle Last Name of Institution ALGEBRA 2 Task In a rectangular array of nonnegative real numbers with r rows and c columns, and with r < c, each column contains at least one positive element. Prove: There exists a positive element for which the sum of the elements of the intersecting row (its row sum) is larger than the sum of the elements of the intersecting column (its column sum). Solution We will use induction to prove the statement. Step 1: Proving that the statement holds for the base case, r = 1 Considering r = 1, a single row would have at least two elements. As each column contains at least one positive element, all the elements would be positive. Hence, the row sum is bigger than any column (which would be a single element) Step 2: Proving that the statement holds for r assuming it is correct for any number of rows less then r. (Note: A row intersecting a column means that they have a mutual positive element) Scenario 1: There is a subset of k rows, where the columns set that would intersect any of them would have a size of < k. For example, row having zero values, or two rows that have single nonzero elements in the same column. If such a subset exists, then we can remove out both the k rows and all the intersecting columns. We will have a new formation of the matrix, with fewer rows and less columns. Therefore, there will be more columns as compared to rows since more rows than columns have been eliminated. ALGEBR ...
Purchase document to see full attachment
User generated content is uploaded by users for the purposes of learning and should be used following Studypool's honor code & terms of service.

### Review

Anonymous
Goes above and beyond expectations!

Studypool
4.7
Indeed
4.5
Sitejabber
4.4