embeddings of the heisenberg group uniform rectifiability
play

Embeddings of the Heisenberg group, uniform rectifiability, and the - PowerPoint PPT Presentation

Embeddings of the Heisenberg group, uniform rectifiability, and the Sparsest Cut problem Robert Young New York University (joint work with Assaf Naor) June 2018 A.N. was supported by BSF grant 2010021, the Packard Foundation and the Simons


  1. Embeddings of the Heisenberg group, uniform rectifiability, and the Sparsest Cut problem Robert Young New York University (joint work with Assaf Naor) June 2018 A.N. was supported by BSF grant 2010021, the Packard Foundation and the Simons Foundation. R.Y. was supported by NSF grant DMS 1612061, the Sloan Foundation, and the Fall 2016 program at MSRI. The research that is presented here was conducted under the auspices of the Simons Algorithms and Geometry (A&G) Think Tank.

  2. Distortion Let X be a metric space. ◮ Let f : X → Y and let D ≥ 1. We say that f has distortion at most D if there is an r > 0 such that d ( f ( a ) , f ( b )) ∈ [ r , Dr ] d ( a , b ) for all a , b ∈ X , a � = b .

  3. Distortion Let X be a metric space. ◮ Let f : X → Y and let D ≥ 1. We say that f has distortion at most D if there is an r > 0 such that d ( f ( a ) , f ( b )) ∈ [ r , Dr ] d ( a , b ) for all a , b ∈ X , a � = b . ◮ For p > 0, the L p –distortion of X is the infimal D ∈ [1 , ∞ ] such that there is an embedding f : X → L p such that d ( a , b ) ≤ � f ( a ) − f ( b ) � p ≤ Dd ( a , b ) for every a , b ∈ M .

  4. Examples ◮ (Kuratowski) For any metric space X , c ∞ ( X ) = 1.

  5. Examples ◮ (Kuratowski) For any metric space X , c ∞ ( X ) = 1. ◮ (Bourgain) If X is an n –point metric space, then c p ( X ) � log n for any 1 ≤ p ≤ ∞ .

  6. Examples ◮ (Kuratowski) For any metric space X , c ∞ ( X ) = 1. ◮ (Bourgain) If X is an n –point metric space, then c p ( X ) � log n for any 1 ≤ p ≤ ∞ . ◮ (Matouˇ sek) If X is an n –point expander graph, and 1 ≤ p < ∞ , then c p ( X ) � log n .

  7. The main theorem Theorem (Naor-Y.) Let k ≥ 2 and let B 2 k +1 ( n ) be the set of integer points in the ball Z of radius n in the Heisenberg group H 2 k +1 . Then c 1 ( B 2 k +1 � ( n )) ≍ log n . Z

  8. The main theorem Theorem (Naor-Y.) Let k ≥ 2 and let B 2 k +1 ( n ) be the set of integer points in the ball Z of radius n in the Heisenberg group H 2 k +1 . Then c 1 ( B 2 k +1 � ( n )) ≍ log n . Z Theorem (Naor-Y.) Let B 3 Z ( n ) be the set of integer points in the ball of radius n in the Heisenberg group H 3 . Then 1 c 1 ( B 3 4 . Z ( n )) ≍ (log n )

  9. c 1 and the Sparsest Cut problem For n > 0, let α ( n ) = max { c 1 ( X ) | X is an n –point metric space of negative type } . This is the Goemans–Linial integrality gap .

  10. c 1 and the Sparsest Cut problem For n > 0, let α ( n ) = max { c 1 ( X ) | X is an n –point metric space of negative type } . This is the Goemans–Linial integrality gap . Theorem (Goemans–Linial) There is a polynomial-time algorithm that approximates the Nonuniform Sparsest Cut Problem to within a factor of α ( n ) .

  11. c 1 and the Sparsest Cut problem For n > 0, let α ( n ) = max { c 1 ( X ) | X is an n –point metric space of negative type } . This is the Goemans–Linial integrality gap . Theorem (Goemans–Linial) There is a polynomial-time algorithm that approximates the Nonuniform Sparsest Cut Problem to within a factor of α ( n ) . Theorem (Lee-Naor) The Heisenberg group is bilipschitz equivalent to a metric of negative type.

  12. The Goemans–Linial question How does α ( n ) grow with n ?

  13. The Goemans–Linial question How does α ( n ) grow with n ? 1 2 + o (1) (Arora-Lee-Naor). ◮ α ( n ) � (log n )

  14. The Goemans–Linial question How does α ( n ) grow with n ? 1 2 + o (1) (Arora-Lee-Naor). ◮ α ( n ) � (log n ) Does every finite negative-type metric space embed in L 1 by a bilipschitz map?

  15. The Goemans–Linial question How does α ( n ) grow with n ? 1 2 + o (1) (Arora-Lee-Naor). ◮ α ( n ) � (log n ) Does every finite negative-type metric space embed in L 1 by a bilipschitz map? The answer is no: ◮ α ( n ) � (log log n ) c (Khot-Vishnoi)

  16. The Goemans–Linial question How does α ( n ) grow with n ? 1 2 + o (1) (Arora-Lee-Naor). ◮ α ( n ) � (log n ) Does every finite negative-type metric space embed in L 1 by a bilipschitz map? The answer is no: ◮ α ( n ) � (log log n ) c (Khot-Vishnoi) ◮ α ( n ) � (log n ) c ′ (with c ′ ≈ 2 − 60 ) (Cheeger-Kleiner-Naor)

  17. The Heisenberg group Let H 2 k +1 ⊂ M k +2 be the (2 k + 1)–dimensional nilpotent Lie group  �    1 x 1 . . . x k z �    �  0 1 0 0 y 1      �      .  �  H 2 k +1 = ... . x i , y i , z ∈ R .   � 0 0 0 .   �    �  0 0 0 1 y k      �     �  0 0 0 0 1   �

  18. The Heisenberg group Let H 2 k +1 ⊂ M k +2 be the (2 k + 1)–dimensional nilpotent Lie group  �    1 x 1 . . . x k z �    �  0 1 0 0 y 1      �      .  �  H 2 k +1 = ... . x i , y i , z ∈ R .   � 0 0 0 .   �    �  0 0 0 1 y k      �     �  0 0 0 0 1   � This contains a lattice H Z 2 k +1 = � x 1 , . . . , x k , y 1 , . . . , y k , z | [ x i , y i ] = z , all other pairs commute � .

  19. A lattice in H 3

  20. A lattice in H 3 z = xyx − 1 y − 1

  21. A lattice in H 3 z = xyx − 1 y − 1 z 4 = x 2 y 2 x − 2 y − 2

  22. A lattice in H 3 z = xyx − 1 y − 1 z 4 = x 2 y 2 x − 2 y − 2 z n 2 = x n y n x − n y − n

  23. From Cayley graph to sub-riemannian metric ◮ d ( u , v ) = inf { ℓ ( γ ) | γ is a horizontal curve from u to v }

  24. From Cayley graph to sub-riemannian metric ◮ d ( u , v ) = inf { ℓ ( γ ) | γ is a horizontal curve from u to v } ◮ The map s t ( x , y , z ) = ( tx , ty , t 2 z ) scales the metric

  25. From Cayley graph to sub-riemannian metric ◮ d ( u , v ) = inf { ℓ ( γ ) | γ is a horizontal curve from u to v } ◮ The map s t ( x , y , z ) = ( tx , ty , t 2 z ) scales the metric ◮ The ball of radius ǫ is approximately an ǫ × ǫ × ǫ 2 box.

  26. From Cayley graph to sub-riemannian metric ◮ d ( u , v ) = inf { ℓ ( γ ) | γ is a horizontal curve from u to v } ◮ The map s t ( x , y , z ) = ( tx , ty , t 2 z ) scales the metric ◮ The ball of radius ǫ is approximately an ǫ × ǫ × ǫ 2 box. ◮ The z –axis has Hausdorff dimension 2

  27. Embeddings of the Heisenberg group Theorem (Pansu, Semmes) There is no bilipschitz embedding from H 2 k +1 to R N .

  28. Embeddings of the Heisenberg group Theorem (Pansu, Semmes) There is no bilipschitz embedding from H 2 k +1 to R N . Theorem (Pansu) Every Lipschitz map f : H 2 k +1 → R N is Pansu differentiable almost everywhere.

  29. Embeddings of the Heisenberg group Theorem (Pansu, Semmes) There is no bilipschitz embedding from H 2 k +1 to R N . Theorem (Pansu) Every Lipschitz map f : H 2 k +1 → R N is Pansu differentiable almost everywhere. That is, on sufficiently small scales, f is close to a homomorphism.

  30. Embeddings of the Heisenberg group Theorem (Pansu, Semmes) There is no bilipschitz embedding from H 2 k +1 to R N . Theorem (Pansu) Every Lipschitz map f : H 2 k +1 → R N is Pansu differentiable almost everywhere. That is, on sufficiently small scales, f is close to a homomorphism. But any homomorphism sends z to 0 – so any Lipschitz map to R N collapses the z direction.

  31. H 2 k +1 does not embed in L 1 Pansu’s theorem does not work for L 1 because Lipschitz maps to L 1 may not be differentiable anywhere.

  32. H 2 k +1 does not embed in L 1 Pansu’s theorem does not work for L 1 because Lipschitz maps to L 1 may not be differentiable anywhere. Example The map f : [0 , 1] → L 1 ([0 , 1]) f ( t ) = 1 [0 , t ] , is an isometric embedding that cannot be approximated by a linear map.

  33. Regardless, Cheeger and Kleiner showed: Theorem (Cheeger-Kleiner) There is no bilipschitz embedding from the unit ball B ⊂ H 2 k +1 to L 1 .

  34. Regardless, Cheeger and Kleiner showed: Theorem (Cheeger-Kleiner) There is no bilipschitz embedding from the unit ball B ⊂ H 2 k +1 to L 1 . The proof involves a version of differentiation based on cut metrics.

  35. Cut metrics Let X be a set. A cut metric on X is a semimetric of the form d S ( i , j ) = | 1 S ( i ) − 1 S ( j ) | where S ⊂ X .

  36. Cut metrics Let X be a set. A cut metric on X is a semimetric of the form d S ( i , j ) = | 1 S ( i ) − 1 S ( j ) | where S ⊂ X . The metric induced by any map f : X → L 1 is a linear combination of cut metrics: Lemma If f : X → L 1 , then there is a measure µ (the cut measure) on 2 X such that � d ( f ( x ) , f ( y )) = d S ( x , y ) d µ ( S ) .

  37. Proof: H 2 k +1 does not embed in L 1 We can study maps f : H 2 k +1 → L 1 by studying cuts in H 2 k +1 .

  38. Proof: H 2 k +1 does not embed in L 1 We can study maps f : H 2 k +1 → L 1 by studying cuts in H 2 k +1 . Open sets in H 2 k +1 have Hausdorff dimension 2 k + 2 and any surface that separates two open sets has Hausdorff dimension at least 2 k + 1, so we let area = H 2 k +1 , vol = H 2 k +2 .

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend