Let K = C. Classify the following affine varieties up to isomorphism V (T;T-), V(T{ +T3), V(T† – Tỷ – 1), V(T† +Tỷ – T3) A'\ {0}, V(T2 – Tỉ,T, – Tỷ) \ {0}, where the first four varieties are subsets of A2 and the last is a subset of A3. In other words, determine which of them are isomorphic and which are not.

Let K = C. Classify the following affine varieties up to isomorphism V (T;T-), V(T{ +T3), V(T† – Tỷ – 1), V(T† +Tỷ – T3) A'\ {0}, V(T2 – Tỉ,T, – Tỷ) \ {0}, where the first four varieties are subsets of A2 and the last is a subset of A3. In other words, determine which of them are isomorphic and which are not.

Advanced Engineering Mathematics

10th Edition

ISBN:9780470458365

Author:Erwin Kreyszig

Publisher:Erwin Kreyszig

Chapter2: Second-order Linear Odes

Section: Chapter Questions

Problem 1RQ

See similar textbooks

Similar questions

4. Let A = {1,2, 3, 4} := B. (a) What is the cartesian product of A and B. (b) Find S:= {(a,b)l € Z}. (c) Define Anti-symmetric and Partial order. (d) Is S a Partial Order? Justify your answer.
2
+ Crun) 2. You are given that T : U→ X is a linear transformation. Prove that, T(c,u, + c2U2 + = c, T(u,) + C2T(u2) + c,T(un) for all u; e U and for all c; e R and n2 1. +..
1. Show that which of these relations on the set of all functions on Z→Z are equivalence relations? (a) R = {(S,8)|S (1) –g(1)} (b) R = {(f,g)|f (0) = g (0) or f(1)=g(1)}
6. 'The mapping T :R³ → R² is defined as T (x, y, z) = (x + 2y+ 3z, x + 3y + 2z) is a linear transformation from R³ into R². Then %3D its Kernel T is (a) L {c} where a = (- 1, 5, 1) (b) L{a} where a = (- 1, 1, 5) (ç) L{a} where a = (- 5, 1, 1) (d) None of these
3. Consider a formula Væ3y3zVuE(x, y) ^ E(x, z) ^ (u = x V ¬E(u, y) V ¬E(u, z)). Here, 2, y, z, u e V for some graph G = (V, E), and E() is the edge relation. Assume that Vu¬E(v, v), and that |V| = n. (a) What is the maximal possible number of edges in an undirected graph satisfying this formula? (b) What is the minimal possible number of edges in an directed graph satisfying this formula? Show both that there exists a graph with that many edges (you can just describe how to construct such a graph), and that this number is optimal.
9. (Harder) show that given any three distinct points 2₁, 22, 23 in the z-plane, and any three points w₁, W2, W3 in the w-plane, there exists a Möbius transformation sending z; → w; for each j = 1, 2, 3. Wj
2. Let A: V→ V be a linear map. Show that the following statements are equivalent: (a) 0 is an isolated fixed point of A. (b) A – I:V –→ Vis an isomorphism. (c) 0 is a Lefschetz fixed point of A. (d) A is a Lefschetz map.
f: CA, SA)→(8,S) be an order isomorphism and, Sa={xEA: x
10. Let L: R R' be a map defined as follows: (4x1 +4 x2 - 2 x3 -9 x4 5x1 +2 x2 - 3 x3-9 x4 6x) – 4 x3 - 9 x4 7x1-2x2-5x3-9 x4) X2 X3 X4, (a) Show that L is a linear transformation on R'. (b) Write out the matrix S which represents L with respect to the standard basis. (c) Find a basis for Range S and Ker S. (d) State the "rank-nullity theorem" and verify explicitly that the result obtained in part (c) matches the statement of the theorem.
#5
4. Let X= {a,b,c}with topology t, = {ø, X,{a},{a,b}} and Y= {1,2,3} with topology r, = {6,Y,{1,2},{2},{2,3}}. Define f (a)=1, f(b)=1 and f(c)=2. Verify whether f is an open map. %3D