Let V be a finite dimensional vector space over R. If S is a set of elements in V such that Span(S) = V ,

what is the relationship between S and the basis of V ?

Determine whether each of these proposed definitions is
a valid recursive definition of a function f from the set
of nonnegative integers to the set of integers. If f is well
defined, find a formula for f (n) when n is a nonnegative
integer and prove that your formula is valid.

e) f (0) = 2, f (n) = f (n − 1) if n is odd and n ≥ 1 and
f (n) = 2f (n − 2) if n ≥ 2

Let f : G → G′ be a surjective homomorphism between two groups, G and G′, and let N be a normal subgroup of G. Prove that f (N) is a normal subgroup of G′.

Question:

1. Prove that the intersection of two compact sets is compact, using criterion (2).
2. Prove that the intersection of two compact sets is compact, using criterion (1).
3. Prove that the intersection of two compact sets is compact, using criterion (3).

Probably the most important new idea you'll encounter in real analysis is

the concept of compactness. It's the compactness of [a, b] that makes a

continuous function reach its maximum and that makes the Riemann in-

tegral exist. For subsets of R"h, there are three equivalent definitions of

compactness. The first, 9.2(1), promises convergent subsequences. The sec-

ond, 9.2(2) brings together two apparently unrelated adjectives, closed and

bounded. The third, 9.2(3), is the elegant, modern definition in terms of

open sets; it is very powerful, but it takes a while to get used to.

9.1. Definitions. Let S be a set in Rn. S is bounded if it is contained

in some ball B(0, R) about 0 (or equivalently in a ball about any point). A

collection of open sets {U} is an open cover of S if S is contained in U U(.

A finite subcover is finitely many of the Ua which still cover S. Following

Heine and Borel, S is compact if every open cover has a finite subcover.

9.2. Theorem. Compactness. The following are all equivalent conditions

on a set S in ]Rn.

(1) Every sequence in S has a subsequence converging to a point of S.

(2) S is closed and bounded.

(3) S is compact: every open cover has a finite subcover.

Criterion

(1)is the Bolzano-Weierstrass condition for compactness,

which you met for R in Theorem 8.3. The more modern Heine-Borel crite-

rion (3) will take some time to get used to. A nonclosed set such as (0, 1] is

not compact because the open cover {(1/n, oo)} has no finite subcover. An

unbounded set such as R is not compact because the open cover {(-n, n)}

has no finite subcover. This is the main idea of the first part of the proof.

Proof. We will prove that (3)->(2) -> (1) -> (3).

(3) ->(2). Suppose that S is not closed. Let a be an accumulation point

not in S. Then the open cover {{Ix - aI > 1/n}} has no finite subcover.

Suppose that S is not bounded. Then the open cover {{JxI < n}} has no

finite subcover.

(2) -> (1). Take any sequence of points in S C ]Rn. First look at just the

first of the n components of each point. Since S is bounded, the sequence

of first components is bounded. By Theorem 8.3, for some subsequence,

the first components converge. Similarly, for some further subsequence, the

second components also converge. Eventually, for some subsequence, all of

the components converge. Since S is closed, the limit is in S.

(1) =>. (3). Given an open cover {Ua}, first we find a countable subcover.

Indeed, every point x of S lies in a ball of rational radius about a rational

point, contained in some Ua. Each of these countably many balls lies in

some U,,. Let {Vi} be that countable subcover.

Suppose that {V} has no finite subcover. Choose xl in S but not in

V1. Choose X2 in S but not in V1 U V2. Continue, choosing xn in S but

not in U{V : 1 < i < n}, which is always possible because there is no finite

subcover. Note that for each i, only finitely many xn (for which n < i)

lie in V. By (1), the sequence xn has a subsequence converging to some

x in S, contained in some Vi. Hence infinitely xn are contained in Vi, a

contradiction.

9.3. Proposition. A nonempty compact set S of real numbers has a largest

element (called the maximum) and a smallest element (called the minimum).

Proof. We may assume that S has some positive numbers, by translating it

to the right if necessary. Since S is bounded, there is a largest integer part D

before the decimal place. Among the elements of S that start with D, there

is a largest first decimal place d1. Among the elements of S that start with

D.d1, there is a largest second decimal place d2. Keep going to construct

a = D.dld2d3.... By construction, a is in the closure of S.

Since S is closed, a lies in S and provides the desired maximum.

A minimum is provided by - max(-S).

Let P^N denote the vector space of all polynomials of degree N or less, with real coefficients. Let the linear transformation: T: P³ --> P¹ be the second derivative. Is T onto? Explain. Is T one-to-one? What is the Kernel of T? Find the standard matrix A for the linear transformation T. Let B= {x+1 , x-1 , x²+x , x³+x² } be a basis for P³ ; and

F={ x+2 , x-3 } be a basis for P¹ . Find A _F<--B ( the matrix for T relative to the bases B and F).

By using the definition and discussing what is relevant to the situation, interpret each of the following for both the coffee and tea data. Also, compare each for coffee and tea. Be sure to include the relevant information (state the value of or, in the case of the distribution, include the graphs) with each component.

1. Mean
2. Median
3. Modal Interval
4. Range
5. IQR
6. Standard Deviation
7. Distribution of histogram and box plot
8. Slope of each linear model
9. Y-intercept of Coffee vs. Tea
10. Correlation coefficient for each linear model
11. Relevant interpolations or extrapolations
12. Correlation type (from Activity 5) for coffee and tea

Let f:(a, b) → R be a function and n∈N. Assume that f is n-times differentiable and f^(n)(x) = 0 for all x∈(a,b). Show that f is a polynomial of degree at most n−1.

write a descriptive summary on the book "this is our time:everyday myths in the life of the gospel" by trevin wax

A certain dynamical system is governed by the equation x^'' + (x')² + x = 0. Show that the origin is a center in the phase plane and that open and closed paths are separated by the path

2y² = 1- 2x

Find two linearly independent solutions near the regular singular point x₀= 0

x²y'' + (6x + x²)y' + xy = 0

I have a group order 28 is it possible to have an orbit with 6

maybe use sylos thm.

Question C [SD1: 5 Marks]

            A multiple regression analysis between yearly income (Y in $1,000s), college grade point average (X₁), age of the individuals (X₂), and the gender of the individual (X₃; zero representing female and one representing male) was performed on a sample of 10 people, and the following results were obtained.

In parts a and b, A is a matrix representation of a linear transformation in the standard basis. Find a matrix representation of the linear transformation in the new basis. show all steps.

a. A = 2x2 matrix with the first row being 2 and -1, and the second row being 1 and 3; new basis = {<1, 2> , < 1, 1> }

b. A = 3x3 matrix with the first row being 2, 1, -1, the second row being, 0, 1, 3, and the third row being -1, 2, 1. new basis = {< 0, -2, 1 > , <1, 2, 0> , <1, 1, 1,>}.

consider the subspace W=span[(4,-2,1)^T,(2,0,3)^T,(2,-4,-7)^T]

Find

A) basis of W

B) Dimension of W

C) is vector v=[0,-2,-5]^T contained in W? if yes espress as linear combantion

Solve the given system of differential equations by systematic elimination. (D + 1)x + (D − 1)y = 6 ; 7x + (D + 6)y = −1