Moon Duchin YOUR NEW FAVORITE GROUP YOUR NEW FAVORITE GROUP

Moon Duchin YOUR NEW FAVORITE GROUP YOUR NEW FAVORITE GROUP

INTRODUCTION TO NILPOTENT GROUPS Moon Duchin YOUR NEW FAVORITE GROUP YOUR NEW FAVORITE GROUP ➤ the Heisenberg group: H(ℤ)≤H(ℝ) YOUR NEW FAVORITE GROUP ➤ the Heisenberg group: H(ℤ)≤H(ℝ) YOUR NEW FAVORITE GROUP ➤ the Heisenberg group: H(ℤ)≤H(ℝ) YOUR NEW FAVORITE GROUP ➤ the Heisenberg group: H(ℤ)≤H(ℝ) ➤ commutator: [g,h]=ghg-1h-1 — measures the failure to commute. Write nested commutators [g,h,j,k]=[[[g,h],j],k], etc. YOUR NEW FAVORITE GROUP ➤ the Heisenberg group: H(ℤ)≤H(ℝ) ➤ commutator: [g,h]=ghg-1h-1 — measures the failure to commute. Write nested commutators [g,h,j,k]=[[[g,h],j],k], etc. ➤ In H, one checks that [a,b]=c, and [an,bm]=cnm. YOUR NEW FAVORITE GROUP ➤ the Heisenberg group: H(ℤ)≤H(ℝ) ➤ commutator: [g,h]=ghg-1h-1 — measures the failure to commute. Write nested commutators [g,h,j,k]=[[[g,h],j],k], etc. ➤ In H, one checks that [a,b]=c, and [an,bm]=cnm. ➤ Generalization: a closed path in ab plane equals cA (signed area). YOUR NEW FAVORITE GROUP ➤ the Heisenberg group: H(ℤ)≤H(ℝ) ➤ commutator: [g,h]=ghg-1h-1 — measures the failure to commute. Write nested commutators [g,h,j,k]=[[[g,h],j],k], etc. ➤ In H, one checks that [a,b]=c, and [an,bm]=cnm. ➤ Generalization: a closed path in ab plane equals cA (signed area). ➤ The letter c is central, so [g,h,k]=1 for any group elements. (This is called 2-step nilpotency.) YOUR NEW FAVORITE GROUP ➤ the Heisenberg group: H(ℤ)≤H(ℝ) ➤ commutator: [g,h]=ghg-1h-1 — measures the failure to commute. Write nested commutators [g,h,j,k]=[[[g,h],j],k], etc. ➤ In H, one checks that [a,b]=c, and [an,bm]=cnm. ➤ Generalization: a closed path in ab plane equals cA (signed area). ➤ The letter c is central, so [g,h,k]=1 for any group elements. (This is called 2-step nilpotency.) ➤ ≤ s-step nilpotent ⟺ (s+1)-fold commutators are killed NILPOTENT GENERALITIES NILPOTENT GENERALITIES ➤ Generally, nilpotent means LCS gets to {1} in s steps NILPOTENT GENERALITIES ➤ Generally, nilpotent means LCS gets to {1} in s steps NILPOTENT GENERALITIES ➤ Generally, nilpotent means LCS gets to {1} in s steps NILPOTENT GENERALITIES ➤ Generally, nilpotent means LCS gets to {1} in s steps ➤ Other examples: higher Heis H2k+1; free nilpotent groups Ns,m NILPOTENT GENERALITIES ➤ Generally, nilpotent means LCS gets to {1} in s steps ➤ Other examples: higher Heis H2k+1; free nilpotent groups Ns,m NILPOTENT GENERALITIES ➤ Generally, nilpotent means LCS gets to {1} in s steps ➤ Other examples: higher Heis H2k+1; free nilpotent groups Ns,m = NILPOTENT GENERALITIES ➤ Generally, nilpotent means LCS gets to {1} in s steps ➤ Other examples: higher Heis H2k+1; free nilpotent groups Ns,m = ➤ The unitriangular groups UTN(ℤ) are nilpotent because addition is additive on the first nonzero superdiagonal, so taking nested commutators will terminate in at most N-1 steps NILPOTENT GENERALITIES ➤ Generally, nilpotent means LCS gets to {1} in s steps ➤ Other examples: higher Heis H2k+1; free nilpotent groups Ns,m = ➤ The unitriangular groups UTN(ℤ) are nilpotent because addition is additive on the first nonzero superdiagonal, so taking nested commutators will terminate in at most N-1 steps ➤ conversely: every fin-gen torsion-free nilpotent group embeds in some UTN(ℤ) NILPOTENT GENERALITIES ➤ Generally, nilpotent means LCS gets to {1} in s steps ➤ Other examples: higher Heis H2k+1; free nilpotent groups Ns,m = ➤ The unitriangular groups UTN(ℤ) are nilpotent because addition is additive on the first nonzero superdiagonal, so taking nested commutators will terminate in at most N-1 steps ➤ conversely: every fin-gen torsion-free nilpotent group embeds in some UTN(ℤ) ➤ This goes through a Lie group fact: every simply connected nilpotent group is isomorphic to a Lie subgroup of some UTN(ℝ) NILPOTENT GENERALITIES ➤ Generally, nilpotent means LCS gets to {1} in s steps ➤ Other examples: higher Heis H2k+1; free nilpotent groups Ns,m = ➤ The unitriangular groups UTN(ℤ) are nilpotent because addition is additive on the first nonzero superdiagonal, so taking nested commutators will terminate in at most N-1 steps ➤ conversely: every fin-gen torsion-free nilpotent group embeds in some UTN(ℤ) ➤ This goes through a Lie group fact: every simply connected nilpotent group is isomorphic to a Lie subgroup of some UTN(ℝ) (proved by embedding the Lie algebra into strictly upper△s) GETTING TO KNOW YOUR NEW FAVORITE GROUP ➤ Multiple ways to coordinatize. (a) matrix entries; (b) normal form aAbBcC; (c) exponential coordinates GETTING TO KNOW YOUR NEW FAVORITE GROUP ➤ Multiple ways to coordinatize. (a) matrix entries; (b) normal form aAbBcC; (c) exponential coordinates GETTING TO KNOW YOUR NEW FAVORITE GROUP ➤ Multiple ways to coordinatize. (a) matrix entries; (b) normal form aAbBcC; (c) exponential coordinates GETTING TO KNOW YOUR NEW FAVORITE GROUP ➤ Multiple ways to coordinatize. (a) matrix entries; (b) normal form aAbBcC; (c) exponential coordinates linear linear GETTING TO KNOW YOUR NEW FAVORITE GROUP ➤ Multiple ways to coordinatize. (a) matrix entries; (b) normal form aAbBcC; (c) exponential coordinates linear linear quadratic GETTING TO KNOW YOUR NEW FAVORITE GROUP ➤ Multiple ways to coordinatize. (a) matrix entries; (b) normal form aAbBcC; (c) exponential coordinates linear linear quadratic Theorem (deKimpe 2013): if ℤn or ℝn has a group structure in which multiplication is polynomial, then it is a nilpotent group. GETTING TO KNOW YOUR NEW FAVORITE GROUP ➤ Multiple ways to coordinatize. (a) matrix entries; (b) normal form aAbBcC; (c) exponential coordinates linear linear quadratic Theorem (deKimpe 2013): if ℤn or ℝn has a group structure in which multiplication is polynomial, then it is a nilpotent group. GETTING TO KNOW YOUR NEW FAVORITE GROUP ➤ Multiple ways to coordinatize. (a) matrix entries; (b) normal form aAbBcC; (c) exponential coordinates all three generalize! cf: Mal’cev theory linear linear quadratic Theorem (deKimpe 2013): if ℤn or ℝn has a group structure in which multiplication is polynomial, then it is a nilpotent group. NAVIGATING AROUND: “HORIZONTAL” DIRECTIONS NAVIGATING AROUND: “HORIZONTAL” DIRECTIONS ➤ exponential coordinates on H(ℝ) let us plot in ℝ3 : NAVIGATING AROUND: “HORIZONTAL” DIRECTIONS ➤ exponential coordinates on H(ℝ) let us plot in ℝ3 : NAVIGATING AROUND: “HORIZONTAL” DIRECTIONS ➤ exponential coordinates on H(ℝ) let us plot in ℝ3 : NAVIGATING AROUND: “HORIZONTAL” DIRECTIONS ➤ exponential coordinates on H(ℝ) let us plot in ℝ3 : ➤ “horizontal” plane in Lie algebra can be “pushed around” by left multiplication to get a plane field (subbundle of TH) NAVIGATING AROUND: “HORIZONTAL” DIRECTIONS ➤ exponential coordinates on H(ℝ) let us plot in ℝ3 : ➤ “horizontal” plane in Lie algebra can be “pushed around” by left multiplication to get a plane field (subbundle of TH) NAVIGATING AROUND: “HORIZONTAL” DIRECTIONS ➤ exponential coordinates on H(ℝ) let us plot in ℝ3 : ➤ “horizontal” plane in Lie algebra can be “pushed around” by left multiplication to get a plane field (subbundle of TH) BALAYAGE: AREA VS. HEIGHT BALAYAGE: AREA VS. HEIGHT ➤ Say a curve �=(�1,�2,�3) is admissible if its tangent vectors are horizontal, i.e., �3ʹ=½(�1�2ʹ-�2�1ʹ). BALAYAGE: AREA VS. HEIGHT ➤ Say a curve �=(�1,�2,�3) is admissible if its tangent vectors are horizontal, i.e., �3ʹ=½(�1�2ʹ-�2�1ʹ). ➤ Fact 1: Any two points in H connected by an admissible path. BALAYAGE: AREA VS. HEIGHT ➤ Say a curve �=(�1,�2,�3) is admissible if its tangent vectors are horizontal, i.e., �3ʹ=½(�1�2ʹ-�2�1ʹ). ➤ Fact 1: Any two points in H connected by an admissible path. ➤ Fact 2: Any plane curve �=(�1,�2) lifts uniquely to an admissible path. Third coordinate is area. BALAYAGE: AREA VS. HEIGHT ➤ Say a curve �=(�1,�2,�3) is admissible if its tangent vectors are horizontal, i.e., �3ʹ=½(�1�2ʹ-�2�1ʹ). ➤ Fact 1: Any two points in H connected by an admissible path. ➤ Fact 2: Any plane curve �=(�1,�2) lifts uniquely to an admissible path. Third coordinate is area. BALAYAGE: AREA VS. HEIGHT ➤ Say a curve �=(�1,�2,�3) is admissible if its tangent vectors are horizontal, i.e., �3ʹ=½(�1�2ʹ-�2�1ʹ). ➤ Fact 1: Any two points in H connected by an admissible path. ➤ Fact 2: Any plane curve �=(�1,�2) lifts uniquely to an admissible path. Third coordinate is area. BALAYAGE: AREA VS. HEIGHT ➤ Say a curve �=(�1,�2,�3) is admissible if its tangent vectors are horizontal, i.e., �3ʹ=½(�1�2ʹ-�2�1ʹ). ➤ Fact 1: Any two points in H connected by an admissible path. ➤ Fact 2: Any plane curve �=(�1,�2) lifts uniquely to an admissible path. Third coordinate is area. ➤ Proof: Stokes! BALAYAGE: AREA VS. HEIGHT ➤ Say a curve �=(�1,�2,�3) is admissible if its tangent vectors are horizontal, i.e., �3ʹ=½(�1�2ʹ-�2�1ʹ). ➤ Fact 1: Any two points in H connected by an admissible path. ➤ Fact 2: Any plane curve �=(�1,�2) lifts uniquely to an admissible path. Third coordinate is area. ➤ Proof: Stokes! CC GEOMETRY: SUB-RIEMANNIAN AND SUB-FINSLER CC GEOMETRY: SUB-RIEMANNIAN AND SUB-FINSLER ➤ So you can norm the horizontal planes however you like and this induces lengths of admissible curves; get a length metric on all of H. And actually this works for any Carnot group (nilpotent group with nice grading) if you norm its horizontal subbundle. CC GEOMETRY: SUB-RIEMANNIAN AND SUB-FINSLER ➤ So you can norm the horizontal planes however you like and this induces lengths of admissible curves; get a length metric on all of H. And actually this works for any Carnot group (nilpotent group with nice grading) if you norm its horizontal subbundle. ➤ Lengths and areas of plane curves in a norm completely describe paths in this metric space.

View Full Text

Details

  • File Type
    pdf
  • Upload Time
    -
  • Content Languages
    English
  • Upload User
    Anonymous/Not logged-in
  • File Pages
    238 Page
  • File Size
    -

Download

Channel Download Status
Express Download Enable

Copyright

We respect the copyrights and intellectual property rights of all users. All uploaded documents are either original works of the uploader or authorized works of the rightful owners.

  • Not to be reproduced or distributed without explicit permission.
  • Not used for commercial purposes outside of approved use cases.
  • Not used to infringe on the rights of the original creators.
  • If you believe any content infringes your copyright, please contact us immediately.

Support

For help with questions, suggestions, or problems, please contact us