Implicitization of surfaces via Geometric Tropicalization Mar´ ıa Ang´ elica Cueto Columbia University ELGA 2011 - Advanced Workshop La Cumbre, C´ ordoba, Argentina August 8th 2011 Three references: Sturmfels, Tevelev, Yu: The Newton polytope of the implicit equation (2007) Sturmfels, Tevelev: Elimination theory for tropical varieties (2008) MAC: arXiv:1105.0509 (2011) (and many, many more!) M.A. Cueto (Columbia Univ.) Tropical Implicitization of surfaces Aug. 8 2011 1 / 12
Implicitization problem: Classical vs. tropical approach Input: Laurent polynomials f 1 , f 2 , . . . , f n ∈ C [ t ± 1 1 , . . . , t ± 1 d ]. Algebraic Output : The prime ideal I defining the Zariski closure Y of the image of the map: f = ( f 1 , . . . , f n ): T d ��� T n The ideal I consists of all polynomial relations among f 1 , f 2 , . . . , f n . Existing methods: Gr¨ obner bases and resultants. GB: always applicable, but often too slow. Resultants: useful when n = d + 1 and I is principal , with limited use. M.A. Cueto (Columbia Univ.) Tropical Implicitization of surfaces Aug. 8 2011 2 / 12
Implicitization problem: Classical vs. tropical approach Input: Laurent polynomials f 1 , f 2 , . . . , f n ∈ C [ t ± 1 1 , . . . , t ± 1 d ]. Algebraic Output : The prime ideal I defining the Zariski closure Y of the image of the map: f = ( f 1 , . . . , f n ): T d ��� T n The ideal I consists of all polynomial relations among f 1 , f 2 , . . . , f n . Existing methods: Gr¨ obner bases and resultants. GB: always applicable, but often too slow. Resultants: useful when n = d + 1 and I is principal , with limited use. Geometric Output : Invariants of Y , such as dimension, degree, etc. M.A. Cueto (Columbia Univ.) Tropical Implicitization of surfaces Aug. 8 2011 2 / 12
Implicitization problem: Classical vs. tropical approach Input: Laurent polynomials f 1 , f 2 , . . . , f n ∈ C [ t ± 1 1 , . . . , t ± 1 d ]. Algebraic Output : The prime ideal I defining the Zariski closure Y of the image of the map: f = ( f 1 , . . . , f n ): T d ��� T n The ideal I consists of all polynomial relations among f 1 , f 2 , . . . , f n . Existing methods: Gr¨ obner bases and resultants. GB: always applicable, but often too slow. Resultants: useful when n = d + 1 and I is principal , with limited use. Geometric Output : Invariants of Y , such as dimension, degree, etc. Punchline: We can effectively compute them using tropical geometry. TODAY: Study the case when d = 2 and Y is a surface . M.A. Cueto (Columbia Univ.) Tropical Implicitization of surfaces Aug. 8 2011 2 / 12
Example: parametric surface in T 3 Input : Three Laurent polynomials in two unknowns: x = f 1 ( s , t ) = 3 + 5 s + 7 t , y = f 2 ( s , t ) = 17 + 13 t + 11 s 2 , z = f 3 ( s , t ) = 19 + 47 st , Output : The Newton polytope of the implicit equation g ( x , y , z ). The Newton polytope of g is the convex hull in R 3 of all lattice points ( i , j , k ) such that x i y j z k appears with nonzero coefficient in g ( x , y , z ). STRATEGY: Recover the Newton polytope of g ( x , y , z ) from the Newton polytopes of the input polynomials f 1 , f 2 , f 3 . M.A. Cueto (Columbia Univ.) Tropical Implicitization of surfaces Aug. 8 2011 3 / 12
x = f 1 ( s , t ) = 3 + 5 s + 7 t , y = f 2 ( s , t ) = 17 + 13 t + 11 s 2 , � Newton polytope of g ( x , y , z ). Y = z = f 3 ( s , t ) = 19 + 47 st , M.A. Cueto (Columbia Univ.) Tropical Implicitization of surfaces Aug. 8 2011 4 / 12
x = f 1 ( s , t ) = 3 + 5 s + 7 t , y = f 2 ( s , t ) = 17 + 13 t + 11 s 2 , � Newton polytope of g ( x , y , z ). Y = z = f 3 ( s , t ) = 19 + 47 st , ρ 1 t st 2 P 1 P 3 ρ 2 1 ρ 6 s 1 t P 2 ρ 3 ρ 5 1 2 s 2 ρ 4 M.A. Cueto (Columbia Univ.) Tropical Implicitization of surfaces Aug. 8 2011 4 / 12
x = f 1 ( s , t ) = 3 + 5 s + 7 t , y = f 2 ( s , t ) = 17 + 13 t + 11 s 2 , � Newton polytope of g ( x , y , z ). Y = z = f 3 ( s , t ) = 19 + 47 st , ρ 1 t st 2 P 1 P 3 ρ 2 1 ρ 6 s 1 t P 2 ρ 3 ρ 5 1 2 s 2 ρ 4 M.A. Cueto (Columbia Univ.) Tropical Implicitization of surfaces Aug. 8 2011 4 / 12
x = f 1 ( s , t ) = 3 + 5 s + 7 t , y = f 2 ( s , t ) = 17 + 13 t + 11 s 2 , � Newton polytope of g ( x , y , z ). Y = z = f 3 ( s , t ) = 19 + 47 st , ρ 1 t st 2 P 1 P 3 ρ 2 1 ρ 6 s 1 t P 2 ρ 3 ρ 5 1 2 s 2 z 2 ρ 4 e 3 Γ � y 2 2 3 1 f -vector= (5, 8, 5) 2 e 1 e 2 2 ( − 1 , − 2 − 2) ( − 2 , − 2 − 3) x 2 y x 3 M.A. Cueto (Columbia Univ.) Tropical Implicitization of surfaces Aug. 8 2011 4 / 12
x = f 1 ( s , t ) = 3 + 5 s + 7 t , y = f 2 ( s , t ) = 17 + 13 t + 11 s 2 , � Newton polytope of g ( x , y , z ). Y = z = f 3 ( s , t ) = 19 + 47 st , ρ 1 t st 2 P 1 P 3 ρ 2 1 ρ 6 s 1 t P 2 ρ 3 ρ 5 1 2 s 2 z 2 ρ 4 e 3 Γ � y 2 2 3 1 f -vector= (5, 8, 5) 2 e 1 e 2 2 ( − 1 , − 2 − 2) ( − 2 , − 2 − 3) x 2 y x 3 • Γ is a balanced weighted planar graph in R 3 . It is the tropical variety T ( g ( x , y , z )), dual to the Newton polytope of g . • We can recover g ( x , y , z ) from Γ using numerical linear algebra . M.A. Cueto (Columbia Univ.) Tropical Implicitization of surfaces Aug. 8 2011 4 / 12
What is Tropical Geometry? Given a variety X ⊂ T n with defining ideal I ⊂ C [ x ± 1 1 , . . . , x ± 1 n ], the tropicalization of X equals: T X = T I := { w ∈ R n | in w ( I ) contains no monomial } . M.A. Cueto (Columbia Univ.) Tropical Implicitization of surfaces Aug. 8 2011 5 / 12
What is Tropical Geometry? Given a variety X ⊂ T n with defining ideal I ⊂ C [ x ± 1 1 , . . . , x ± 1 n ], the tropicalization of X equals: T X = T I := { w ∈ R n | in w ( I ) contains no monomial } . 1 It is a rational polyhedral fan in R n � T X ∩ S n − 1 is a spherical polyhedral complex. 2 If I is prime, then T X is pure of the same dimension as X . 3 Maximal cones have canonical multiplicities attached to them. With these multiplicities, T X satisfies the balancing condition. Example (hypersurfaces): T ( g ) is the union of all codim. 1 cones in the (inner) normal fan of the Newton polytope NP ( g ). Maximal cones in T ( g ) are dual to edges in NP ( g ), and m σ is the lattice length of the associated edge. Multiplicities are essential to recover NP ( g ) from T ( g ). M.A. Cueto (Columbia Univ.) Tropical Implicitization of surfaces Aug. 8 2011 5 / 12
What is Geometric Tropicalization? AIM: Given Z ⊂ T N a surface , compute T Z from the geometry of Z . KEY FACT: T Z can be characterized in terms of divisorial valuations. M.A. Cueto (Columbia Univ.) Tropical Implicitization of surfaces Aug. 8 2011 6 / 12
What is Geometric Tropicalization? AIM: Given Z ⊂ T N a surface , compute T Z from the geometry of Z . KEY FACT: T Z can be characterized in terms of divisorial valuations. Theorem (Geometric Tropicalization [Hacking - Keel - Tevelev]) Consider T N with coordinate functions χ 1 , . . . , χ N , and let Z ⊂ T N be a closed smooth surface . Suppose Z ⊃ Z is any smooth compactification, whose boundary divisor has m irreducible components D 1 , . . . , D m with no triple intersections ( C.N.C. ). Let ∆ be the graph: V (∆) = { 1 , . . . , m } ; ( i , j ) ∈ E (∆) ⇐ ⇒ D i ∩ D j � = ∅ . Realize ∆ as a graph Γ ⊂ R N by [ D k ]:=( val D k ( χ 1 ) , . . . , val D k ( χ N )) ∈ Z N . Then, T Z is the cone over the graph Γ . M.A. Cueto (Columbia Univ.) Tropical Implicitization of surfaces Aug. 8 2011 6 / 12
What is Geometric Tropicalization? AIM: Given Z ⊂ T N a surface , compute T Z from the geometry of Z . KEY FACT: T Z can be characterized in terms of divisorial valuations. Theorem (Geometric Tropicalization [Hacking - Keel - Tevelev]) Consider T N with coordinate functions χ 1 , . . . , χ N , and let Z ⊂ T N be a closed smooth surface . Suppose Z ⊃ Z is any smooth compactification, whose boundary divisor has m irreducible components D 1 , . . . , D m with no triple intersections ( C.N.C. ). Let ∆ be the graph: V (∆) = { 1 , . . . , m } ; ( i , j ) ∈ E (∆) ⇐ ⇒ D i ∩ D j � = ∅ . Realize ∆ as a graph Γ ⊂ R N by [ D k ]:=( val D k ( χ 1 ) , . . . , val D k ( χ N )) ∈ Z N . Then, T Z is the cone over the graph Γ . Theorem (Combinatorial formula for multiplicities [C.]) � � ( Z � [ D i ] , [ D j ] � ) sat : Z � [ D i ] , [ D j ] � m ([ D i ] , [ D j ]) = ( D i · D j ) M.A. Cueto (Columbia Univ.) Tropical Implicitization of surfaces Aug. 8 2011 6 / 12
QUESTION: How to compute T Y from a parameterization f = ( f 1 , . . . , f n ): T 2 ��� Y ⊂ T n ? M.A. Cueto (Columbia Univ.) Tropical Implicitization of surfaces Aug. 8 2011 7 / 12
QUESTION: How to compute T Y from a parameterization f = ( f 1 , . . . , f n ): T 2 ��� Y ⊂ T n ? ANSWER: Compactify the domain X = T 2 � � n i =1 ( f i = 0) and use the map f to translate back to Y . Proposition Given f : X ⊂ T 2 → Y ⊂ T n generically finite map of degree δ , let X be a smooth, CNC compactification with associated intersection complex ∆ . Map each vertex D k of ∆ in Z n to a vertex � D k of Γ ⊂ R n , where [ � D k ] = val D k ( χ ◦ f ) = f # ([ D k ]) . Then, T Y is the cone over the graph Γ ⊂ R n , with multiplicities � � D j ]) = 1 D j ]) � sat : Z � [ � ( Z � [ � D i ] , [ � D i ] , [ � m ([ f δ ( D i · D j ) D j ] � . D i ] , [ f M.A. Cueto (Columbia Univ.) Tropical Implicitization of surfaces Aug. 8 2011 7 / 12
Recommend
More recommend
