Building polygons from spectral data - Bucknell University · Building polygons from spectral data...

29
Motivation The Problem Some Solutions Implications Building polygons from spectral data Emily B. Dryden Bucknell University MAA Special Session on Decoding Geometry January 5, 2012 Joint work with Victor Guillemin and Rosa Sena-Dias Emily B. Dryden Building polygons from spectral data

Transcript of Building polygons from spectral data - Bucknell University · Building polygons from spectral data...

Page 1: Building polygons from spectral data - Bucknell University · Building polygons from spectral data Emily B. Dryden Bucknell University MAA Special Session on Decoding Geometry January

MotivationThe Problem

Some SolutionsImplications

Building polygons from spectral data

Emily B. Dryden

Bucknell University

MAA Special Session on Decoding GeometryJanuary 5, 2012

Joint work with Victor Guillemin and Rosa Sena-Dias

Emily B. Dryden Building polygons from spectral data

Page 2: Building polygons from spectral data - Bucknell University · Building polygons from spectral data Emily B. Dryden Bucknell University MAA Special Session on Decoding Geometry January

MotivationThe Problem

Some SolutionsImplications

Outline

1 Motivation

2 The Problem

3 Some Solutions

4 Implications

Emily B. Dryden Building polygons from spectral data

Page 3: Building polygons from spectral data - Bucknell University · Building polygons from spectral data Emily B. Dryden Bucknell University MAA Special Session on Decoding Geometry January

MotivationThe Problem

Some SolutionsImplications

Vibrating Drumheads

D = compact domain in Euclidean plane

D������������

������������

x

z

y

Vibration frequencies ↔ Eigenvalues of ∆ on DHow much geometry is encoded in the spectrum?

Emily B. Dryden Building polygons from spectral data

Page 4: Building polygons from spectral data - Bucknell University · Building polygons from spectral data Emily B. Dryden Bucknell University MAA Special Session on Decoding Geometry January

MotivationThe Problem

Some SolutionsImplications

Listening to Polytopes

Abreu: Can one hear the shape of a Delzant polytope?

A convex polytope P in Rn is Delzant ifit is simple, i.e., there are n facets meeting at each vertex;it is rational, i.e., for every facet of P, a primitive outwardnormal can be chosen in Zn;it is smooth, i.e., for every vertex of P, the outward normalscorresponding to the facets meeting at that vertex form abasis for Zn.

Emily B. Dryden Building polygons from spectral data

Page 5: Building polygons from spectral data - Bucknell University · Building polygons from spectral data Emily B. Dryden Bucknell University MAA Special Session on Decoding Geometry January

MotivationThe Problem

Some SolutionsImplications

Listening to Polytopes

Abreu: Can one hear the shape of a Delzant polytope?

A convex polytope P in Rn is Delzant ifit is simple, i.e., there are n facets meeting at each vertex;it is rational, i.e., for every facet of P, a primitive outwardnormal can be chosen in Zn;it is smooth, i.e., for every vertex of P, the outward normalscorresponding to the facets meeting at that vertex form abasis for Zn.

Emily B. Dryden Building polygons from spectral data

Page 6: Building polygons from spectral data - Bucknell University · Building polygons from spectral data Emily B. Dryden Bucknell University MAA Special Session on Decoding Geometry January

MotivationThe Problem

Some SolutionsImplications

Examples and Non-examples

@@@@@

(0,0)

(0,1)

(1,0)

HHHH

HHHHH

(0,0)

(0,1)

(2,0)

Emily B. Dryden Building polygons from spectral data

Page 7: Building polygons from spectral data - Bucknell University · Building polygons from spectral data Emily B. Dryden Bucknell University MAA Special Session on Decoding Geometry January

MotivationThe Problem

Some SolutionsImplications

So What?

Symplectic geometers care about Delzant polytopes because...

M2n is toric manifold, i.e., symplectic manifold with“compatible” Tn-actiong, toric Kähler metric on MDelzant/moment polytope associated to M

Abreu’s question: Let M be a toric manifold equipped with atoric Kähler metric g. Does the spectrum of the Laplacian ∆gdetermine the moment polytope of M?

Emily B. Dryden Building polygons from spectral data

Page 8: Building polygons from spectral data - Bucknell University · Building polygons from spectral data Emily B. Dryden Bucknell University MAA Special Session on Decoding Geometry January

MotivationThe Problem

Some SolutionsImplications

So What?

Symplectic geometers care about Delzant polytopes because...

M2n is toric manifold, i.e., symplectic manifold with“compatible” Tn-actiong, toric Kähler metric on MDelzant/moment polytope associated to M

Abreu’s question: Let M be a toric manifold equipped with atoric Kähler metric g. Does the spectrum of the Laplacian ∆gdetermine the moment polytope of M?

Emily B. Dryden Building polygons from spectral data

Page 9: Building polygons from spectral data - Bucknell University · Building polygons from spectral data Emily B. Dryden Bucknell University MAA Special Session on Decoding Geometry January

MotivationThe Problem

Some SolutionsImplications

So What?

Symplectic geometers care about Delzant polytopes because...

M2n is toric manifold, i.e., symplectic manifold with“compatible” Tn-actiong, toric Kähler metric on MDelzant/moment polytope associated to M

Abreu’s question: Let M be a toric manifold equipped with atoric Kähler metric g. Does the spectrum of the Laplacian ∆gdetermine the moment polytope of M?

Emily B. Dryden Building polygons from spectral data

Page 10: Building polygons from spectral data - Bucknell University · Building polygons from spectral data Emily B. Dryden Bucknell University MAA Special Session on Decoding Geometry January

MotivationThe Problem

Some SolutionsImplications

Modifying Abreu’s Question: Step 1

A convex polytope P in Rn is rational simple if it is simple, it isrational, and for every vertex of P, the outward normalscorresponding to the facets meeting at that vertex form a basisfor Qn.

HHHHH

HHHH(0,0)

(0,1)

(2,0)

Emily B. Dryden Building polygons from spectral data

Page 11: Building polygons from spectral data - Bucknell University · Building polygons from spectral data Emily B. Dryden Bucknell University MAA Special Session on Decoding Geometry January

MotivationThe Problem

Some SolutionsImplications

Modifying Abreu’s Question: Step 1

A convex polytope P in Rn is rational simple if it is simple, it isrational, and for every vertex of P, the outward normalscorresponding to the facets meeting at that vertex form a basisfor Qn.

HHHHH

HHHH(0,0)

(0,1)

(2,0)

Emily B. Dryden Building polygons from spectral data

Page 12: Building polygons from spectral data - Bucknell University · Building polygons from spectral data Emily B. Dryden Bucknell University MAA Special Session on Decoding Geometry January

MotivationThe Problem

Some SolutionsImplications

Modifying Abreu’s Question: Step 2

Equivariant spectrum = Laplace spectrum+ weights for each eigenvalue

QuestionLet M be a toric orbifold equipped with a toric Kähler metric g.Does the equivariant spectrum of the Laplacian ∆g determinethe labeled moment polytope of M?

Emily B. Dryden Building polygons from spectral data

Page 13: Building polygons from spectral data - Bucknell University · Building polygons from spectral data Emily B. Dryden Bucknell University MAA Special Session on Decoding Geometry January

MotivationThe Problem

Some SolutionsImplications

Modifying Abreu’s Question: Step 2

Equivariant spectrum = Laplace spectrum+ weights for each eigenvalue

QuestionLet M be a toric orbifold equipped with a toric Kähler metric g.Does the equivariant spectrum of the Laplacian ∆g determinethe labeled moment polytope of M?

Emily B. Dryden Building polygons from spectral data

Page 14: Building polygons from spectral data - Bucknell University · Building polygons from spectral data Emily B. Dryden Bucknell University MAA Special Session on Decoding Geometry January

MotivationThe Problem

Some SolutionsImplications

What We Hear

The equivariant spectrum associated to a toric orbifold Mwhose moment polytope has no parallel facets determines:

1 the (unsigned) normal directions to the facets;2 the volumes of the corresponding facets;3 the labels of the facets.

Given this data, how many labeled moment polytopes can youbuild?

Emily B. Dryden Building polygons from spectral data

Page 15: Building polygons from spectral data - Bucknell University · Building polygons from spectral data Emily B. Dryden Bucknell University MAA Special Session on Decoding Geometry January

MotivationThe Problem

Some SolutionsImplications

What We Hear

The equivariant spectrum associated to a toric orbifold Mwhose moment polytope has no parallel facets determines:

1 the (unsigned) normal directions to the facets;2 the volumes of the corresponding facets;3 the labels of the facets.

Given this data, how many labeled moment polytopes can youbuild?

Emily B. Dryden Building polygons from spectral data

Page 16: Building polygons from spectral data - Bucknell University · Building polygons from spectral data Emily B. Dryden Bucknell University MAA Special Session on Decoding Geometry January

MotivationThe Problem

Some SolutionsImplications

Building Polygons

@@@@@@

���

�����

�����

���

�����

�����

@@@@@@

Emily B. Dryden Building polygons from spectral data

Page 17: Building polygons from spectral data - Bucknell University · Building polygons from spectral data Emily B. Dryden Bucknell University MAA Special Session on Decoding Geometry January

MotivationThe Problem

Some SolutionsImplications

Minkowski’s Theorem

Theorem(Minkowski; Klain) Given a list{(ui , νi),ui ∈ Rn, νi ∈ R+, i = 1, . . . ,d} where the ui are unitvectors that span Rn, there exists a convex polytope P withfacet normals u1, . . . ,ud and corresponding facet volumesν1, . . . , νd if and only if

d∑i=1

νiui = 0.

Moreover, this polytope is unique up to translation.

Emily B. Dryden Building polygons from spectral data

Page 18: Building polygons from spectral data - Bucknell University · Building polygons from spectral data Emily B. Dryden Bucknell University MAA Special Session on Decoding Geometry January

MotivationThe Problem

Some SolutionsImplications

Troublemaker 1: subpolytopes

@@@@

��

������

��

������

@@@@

LemmaLet P be a convex polytope in Rn with no subpolytopes andfacet volumes ν1, . . . , νd . Assume that the facet normals to Pare u1, . . . ,ud up to sign. Then, up to translation, there are only2 choices for the set of signed normals.

Emily B. Dryden Building polygons from spectral data

Page 19: Building polygons from spectral data - Bucknell University · Building polygons from spectral data Emily B. Dryden Bucknell University MAA Special Session on Decoding Geometry January

MotivationThe Problem

Some SolutionsImplications

Troublemaker 1: subpolytopes

@@@@

��

������

��

������

@@@@

LemmaLet P be a convex polytope in Rn with no subpolytopes andfacet volumes ν1, . . . , νd . Assume that the facet normals to Pare u1, . . . ,ud up to sign. Then, up to translation, there are only2 choices for the set of signed normals.

Emily B. Dryden Building polygons from spectral data

Page 20: Building polygons from spectral data - Bucknell University · Building polygons from spectral data Emily B. Dryden Bucknell University MAA Special Session on Decoding Geometry January

MotivationThe Problem

Some SolutionsImplications

Troublemaker 2: parallel facets

Parallel facets introduce indeterminants:know sum of volumes of facets in parallel pairdo not know which normal directions in list are repeated

Emily B. Dryden Building polygons from spectral data

Page 21: Building polygons from spectral data - Bucknell University · Building polygons from spectral data Emily B. Dryden Bucknell University MAA Special Session on Decoding Geometry January

MotivationThe Problem

Some SolutionsImplications

Bye-bye, troublemaking polytopes

LemmaClose to any rational simple polytope in Rn, there is a rationalsimple polytope that has no parallel facets and has nosubpolytopes.

Orbifolds are better than manifolds!

Emily B. Dryden Building polygons from spectral data

Page 22: Building polygons from spectral data - Bucknell University · Building polygons from spectral data Emily B. Dryden Bucknell University MAA Special Session on Decoding Geometry January

MotivationThe Problem

Some SolutionsImplications

Bye-bye, troublemaking polytopes

LemmaClose to any rational simple polytope in Rn, there is a rationalsimple polytope that has no parallel facets and has nosubpolytopes.

Orbifolds are better than manifolds!

Emily B. Dryden Building polygons from spectral data

Page 23: Building polygons from spectral data - Bucknell University · Building polygons from spectral data Emily B. Dryden Bucknell University MAA Special Session on Decoding Geometry January

MotivationThe Problem

Some SolutionsImplications

The Answer

QuestionLet M be a toric orbifold equipped with a toric Kähler metric g.Does the equivariant spectrum of the Laplacian ∆g determinethe labeled moment polytope of M?

Theorem(D–V. Guillemin–R. Sena-Dias) Let M be a generic toric orbifoldwith a fixed torus action and a toric Kähler metric. Then theequivariant spectrum of M determines the labeled momentpolytope P of M, up to two choices and up to translation.

Emily B. Dryden Building polygons from spectral data

Page 24: Building polygons from spectral data - Bucknell University · Building polygons from spectral data Emily B. Dryden Bucknell University MAA Special Session on Decoding Geometry January

MotivationThe Problem

Some SolutionsImplications

The Answer

QuestionLet M be a toric orbifold equipped with a toric Kähler metric g.Does the equivariant spectrum of the Laplacian ∆g determinethe labeled moment polytope of M?

Theorem(D–V. Guillemin–R. Sena-Dias) Let M be a generic toric orbifoldwith a fixed torus action and a toric Kähler metric. Then theequivariant spectrum of M determines the labeled momentpolytope P of M, up to two choices and up to translation.

Emily B. Dryden Building polygons from spectral data

Page 25: Building polygons from spectral data - Bucknell University · Building polygons from spectral data Emily B. Dryden Bucknell University MAA Special Session on Decoding Geometry January

MotivationThe Problem

Some SolutionsImplications

Abreu’s original question

QuestionCan one hear the shape of a Delzant polytope?

Theorem (D–V. Guillemin–R. Sena-Dias)

Let M4 be a toric symplectic manifold with a fixed torus actionand a toric metric. Given the equivariant spectrum of M and thespectrum of the associated real manifold, we can reconstructthe moment polygon P of M up to two choices and up totranslation for generic polygons with no more than 2 pairs ofparallel sides.

Emily B. Dryden Building polygons from spectral data

Page 26: Building polygons from spectral data - Bucknell University · Building polygons from spectral data Emily B. Dryden Bucknell University MAA Special Session on Decoding Geometry January

MotivationThe Problem

Some SolutionsImplications

Abreu’s original question

QuestionCan one hear the shape of a Delzant polytope?

Theorem (D–V. Guillemin–R. Sena-Dias)

Let M4 be a toric symplectic manifold with a fixed torus actionand a toric metric. Given the equivariant spectrum of M and thespectrum of the associated real manifold, we can reconstructthe moment polygon P of M up to two choices and up totranslation for generic polygons with no more than 2 pairs ofparallel sides.

Emily B. Dryden Building polygons from spectral data

Page 27: Building polygons from spectral data - Bucknell University · Building polygons from spectral data Emily B. Dryden Bucknell University MAA Special Session on Decoding Geometry January

MotivationThe Problem

Some SolutionsImplications

Open questions and future directions

Can the two possibilities be distinguished using spectraldata?Are the genericity assumptions necessary?

What can we say about the metric?Can one hear the shape of a Delzant polytope?!

Emily B. Dryden Building polygons from spectral data

Page 28: Building polygons from spectral data - Bucknell University · Building polygons from spectral data Emily B. Dryden Bucknell University MAA Special Session on Decoding Geometry January

MotivationThe Problem

Some SolutionsImplications

Open questions and future directions

Can the two possibilities be distinguished using spectraldata?Are the genericity assumptions necessary?What can we say about the metric?

Can one hear the shape of a Delzant polytope?!

Emily B. Dryden Building polygons from spectral data

Page 29: Building polygons from spectral data - Bucknell University · Building polygons from spectral data Emily B. Dryden Bucknell University MAA Special Session on Decoding Geometry January

MotivationThe Problem

Some SolutionsImplications

Open questions and future directions

Can the two possibilities be distinguished using spectraldata?Are the genericity assumptions necessary?What can we say about the metric?Can one hear the shape of a Delzant polytope?!

Emily B. Dryden Building polygons from spectral data