On the Toric Varieties Associated with Bicolored Metric Trees Khoa Lu Nguyen Joseph Shao Summer REU 2008 at Rutgers University Advisors: Prof. Woodward.

Slides:



Advertisements
Similar presentations
Vector Spaces A set V is called a vector space over a set K denoted V(K) if is an Abelian group, is a field, and For every element vV and K there exists.
Advertisements

CSCI 115 Chapter 6 Order Relations and Structures.
Polynomial dynamical systems over finite fields, with applications to modeling and simulation of biological networks. IMA Workshop on Applications of.
Degenerations of algebras. José-Antonio de la Peña UNAM, México Advanced School and Conference on Homological and Geometrical Methods in Representation.
Augmenting Data Structures Advanced Algorithms & Data Structures Lecture Theme 07 – Part I Prof. Dr. Th. Ottmann Summer Semester 2006.
Recursive Definitions and Structural Induction
Counting Chapter 6 With Question/Answer Animations.
Probabilistic verification Mario Szegedy, Rutgers www/cs.rutgers.edu/~szegedy/07540 Lecture 3.
Polynomial Ideals Euclidean algorithm Multiplicity of roots Ideals in F[x].
The Structure of Polyhedra Gabriel Indik March 2006 CAS 746 – Advanced Topics in Combinatorial Optimization.
C++ Programming: Program Design Including Data Structures, Third Edition Chapter 21: Graphs.
CSE115/ENGR160 Discrete Mathematics 04/03/12 Ming-Hsuan Yang UC Merced 1.
CS 454 Theory of Computation Sonoma State University, Fall 2011 Instructor: B. (Ravi) Ravikumar Office: 116 I Darwin Hall Original slides by Vahid and.
Introduction to Gröbner Bases for Geometric Modeling Geometric & Solid Modeling 1989 Christoph M. Hoffmann.
I. Isomorphisms II. Homomorphisms III. Computing Linear Maps IV. Matrix Operations V. Change of Basis VI. Projection Topics: Line of Best Fit Geometry.
Introduction Polynomials
CSE115/ENGR160 Discrete Mathematics 03/31/11
1 Background Information for the Pumping Lemma for Context-Free Languages Definition: Let G = (V, T, P, S) be a CFL. If every production in P is of the.
Finite fields.
App III. Group Algebra & Reduction of Regular Representations 1. Group Algebra 2. Left Ideals, Projection Operators 3. Idempotents 4. Complete Reduction.
Gröbner Bases Bernd Sturmfels Mathematics and Computer Science University of California at Berkeley.
Chapter 6. Order Relations and Structure
MA5209 Algebraic Topology Wayne Lawton Department of Mathematics National University of Singapore S ,
Rings,Fields TS. Nguyễn Viết Đông Rings, Integral Domains and Fields, 2. Polynomial and Euclidean Rings 3. Quotient Rings 2.
1 Fundamentals of Algebra Real Numbers Polynomials
GROUPS & THEIR REPRESENTATIONS: a card shuffling approach Wayne Lawton Department of Mathematics National University of Singapore S ,
Wei Wang Xi’an Jiaotong University Generalized Spectral Characterization of Graphs: Revisited Shanghai Conference on Algebraic Combinatorics (SCAC), Shanghai,
Induction and recursion
Linear Algebra Chapter 4 Vector Spaces.
By: Hector L Contreras SSGT / USMC
Signed-Bit Representations of Real Numbers and the Constructive Stone-Yosida Theorem Robert S. Lubarsky and Fred Richman Florida Atlantic University.
Mathematics Review Exponents Logarithms Series Modular arithmetic Proofs.
Chapter 8. Section 8. 1 Section Summary Introduction Modeling with Recurrence Relations Fibonacci Numbers The Tower of Hanoi Counting Problems Algorithms.
H.Melikyan/12001 Vectors Dr.Hayk Melikyan Departmen of Mathematics and CS
Linear Programming System of Linear Inequalities  The solution set of LP is described by Ax  b. Gauss showed how to solve a system of linear.
Section 5.3. Section Summary Recursively Defined Functions Recursively Defined Sets and Structures Structural Induction.
The Integers. The Division Algorithms A high-school question: Compute 58/17. We can write 58 as 58 = 3 (17) + 7 This forms illustrates the answer: “3.
Three different ways There are three different ways to show that ρ(A) is a simple eigenvalue of an irreducible nonnegative matrix A:
CS344: Introduction to Artificial Intelligence Lecture: Herbrand’s Theorem Proving satisfiability of logic formulae using semantic trees (from Symbolic.
COMPSCI 102 Introduction to Discrete Mathematics.
Scott CH Huang COM5336 Cryptography Lecture 11 Euclidean Domains & Division Algorithm Scott CH Huang COM 5336 Cryptography Lecture 10.
Chapter 4 Hilbert Space. 4.1 Inner product space.
I.4 Polyhedral Theory 1. Integer Programming  Objective of Study: want to know how to describe the convex hull of the solution set to the IP problem.
ICS 253: Discrete Structures I Induction and Recursion King Fahd University of Petroleum & Minerals Information & Computer Science Department.
Mathematical Preliminaries
Positively Expansive Maps and Resolution of Singularities Wayne Lawton Department of Mathematics National University of Singapore
CS 103 Discrete Structures Lecture 13 Induction and Recursion (1)
Chapter 9. Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations.
Lemma II.1 (Baire) Let X be a complete metric space and a seq. of closed sets. Assume that for each n. Then.
Mathematical Induction Section 5.1. Climbing an Infinite Ladder Suppose we have an infinite ladder: 1.We can reach the first rung of the ladder. 2.If.
COMPSCI 102 Introduction to Discrete Mathematics.
Linear Programming Chap 2. The Geometry of LP  In the text, polyhedron is defined as P = { x  R n : Ax  b }. So some of our earlier results should.
Extending a displacement A displacement defined by a pair where l is the length of the displacement and  the angle between its direction and the x-axix.
INTRODUCTION SC116: Algebraic Structures Short Title of the Course: ALG Instructor: Professor Samaresh Chatterji.
Chapter 4 Introduction to Set Theory
Vector Spaces B.A./B.Sc. III: Mathematics (Paper II) 1 Vectors in Rn
Unit-III Algebraic Structures
B.Sc. III Year Mr. Shrimangale G.W.
Additive Combinatorics and its Applications in Theoretical CS
GROUPS & THEIR REPRESENTATIONS: a card shuffling approach
Polyhedron Here, we derive a representation of polyhedron and see the properties of the generators. We also see how to identify the generators. The results.
Counting I: Bijection and Choice Trees
Polyhedron Here, we derive a representation of polyhedron and see the properties of the generators. We also see how to identify the generators. The results.
I. Finite Field Algebra.
I.4 Polyhedral Theory (NW)
Quantum Foundations Lecture 3
I.4 Polyhedral Theory.
Discrete Mathematics for Computer Science
MA5242 Wavelets Lecture 1 Numbers and Vector Spaces
Presentation transcript:

On the Toric Varieties Associated with Bicolored Metric Trees Khoa Lu Nguyen Joseph Shao Summer REU 2008 at Rutgers University Advisors: Prof. Woodward and Sikimeti Mau

Background in Algebraic Geometry An affine variety is a zero set of some polynomials in C[x 1, …, x n ]. Given an ideal I of C[x 1, …, x n ], denote by V(I) the zero set of the polynomials in I. Then V(I) is an affine variety. Given a variety V in C n, denote I(V) to be the set of polynomials in C[x 1, …, x n ] which vanish in V.

Background in Algebraic Geometry Define the quotient ring C[V] = C[x 1, …, x n ] / I(V) to be the coordinate ring of the variety V. There is a natural bijective map from the set of maximal ideals of C[V] to the points in the variety V.

Background in Algebraic Geometry We can write Spec(C[V]) = V where Spec(C[V]) is the spectrum of the ring C[V], i.e. the set of maximal ideals of C[V].

Background in Algebraic Geometry In C n, we define the Zariski topology as follows: a set is closed if and only if it is an affine variety. Example: In C, the closed set in the Zariski topology is a finite set. Open sets in Zariski topology tend to be “large”.

Constructing Toric Varieties from Cones A convex cone  in R n is defined to be  = { r 1 v 1 + … + r k v k | r i ≥ 0 } where v 1, …, v n are given vectors in R n Denote the standard dot product in R n. Define the dual cone of  to be the set of linear maps from R n to R such that it is nonnegative in the cone .  v = {u  R n | ≥ 0 for all v  σ}

Constructing Toric Varieties from Cones A cone  is rational if its generators v i are in Z n. A cone  is strongly convex if it doesn’t contain a linear subspace. From now on, all the cones  we consider are rational and strongly convex. Denote M = Hom(Z n, Z), i.e. M contains all the linear maps from Z n to Z. View M as a group.

Constructing of Toric Varieties from Cones Gordon’s Lemma:  v  M is a finitely generated semigroup. Denote S  =  v  M. Then C[S  ] is a finitely generated commutative C – algebra. Define U  = Spec(C[S  ]) Then U  is an affine variety.

Constructing Toric Varieties from Cones Example 1 Consider  to be generated by e 2 and 2e 1 - e 2. Then the dual cone  v is generated by e 1 * and e 1 * + 2 e 2 *. However, the semigroup S  =  v  M is generated by e 1 *, e 1 * + e 2 * and e 1 * + 2 e 2 *.

Constructing Toric Varieties from Cones Let x = e 1 *, xy = e 1 * + e 2 *, xy 2 = e 1 * + 2e 2 *. Hence S  = {x a (xy) b (xy 2 ) c = x a+b+c y b+2c | a, b, c  Z  0} Then C[S  ] = C[x, xy, xy 2 ] = C[u, v, w] / (v 2 - uw). Thus U  = { (u,v,w)  C 3 | v 2 – uw = 0 }.

Constructing Toric Varieties from Cones If     R n is a face, we have C[S  ]  C[S  ] and hence obtain a natural gluing map U   U . Thus all the U  fit together in U . Remarks Consider the face  = {0}  . Then U  = (C * ) n = T n here C * = C \ {0}. Thus for every cone   R n, there is an embedding T n  U .

Constructing Toric Varieties from Cones Example 2 If we denote  0,  1,  2 the faces of the cone . Then U  0 = (C * ) 2  { (u,v,w)  (C*) 3 | v 2 – uw = 0 } U  1 = (C * )  C  { (u,v,w)  (C) 3 | v 2 – uw = 0, u  0} U  2 = (C * )  C  { (u,v,w)  (C) 3 | v 2 – uw = 0, w  0}

Action of the Torus From this, we can define the torus T n action on U  as follows: 1. t  T n corresponds to t *  Hom(S {0}, C) 2. x  U  corresponds to x *  Hom(S , C) 3.Thus t *. x *  Hom(S , C) and we denote t. x the corresponding point in S . 4.We have the following group action: T n  U   U  (t, x) |  t. x Torus varieties: contains T n = (C*) n as a dense subset in Zariski topology and has a T n action.

Orbits of the Torus Action The toric variety U  is a disjoint union of the orbits of the torus action T n. Given a face     R n. Denote by N   Z n the lattice generated by . Define the quotient lattice N(  ) = Z n / N  and let O  = T N(  ), the torus of the lattice N(  ). Hence O  = T N(  ) =  (C*) k where k is the codimension of  in R n. There is a natural embedding of O  into an orbit of U . Theorem 1 There is a bijective correspondence between orbits and faces. The toric variety U  is a disjoint union of the orbits O  where  are faces of the cones.

Torus Varieties Associated With Bicolored Metric Trees Bicolored Metric Trees V(T) = { (x 1, x 2, x 3, x 4, x 5, x 6  C 6 | x 1 x 3 = x 2 x 5, x 3 = x 4, x 5 = x 6 }

Torus Varieties Associated With Bicolored Metric Trees Theorem 2 V(T) is an affine toric variety.

Description of the Cones for the Toric Varieties Given a bicolored metric tree T. We can decompose the tree T into the sum of smaller bicolored metric trees T 1, …, T m.

Description of the Cones for the Toric Varieties We give a description of the cone  (T) by induction on the number of nodes n. For n = 1, we have Thus  (T) is generated by e 1 in C. Suppose we constructed the generators for any trees T with the number of nodes less than n. Decompose the trees into smaller trees T 1, …, T m. For each tree T k, denote by G k the constructed set of generators of  (T k )

Description of the Cones for the Toric Varieties Then the set of generators of the cone  (T) is G(T) = {e n +  1 ( z 1 – e n ) + … +  m (z m – e n )| z k  G i,  k  {0,1}} Remarks The cone  (T) is n dimensional, where n is the number of nodes. The elements in G(T) corresponds bijectively to the rays (i.e. the 1- dimensional faces) of the cone  (T)

Description of the Cones for the Toric Varieties Example 3 T = T 1 + T 2 + T 3 G(T 1 ) = {e 1 }, G(T 2 ) = {e 2 }, G(T 3 ) = {e 3 } G(T) = {e 1, e 2, e 3, e 1 + e 2 – e 4, e 1 + e 3 – e 4, e 2 + e 3 – e 4, e 1 + e 2 + e 3 - 2e 4 }

Weil Divisors We can also list all the toric-invariant prime Weil divisors as follows: Let x 1, …, x N be all the variables we label to the edges of T. We call a subset Y = {y 1, …, y m } of {x 1, …, x N } complete if it has the property that x k = 0 if and only if x k  Y when we set y 1 = … = y m = 0. A complete subset Y is called minimally complete if it doesn’t contain any other complete subset.

Weil Divisors A prime Weil divisor D of a variety V is an irreducible subvariety of codimensional 1. A Weil divisor is an integral linear combination of prime Weil divisors. Given a bicolored metric tree T with variety V(T). We care about toric-invariant prime Weil divisors, i.e. T n (D)  D. Theorem 2 D = clos(O  ) for some 1 dimensional face . There is a natural bijective correpondence between the set of prime Weil divisors and the set of generators G(T).

Weil Divisors Lemma 1 Y is a minimally complete subset if and only if the unique path from each colored point to the root contains exactly one edge with labelled variable y k. Theorem 3 D is a toric-invariant prime Weil divisor if and only if D ={ (x 1, …, x N )  V(T) | x k = 0,  x k  Y} for some minimally complete Y. Corollary 1 There is a natural bijective correspondence between the set of toric-invariant prime Weil divisors and the set of minimally complete subsets.

Weil Divisors We can describe the correpondence map D = clos(O  ) and  by induction on the number of nodes n. Example 4 There are 4 prime Weil divisors D 12, D 156, D 234, D 3456 which correspond to the minimal complete sets Y 12, Y 156, Y 234, Y Decompose the tree into two trees T 1 and T 2. Then G(T 1 ) = {e 1 } and G(T 2 ) = {e 2 }. Thus D 12, D 156, D 234, D 3456 correspond to e 3, e 2, e 1, e 1 + e 2 - e 3.

Cartier Divisors Given any irreducible subvariety D of codimension 1 of V and p  D, we can define ord D, p (f) for every function f  C(V). Informally speaking, ord D, p (f), determines the order of vanishing of f at p along D. It turns out that ord D, p doesn’t depend on p  D. For each f, define div(f) =  D (ord D (f)).D If ord D (f) = 0 for every non toric-invariant prime Weil divisor, we call div(f) a toric-invariant Cartier divisors.

Cartier Divisors Theorem 4 div(f) is toric-invariant if and only if f is a fraction of two monomials. Recall that we have constructed a natural correspondence between the prime Weil divisors of V(T) and the elements in G(T). Call D 1, …, D N the prime Weil divisors of V(T) and v 1, …, v N the corresponding elements in G(T). Recall that if the tree T has n nodes, then v 1, …, v N are vectors in Z n.

Cartier Divisors Theorem 5 A Weil divisor D =  a i D i is Cartier if and only if there exists a map   Hom(Z n, Z) such that  (v i ) = a i. Example 5 The prime Weil divisors of T are D 12, D 156, D 234, D 3456 corresponds to e 3, e 2, e 1, e 2 + e 3 - e 1. Hence aD 12 + bD cD dD 3456 is Cartier if and only if a + d = b + c.

Cartier Divisors We can describe the generators of the set of Cartier divisors as follows: 1) Denote the nodes of T to be the point P 1, …, P n. 2) Call Y 1, …, Y N the corresponding minimal complete set of the prime Weil divisors D 1, …, D N. 3) For each node P k, let  k be a map defined on {D 1, …, D N } such that  k (D i ) = 0 if there is no element in Y i in the subtree below P k. Otherwise 1 -  k (D i ) = the number of branches of P k that doesn’t contain an element in Y i.

Cartier Divisors Theorem The set of Cartier divisors is generated by {  k (D 1 ) D 1 + … +  k (D N ) D N | 1  k  m} Example: The generators of the Cartier divisors of T are D 12 - D 3456, D D 3456, D D 3456.

Summary of Results Description of toric-invariant Weil divisors and Cartier divisors of the torus variety associated with a bicolored metric tree.

Reference Griffiths, Ph., Harris, J.: Principles of Algebraic Geometry, Wiley, 1978, NY. Miles, R.: Undergraduate Algebraic Geometry, London Mathematical Society Student Texts. 12, Cambridge University Press Fulton, W.: Introduction to Toric Varieties, Annals of Mathematics Studies 131, Princeton University Press 1993.