• Non ci sono risultati.

(a) Find c assuming that c > 0. Find also the vertex and the equation of C.

N/A
N/A
Protected

Academic year: 2021

Condividi "(a) Find c assuming that c > 0. Find also the vertex and the equation of C."

Copied!
4
0
0

Testo completo

(1)

LAG, written test of JULY 20, 2012

1. Let C be a parabola in V

2

, with focus in (0, 0), directrix of equation 4x + 3y = c, and such that (1, 0) ∈ C.

(a) Find c assuming that c > 0. Find also the vertex and the equation of C.

(b) Find c assuming that c < 0.

2. A particle moves along the ellipse 4x

2

+y

2

= 1 with position vector r(t) = (f (t), g(t)).

The motion is such that f

0

(t) = −g(t) for every t.

How much time is required for the particle to go once around the ellipse?

3. Let T : V

4

→ V

3

defined by T (

 x y z t

 ) =

x + y + z − t x + 2y + z + t

2x + 3y + 2z

.

(a) Find dimensions and bases of N (T ) and T (V

4

).

(b) Does

 1

−1 0

 belong to T (V

4

)? If the answer is yes, describe the set of all v ∈ V

4

such that T (v) =

 1

−1 0

.

4. Let V be the space of real polynomials, with inner product (P.Q) = R

1

−1

P (x)Q(x)dx.

Moreover let W be the subspace of all polynomials of degree ≤ 2.

Write P (x) = x

3

as the sum of a polynomial in W and of a polynomial orthogonal to W.

5. Find all 3 × 3 symmetric matrices A such that λ = 2 is an eigenvalue of A, L((1, 1, 1), (1, 2, −1)) is an eigenspace of A, and det(A) = −100.

SOLUTIONS

1. (a) Let F = (0, 0) be the focus, let P = (1, 0) be the point on C, and let L : 4x+3y = c be the directrix. We have that d(P, F ) = 1. Since – by definition of parabola – d(P, F ) = d(P, L), we have that d(P, L) = 1. We compute

d(P, L) = |(1, 0) · (4, 3) − c|

k (4, 3) k = |4 − c|

5

Hence |4−c| = 5. Since c > 0 then c = 9. In this case the vertex is the point V lying on the line L((4, 3)) such that d(V, F ) = d(V, L). Therefore d(V, F ) is the half of d(F, L) = 9/5.

Hence

V = 9 10

(4, 3)

5 = 9

50 (4, 3)

1

(2)

Cartesian equation:

d((x, y), F ) = p

x

2

+ y

2

= d((x, y), L) = |4x + 3y − 9|

5 Hence 25 x

2

+ 25 y

2

= 16 x

2

+ 9 y

2

+ 81 + 24 xy − 72 x − 54 y , that is

9 x

2

+ 16 y

2

− 24 xy + 72 x + 54 y − 81 = 0.

(b) From the equation |4 − c| = 5 we get that, if c < 0, then c = −1.

2. We have that, for all t, 4(f (t))

2

+ (g(t))

2

= 1. Hence 8f (t)f

0

(t) + 2g(t)g

0

(t) = 0.

Since f

0

(t) = −g(t) we get −g(t)(8f (t) + 2g

0

(t)) = 0. This means that g

0

(t) = 4f (t).

Differentiating once again we get

 f

00

(t) = −g

0

(t) = −4f (t) g

00

(t) = 4f

0

(t) = −4g(t)

From what you know of the differential equation x

00

= c x both f (t) and g(t) are of the form a cos 2t + b sin 2t. It follows that the time needed to go once around the ellipse is T = π.

3. (a) The matrix representing T with respect to the canonical bases of V

4

and V

3

is A =

1 1 1 −1

1 2 1 1

2 3 2 0

. The rank of T is equal to the rank of A. From gaussian elimination

1 1 1 −1

1 2 1 1

2 3 2 0

 →

1 1 1 −1

0 1 0 2

0 1 0 2

 →

1 1 1 −1

0 1 0 2

0 0 0 0

we have the rank is equal to 2. A basis of T (V

4

is, for example, given by two independent columns of A, for example {

 1 1 2

 ,

 1 2 3

}. By the nullity plus rank Theorem, dim N (T ) = 4 − 2 = 2. To find a basis we solve the homogenous system associated to the matrix A.

After the elimination we find y = −2t, x = −z + t. Hence N (T ) is the space of 4-tuples of the form

−z + 3t

−2t z t

 . Thus N (T ) = L(

−1 0 1 0

 ,

 3

−2 0 1

 ).

(b) w =

 1

−1 0

 belongs to T (V

4

) if and only if the linear system AX = w has solutions.

In this case the set of all v ∈ V

4

such that T (v) = w is precisely the set of solutions of the system AX = w. With gaussian elimination we compute

A|w =

1 1 1 −1 1

1 2 1 1 −1

2 3 2 0 0

 →

1 1 1 −1 1

0 1 0 2 −2

0 1 0 2 −2

 →

1 1 1 −1 1

0 1 0 2 −2

0 0 0 0 0

2

(3)

Hence w ∈ T (V

4

) and, solving the system, the set of all v such that T (v) = w is the set of 4-tuples of the form

3 − z + 3t

−2 − 2t z t

 , therefore

 3

−2 0 0

 + L(

−1 0 1 0

 ,

 3

−2 0 1

 ).

4. Note that dim W = 3 and that {1, x, x

2

} is a basis of W. By the Orthogonal Decomposition Theorem, the required decomposition is

x

3

= p

W

(x

3

) + (x

3

− p

W

(x

3

)

where p

W

(x

3

) is the projection of x

3

onto W. To find that, we first need to find an orthogonal basis of W, say {Q

1

, Q

2

, Q

3

}. Then we have that

p

W

(x

3

) = (x

3

, Q

1

)

(Q

1

, Q

1

) Q

1

+ (x

3

, Q

2

)

(Q

2

, Q

2

) Q

2

+ (x

3

, Q

3

) (Q

3

, Q

3

) Q

3

The easiest orthogonal basis of W is found by applying the Gram-Schmidt orthogonaliza- tion to the basis {1, x, x

2

}. Note that (1, x) = 0 so they are already orthogonal. Hence Q

1

= 1 and Q

2

= x. To find Q

3

, we use that

Q

3

= x

2

− (x

2

, Q

1

)

(Q

1

, Q

1

) Q

1

− (x

2

, Q

2

) (Q

2

, Q

2

) Q

2

It is easy to compute the integrals: (x

2

, Q

2

) = 0, (x

2

, Q

1

) = (x

2

, 1) = 2/3, and (Q

1

, Q

1

) = (1, 1) = 2. Hence

Q

3

= x

2

− 1 3

Next, we compute p

W

(x

3

) using the above formula. It is easy to compute that the integrals (x

3

, Q

1

) = (x

3

, Q

3

) = 0. Hence

p

W

(x

3

) = (x

3

, x) (x, x) x =

2 5 2 3

x = 3 5 x

In conclusion, the (unique!) decomposition as requested by the exercise is

x

3

= 3

5 x + (x

3

− 3

5 x)

3

(4)

5. The condition on the eigenspace implies that A has a double eigenvalue. Moreover the product of the eigenvalues has to be equal to −100. Thus there are two possibilities:

λ = 1 = λ

2

= 2, λ

3

= −25 and λ

1

= 2, (λ

2

)

2

= −50. However, the latter possibility is ruled out by the fact that A is supposed to be symmetric, hence its eigenvalues need to be real.

Moreover, since A is symmetric, the eigenvectors of different eigenvalues are perpendic- ular. Therefore E

A

(2) = L((1, 1, 1), (1, 2, −1)) and E

A

(−25) = L((−3, 2, 1)). Let B denote the basis {(1, 1, 1), (1, 2, −1), (−3, 2, 1)}. Letting T

A

: V

3

→ V

3

the linear transformation defined by T

A

(X) = AX, we have that m

BB

(T

A

) = diag(2, 2, −25). Therefore, we consider the matrix C = m

BE

(id) =

1 1 −3

1 2 2

1 −1 1

. We have that diag(2, 2, −25) = C

−1

AC.

Hence

A = C diag(2, 2, −25) C

−1

Finding C

−1

and then computing the above product one finds explicitly the matrix A.

Note that it follows that there is a unique matrix A satisfying the requests of the exercise.

4

Riferimenti

Documenti correlati

(Caranti) Thursday 31 October 2019 (2 hrs) Four lemmata on systems of generators, linearly independent vectors and bases.. Some related exercises: extending a linearly

Because well over 50% of the world population (with peaks of 80% in Europe, United States, Australia, Canada, and Japan) lives in urban, sub-urban, or semi-urban agglomerates,

Solution proposed by Roberto Tauraso, Dipartimento di Matematica, Universit`a di Roma “Tor Vergata”, via della Ricerca Scientifica, 00133 Roma,

This is a contradiction because a positive integer is the sum of two squares if and only if all the prime factors congruent to 3 mod 4 have an even exponent in

[r]

Answer: As a basis of Im A, take the first, fourth and fifth columns, so that A has rank 3. Find a basis of the kernel of A and show that it really is a basis... Does the union of

If S is not a linearly independent set of vectors, remove as many vectors as necessary to find a basis of its linear span and write the remaining vectors in S as a linear combination

Doney, One-sided Local Large Deviation and Renewal Theorems in the Case of Infinite Mean, Probab. Erickson, Strong renewal theorems with infinite

Before acquiring a well-defined position in society, subjects pass through a period and area of ambiguity − a sort of social limbo which has the features neither of the preceding,

Sono i due nuovi coinquilini della vecchia casa di Thomas e Emma, che sentono “the piano playing / Just as a ghost might play”, infatti, il poeta

There- fore an important development of the present work would be represented by the implementation of the developed algorithms on GPU-base hardware, which would allow the

Roots approximates the zeros of a polynomial by computing the eigenvalues of the associated companion matrix, which is a unitary plus rank-one matrix in upper Hessenberg

In modern Astrodynamics and Celestial Mechanics, thanks to the rise of interplanetary exploration that has brought a renewed interest in Lambert’s problem, it has application mainly

This is doing matter since 15 billion years ago, when elementary particles joined to form nucleus, electrons, and hydrogen atoms, which started to form new atoms and molecules,

Figure 3.22: Experimental time series showing the presence of a stable upright position together with a stable large amplitude sub-harmonically resonant roll motion for ITACA in

Tutti i pazienti sono stati sottoposti ad angiografia coronarica quantitativa (QCA) con una nuova coronarografia di follow-up a 9-12 mesi dalla precedura indice: ciò ha

Reduce the equation to canonical form, find the coordinates, with respect to the standard basis of V 2 , of the center/vertex and find the equations/equation of the symmetry

To construct the other three vectors as requested we need to find a basis of W and orthogonalize it... However in this case the calculations are so easy that it can be

We apply the

Zn(II)  8.567 ± 0.185**  6.006 ± 0.604**  Zn‐t CNS  0.710 ± 0.0568*  0.510 ± 0.0258*  CNS  0.00251 ± 0.0001*  0.0245 ± 0.0008*  ASW 

The main contribution of this paper is to provide a complete analysis of the trade-off between performance and information flow in the simple case of the stabilization of a scalar

Patients suffering from  cluster headache, a primary headache disorder, also show similar re- sults, with significantly lower rCBF changes during the headache-free period compared

In Boston, in addition to being instructor in orthopedic surgery at Harvard Medical School (1930–1935) and clinical pro- fessor of orthopedic surgery (1935–1946), he became chief of