Finding All Real Points of a Complex Algebraic Curve

Similar documents
Mechanism and Robot Kinematics, Part II: Numerical Algebraic Geometry

Mechanism and Robot Kinematics, Part I: Algebraic Foundations

f xx (x, y) = 6 + 6x f xy (x, y) = 0 f yy (x, y) = y In general, the quantity that we re interested in is

Cell decomposition of almost smooth real algebraic surfaces

3. The three points (2, 4, 1), (1, 2, 2) and (5, 2, 2) determine a plane. Which of the following points is in that plane?

Chapter 3. Quadric hypersurfaces. 3.1 Quadric hypersurfaces Denition.

Multiple View Geometry in Computer Vision

Conic Sections. College Algebra

Gift Wrapping for Pretropisms

The Convex Hull of a Space Curve. Bernd Sturmfels, UC Berkeley (two papers with Kristian Ranestad)

= f (a, b) + (hf x + kf y ) (a,b) +

Each point P in the xy-plane corresponds to an ordered pair (x, y) of real numbers called the coordinates of P.

Section 4.2 selected answers Math 131 Multivariate Calculus D Joyce, Spring 2014

Sung-Eui Yoon ( 윤성의 )

Describing algebraic varieties to a computer

Dubna 2018: lines on cubic surfaces

The Convex Hull of a Space Curve

MAT203 OVERVIEW OF CONTENTS AND SAMPLE PROBLEMS

The end of affine cameras

Assignment 4: Mesh Parametrization

Math 814 HW 2. September 29, p. 43: 1,4,6,13,15, p. 54 1, 3 (cos z only). u(x, y) = x 3 3xy 2, u(x, y) = x/(x 2 + y 2 ),

Hw 4 Due Feb 22. D(fg) x y z (

21-256: Lagrange multipliers

Curve and Surface Basics

Algebraic Geometry of Segmentation and Tracking

KEMATH1 Calculus for Chemistry and Biochemistry Students. Francis Joseph H. Campeña, De La Salle University Manila

Implicit Matrix Representations of Rational Bézier Curves and Surfaces

The point (x, y) lies on the circle of radius r and center (h, k) iff. x h y k r

The x coordinate tells you how far left or right from center the point is. The y coordinate tells you how far up or down from center the point is.

Chapter 6. Curves and Surfaces. 6.1 Graphs as Surfaces

Multiple View Geometry in Computer Vision

Unit 12 Topics in Analytic Geometry - Classwork

CS3621 Midterm Solution (Fall 2005) 150 points

CONNECTED SPACES AND HOW TO USE THEM

Lecture 25: Bezier Subdivision. And he took unto him all these, and divided them in the midst, and laid each piece one against another: Genesis 15:10

Spline Curves. Spline Curves. Prof. Dr. Hans Hagen Algorithmic Geometry WS 2013/2014 1

4 = 1 which is an ellipse of major axis 2 and minor axis 2. Try the plane z = y2

Multivariable Calculus

Cremona transformations

A1:Orthogonal Coordinate Systems

Curves and Surfaces 1

Chapter 3 Numerical Methods

Math 414 Lecture 2 Everyone have a laptop?

Chapter 11. Parametric Equations And Polar Coordinates

Until now we have worked with flat entities such as lines and flat polygons. Fit well with graphics hardware Mathematically simple

Math 213 Exam 2. Each question is followed by a space to write your answer. Please write your answer neatly in the space provided.

An introduction to Finite Geometry

(Refer Slide Time: 00:02:24 min)

Programming, numerics and optimization

FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 14

Software for numerical algebraic geometry: a paradigm and progress towards its implementation

CGT 581 G Geometric Modeling Curves

Chapter 8: Applications of Definite Integrals

Measuring Lengths The First Fundamental Form

An experienced mathematics teacher guides students through the use of a number of very important skills in coordinate geometry.

Week 5: Geometry and Applications

Solution 2. ((3)(1) (2)(1), (4 3), (4)(2) (3)(3)) = (1, 1, 1) D u (f) = (6x + 2yz, 2y + 2xz, 2xy) (0,1,1) = = 4 14

LECTURE 13, THURSDAY APRIL 1, 2004

MH2800/MAS183 - Linear Algebra and Multivariable Calculus

Worksheet 2.7: Critical Points, Local Extrema, and the Second Derivative Test

ED degree of smooth projective varieties

Reliable Location with Respect to the Projection of a Smooth Space Curve

Chapter 15: Functions of Several Variables

Honors Precalculus: Solving equations and inequalities graphically and algebraically. Page 1

4.2 and 4.6 filled in notes.notebook. December 08, Integration. Copyright Cengage Learning. All rights reserved.

Some algebraic geometry problems arising in the field of mechanism theory. J-P. Merlet INRIA, BP Sophia Antipolis Cedex France

A Numerical Method for Computing Border Curves of Bi-parametric Real Polynomial Systems and Applications

Mirror Symmetry Through Reflexive Polytopes

Inverse and Implicit functions

9.1 Parametric Curves

1 Solution of Homework

Jorg s Graphics Lecture Notes Coordinate Spaces 1

9. Three Dimensional Object Representations

Using Monodromy to Avoid High Precision

FORMULAS to UNDERSTAND & MEMORIZE

Madison County Schools Suggested Geometry Pacing Guide,

Central issues in modelling

The basics of rigidity

Solving Polynomial Systems with PHCpack and phcpy

Reminder: Lecture 20: The Eight-Point Algorithm. Essential/Fundamental Matrix. E/F Matrix Summary. Computing F. Computing F from Point Matches

MATH 2400: CALCULUS 3 MAY 9, 2007 FINAL EXAM

1 (5 max) 2 (10 max) 3 (20 max) 4 (30 max) 5 (10 max) 6 (15 extra max) total (75 max + 15 extra)

Curves and Surfaces Computer Graphics I Lecture 9

Prime Time (Factors and Multiples)

A graph is finite if its vertex set and edge set are finite. We call a graph with just one vertex trivial and all other graphs nontrivial.

Parametric curves. Brian Curless CSE 457 Spring 2016

Know it. Control points. B Spline surfaces. Implicit surfaces

(Creating Arrays & Matrices) Applied Linear Algebra in Geoscience Using MATLAB

Lecture 0: Reivew of some basic material

Parameterization. Michael S. Floater. November 10, 2011

3.3 Optimizing Functions of Several Variables 3.4 Lagrange Multipliers

Part I. Problems in this section are mostly short answer and multiple choice. Little partial credit will be given. 5 points each.

10.3 Probability Using Areas

GEOMETRY OF CURVES CHAPMAN & HALL/CRC. Boca Raton London New York Washington, D.C.

Search and Intersection. O Rourke, Chapter 7 de Berg et al., Chapter 11

Singularity Loci of Planar Parallel Manipulators with Revolute Joints

ME 115(b): Final Exam, Spring

Introduction to Computer Graphics

Digital Geometry Processing Parameterization I

Mathematically, the path or the trajectory of a particle moving in space in described by a function of time.

Transcription:

Finding All Real Points of a Complex Algebraic Curve Charles Wampler General Motors R&D Center In collaboration with Ye Lu (MIT), Daniel Bates (IMA), & Andrew Sommese (University of Notre Dame)

Outline Real points in a curve Relationship between a complex curve and its real points Morse-like representation for real curves Numerical algorithm Find isolated real points Find boundary points, B, of real curve arcs Find arcs and how they connect to B Find how components meet each other Examples A Griffis-Duffy platform with a curious real motion 2

Real Solutions & Complex Dimension At complex dimension 0, a point is either real or not Just check the imaginary part A complex curve may contain Real arcs y Isolated real points Example: [x(x-1)(x-2)] 2 +[y(y-1)y-2)] 2 =0 x 9 isolated points in one complex curve Example: an isolated and a 1-dim real pieces in the same complex curve y 2 -x 2 (x-1)=0 Real dimension = complex dimension 3

Conjugation Let κ : C C be the conjugation operation x is real iff κ(x)=x Complex conjugation conj(a+bi)=a-bi Real part of V(xy-1) is a unit hyperbola Other conjugation operations Hermitian transpose of a square matrix, A* κ(x,y)=(conj(y),conj(x)) real part of V(xy-1) consists of pairs of complex conjugate points on the unit circle in C 1 Algorithms require only minor adjustments for different conjugation operators i.e., sweep with a real hyperplane y x y C 1 x 4

Conjugate components Let f(x) be polynomial system with real coefficients If f(z)=0, then f(κ(z))=0 Suppose f -1 (0) has several 1-dimensional irreducible components The components must either: Be self-conjugate, κ(z)=z, or Appear in conjugate pairs, κ(z)=z? Z 5

Real points of conjugate pairs If κ(z)=z? Z, the real points of Z and Z must be their intersection Z Z These points must be isolated We can numerically intersect any two algebraic sets Use a diagonal homotopy This is all we need to handle conjugate pairs. Self-conjugate components are another matter 6

Local smoothness Let Z be Quasiprojective complex algebraic set Reduced Dimension 1 Let sing(z) be its singular points Let reg(z)=z\sing(z) Suppose z reg(z) is real, Then there is an open complex neighborhood of z such that the real points of Z in the neighborhood form a smooth connected curve. Upshot: real points = real smooth arcs + R N (sing(z)) 7

Sweeping out the curve Pick a general real projection π V(π(x)-t) as t varies along R is a sweep hyperplane For general t, V(π(x)-t) Z consists of isolated regular points Witness set of size d=deg Z On an open real interval of t, we can numerically sweep out arcs Sweep fails where: Tangent to curve lies inside the sweep plane Jacobian matrix at point on curve is corank = 2 8

Morse-like representation Let B* be the real points where the sweep will fail Note: sing(z) B* Let B = π Ζ 1 (π(b*)) R N Morse-like representation of Z consists of The generic real linear projection π The boundary points B={B 1,,B n }, The edges E={e 1,,e k }, where each edge is {x,l,r}: x is a point on an arc of Z R N (l,r) are pointers to B: B l is left endpoint of the arc or l=-8 B r is right endpoint of the arc or r=+8 9

Algorithm for self-conjugate curves 1. Define π 2. Find B* 3. Slice between B* 4. Track to find endpoints and extend B* to B Key: = B* = edge point 10

Full algorithm in outline For polynomial system f(x) 1. Find the 1-dimensional components Numerical irreducible decomposition Deflate any nonreduced components 2. Test to find each component s conjugate 3. Intersect conjugate pairs Use diagonal intersection Result is isolated real points 4. Compute the Morse-like representation for the real part of each self-conjugate component Result is boundary points B and edges E Some boundary points B* may be isolated 5. (Optional) Find where components not related by conjugation meet Let s look at some steps in more detail 11

Determining conjugate pairs Numerical irreducible decomposition gives us witness sets for the components Let Z,Z be components Move the slicing plane (for all components) to the same generic real plane Let W Z, W Z be the witness sets for Z,Z Considering all 1-dim components of f -1 (0), witness points must appear in conjugate pairs We have κ(z)=z iff κ(w Z )=W Z With probability 1 This identifies self-conjugacy too 12

Determining B* Let s consider a reduced component, Z Nonreduced introduces technicalities Easy and not so interesting Let a be the sweep direction: π(x)=a T x Find B, a basis for the sweep tangents [a B] is full rank, B T a=0 Let J(x) be the Jacobian matrix of f(x) Define h(x,y)=j(x)b y y parameterizes the tangent space of the sweep Define π x and π y, natural projections B* = π x ((Z P N-2 ) V(h)) B* are isolated ((Z P N-2 ) V(h)) can be any dimension 0,,N-2 Find by a witness cascade 13

Extra points in B* Suppose f(x):c N C m has m=n-1 equations For a 1-dim l component Z square up f(x) as g(x)=qf(x), Q is (N-1) m This can introduce an extraneous component, Z Z,Z V(g) We may get extra points Z Z in B* Not a problem, just makes extra edges Deflation of nonreduced components can similarly add extra points to B* 14

Examples Three easy One substantial A foldable Griffis-Duffy platform 15

Example 1 Suppose f(x)=x 2 +y 2 V(f) is two lines (x,y) = (u,ui) and (x,y)=(u,-ui), u C These are a conjugate pair The lines intersect in the real point (0,0) 16

Example 2 f ( x, y) x( y 1) ( y 1) = 2 (0,1) is an embedded point in V(y-1) 17

Example 3 f ( x, y) 2 2 = y x ( x 1)( x 2) A single irreducible self-conjugate complex curve Double point in B* 18

Example 4: Foldable Griffis-Duffy Griffis-Duffy platform with Equal triangles Joints at midpoints of sides Leg lengths all equal to altitude of the triangles Deg 28 irreducible motion in Study Coords (legs not equal) What about this one? 19

Foldable Platform: Step 1 Numerical Irreducible Decomposition gives 1 double quadric surface Nonphysical, throw away 12 nonphysical lines (throw these away) 3 double lines (deflate these) 3 quadric curves Find real points 4 quartic curves Remark: 2x3+3x2+4x4=28 20

Foldable platform (cont) All 10 components are self-conjugate Each of the 3 lines are completely determined by their witness point and the tangent at it. Do nothing more to these Run the algorithm on the other 7 pieces 3 real points show up in the B* set for several components Each quadric passes through 2 of these Three quartics have: no real B* no real points on a random real slice hence no real points. The other quartic has a double point in its B* set 21

The special B* points An example of how a numerical result can lead one to see an exact result (The numerics were done to 12 digits. Only 4 are shown.) 22

A projection of the real curves Curves live in P 7. Project onto a C 7 patch, then project down to C 2. Key: + = B* = B\B* = edge point 23

Foldable Griffis-Duffy views 24

More views 25

And finally 26

Summary We have described a method to find the real points in a complex curve Uses the following operations of numerical algebraic geometry Irreducible decomposition Deflation Intersection of components Tracking on a component The foldable Griffis-Duffy is fully analyzed 1 quartic, 3 quadrics, 3 double lines All connect via 4 singularities 27