a partial discussion of the kitaev table
play

A (partial) discussion of the Kitaev table Gian Michele Graf, ETH - PowerPoint PPT Presentation

A (partial) discussion of the Kitaev table Gian Michele Graf, ETH Zurich PhD School: September 16-20, 2019 @Universit` a degli Studi Roma Tre A (partial) discussion of the Kitaev table Gian Michele Graf, ETH Zurich PhD School: September


  1. Normal forms of lone symmetries Let � 0 − 1 � 0 1 � � ε = , ω = i 1 0 1 0 det ε = det ω = 1 We’ll see: Depending on classes, N := dim V = n , 2 n , 4 n , ( n = 1 , 2 , . . . ). We’ll construct adapted orthonormal bases V = ( v j ) k j = 1 = ( v 1 , . . . , v k ) of invariant subspaces of V of dimension k = 1 , 2 , 4; generated by arbitrary v 1 , ( � v 1 � = 1). Exhaust the complement. Left action: UV = ( Uv 1 , . . . , Uv k ) ( U : V → V map) i v i M ij ) k Right action: VM = ( � j = 1 ( M : matrix of order k ) ◮ Θ ( α = + 1) has k = 1: v 1 such that Θ v 1 = v 1 ,

  2. Normal forms of lone symmetries Let � 0 − 1 � 0 1 � � ε = , ω = i 1 0 1 0 det ε = det ω = 1 We’ll see: Depending on classes, N := dim V = n , 2 n , 4 n , ( n = 1 , 2 , . . . ). We’ll construct adapted orthonormal bases V = ( v j ) k j = 1 = ( v 1 , . . . , v k ) of invariant subspaces of V of dimension k = 1 , 2 , 4; generated by arbitrary v 1 , ( � v 1 � = 1). Exhaust the complement. Left action: UV = ( Uv 1 , . . . , Uv k ) ( U : V → V map) i v i M ij ) k Right action: VM = ( � j = 1 ( M : matrix of order k ) ◮ Θ ( α = + 1) has k = 1: v 1 such that Θ v 1 = v 1 , i.e. Θ V = V

  3. Normal forms of lone symmetries Let � 0 − 1 � 0 1 � � ε = , ω = i 1 0 1 0 det ε = det ω = 1 We’ll see: Depending on classes, N := dim V = n , 2 n , 4 n , ( n = 1 , 2 , . . . ). We’ll construct adapted orthonormal bases V = ( v j ) k j = 1 = ( v 1 , . . . , v k ) of invariant subspaces of V of dimension k = 1 , 2 , 4; generated by arbitrary v 1 , ( � v 1 � = 1). Exhaust the complement. Left action: UV = ( Uv 1 , . . . , Uv k ) ( U : V → V map) i v i M ij ) k Right action: VM = ( � j = 1 ( M : matrix of order k ) ◮ Θ ( α = + 1) has k = 1: v 1 such that Θ v 1 = v 1 , i.e. Θ V = V ◮ Θ ( α = − 1) has k = 2:

  4. Normal forms of lone symmetries Let � 0 − 1 � 0 1 � � ε = , ω = i 1 0 1 0 det ε = det ω = 1 We’ll see: Depending on classes, N := dim V = n , 2 n , 4 n , ( n = 1 , 2 , . . . ). We’ll construct adapted orthonormal bases V = ( v j ) k j = 1 = ( v 1 , . . . , v k ) of invariant subspaces of V of dimension k = 1 , 2 , 4; generated by arbitrary v 1 , ( � v 1 � = 1). Exhaust the complement. Left action: UV = ( Uv 1 , . . . , Uv k ) ( U : V → V map) i v i M ij ) k Right action: VM = ( � j = 1 ( M : matrix of order k ) ◮ Θ ( α = + 1) has k = 1: v 1 such that Θ v 1 = v 1 , i.e. Θ V = V ◮ Θ ( α = − 1) has k = 2: v 2 := Θ v 1 , Θ v 2 = − v 1 ; then Θ V = (Θ v 1 , Θ v 2 ) = ( v 2 , − v 1 ) = V ε

  5. Normal forms of lone symmetries (cont.) ◮ Σ ( β = + 1) has k = 2:

  6. Normal forms of lone symmetries (cont.) ◮ Σ ( β = + 1) has k = 2: v 1 ∈ V + , v 2 := − i Σ v 1 ∈ V − ; then Σ V = ( i v 2 , i v 1 ) = V ω

  7. Normal forms of lone symmetries (cont.) ◮ Σ ( β = + 1) has k = 2: v 1 ∈ V + , v 2 := − i Σ v 1 ∈ V − ; then Σ V = ( i v 2 , i v 1 ) = V ω ◮ Σ ( β = − 1) has k = 2:

  8. Normal forms of lone symmetries (cont.) ◮ Σ ( β = + 1) has k = 2: v 1 ∈ V + , v 2 := − i Σ v 1 ∈ V − ; then Σ V = ( i v 2 , i v 1 ) = V ω ◮ Σ ( β = − 1) has k = 2: v 1 ∈ V + , v 2 := Σ v 1 ∈ V − ; then Σ V = ( v 2 , − v 1 ) = V ε

  9. Normal forms of lone symmetries (cont.) ◮ Σ ( β = + 1) has k = 2: v 1 ∈ V + , v 2 := − i Σ v 1 ∈ V − ; then Σ V = ( i v 2 , i v 1 ) = V ω ◮ Σ ( β = − 1) has k = 2: v 1 ∈ V + , v 2 := Σ v 1 ∈ V − ; then Σ V = ( v 2 , − v 1 ) = V ε ◮ Π ( γ = − 1 w.l.o.g.) has k = 2:

  10. Normal forms of lone symmetries (cont.) ◮ Σ ( β = + 1) has k = 2: v 1 ∈ V + , v 2 := − i Σ v 1 ∈ V − ; then Σ V = ( i v 2 , i v 1 ) = V ω ◮ Σ ( β = − 1) has k = 2: v 1 ∈ V + , v 2 := Σ v 1 ∈ V − ; then Σ V = ( v 2 , − v 1 ) = V ε ◮ Π ( γ = − 1 w.l.o.g.) has k = 2: v 1 ∈ V + , v 2 := − i Π v 1 ∈ V − ; then Π V = ( i v 2 , i v 1 ) = V ω

  11. Normal forms of combined symmetries Θ , Σ ◮ α = + 1 , β = ± 1 has k = 2: � ω ( β = + 1 ) Θ V = V , Σ V = V ε ( β = − 1 )

  12. Normal forms of combined symmetries Θ , Σ ◮ α = + 1 , β = ± 1 has k = 2: � ω ( β = + 1 ) Θ V = V , Σ V = V ε ( β = − 1 ) ◮ α = − 1 , β = ± 1 has k = 4: � ε 0 � � 0 β 1 2 � Θ V = V , Σ V = V 0 ε 1 2 0

  13. The identification V ∼ = C N Let K : C N → C N be the standard complex conjugation

  14. The identification V ∼ = C N Let K : C N → C N be the standard complex conjugation Claim: Lone symmetries U = Θ , Σ ( U 2 = γ = ± 1; γ = α or β , hence 2 + 2 cases) on V can be brought to the following form on C N ◮ γ = + 1 ( N = n , 2 n ): U = K ◮ γ = − 1 ( N = 2 n ): U = ε K

  15. The identification V ∼ = C N Let K : C N → C N be the standard complex conjugation Claim: Lone symmetries U = Θ , Σ ( U 2 = γ = ± 1; γ = α or β , hence 2 + 2 cases) on V can be brought to the following form on C N ◮ γ = + 1 ( N = n , 2 n ): U = K ◮ γ = − 1 ( N = 2 n ): U = ε K Remarks. 1) Note that Σ qualifies as Θ (see earlier remark)

  16. The identification V ∼ = C N Let K : C N → C N be the standard complex conjugation Claim: Lone symmetries U = Θ , Σ ( U 2 = γ = ± 1; γ = α or β , hence 2 + 2 cases) on V can be brought to the following form on C N ◮ γ = + 1 ( N = n , 2 n ): U = K ◮ γ = − 1 ( N = 2 n ): U = ε K Remarks. 1) Note that Σ qualifies as Θ (see earlier remark) 2) For U = Σ the split V = V + ⊕ V − is compatibly realized as V ± = { ( v , ± i v ) | v ∈ C n } ⊂ C n ⊕ C n = C N , (or flipped)

  17. The identification V ∼ = C N Let K : C N → C N be the standard complex conjugation Claim: Lone symmetries U = Θ , Σ ( U 2 = γ = ± 1; γ = α or β , hence 2 + 2 cases) on V can be brought to the following form on C N ◮ γ = + 1 ( N = n , 2 n ): U = K ◮ γ = − 1 ( N = 2 n ): U = ε K Remarks. 1) Note that Σ qualifies as Θ (see earlier remark) 2) For U = Σ the split V = V + ⊕ V − is compatibly realized as V ± = { ( v , ± i v ) | v ∈ C n } ⊂ C n ⊕ C n = C N , (or flipped) 3) Proof: ◮ In the cases α = ± 1, the claim is seen by mapping an adapted basis V to the standard basis of C N

  18. The identification V ∼ = C N Let K : C N → C N be the standard complex conjugation Claim: Lone symmetries U = Θ , Σ ( U 2 = γ = ± 1; γ = α or β , hence 2 + 2 cases) on V can be brought to the following form on C N ◮ γ = + 1 ( N = n , 2 n ): U = K ◮ γ = − 1 ( N = 2 n ): U = ε K Remarks. 1) Note that Σ qualifies as Θ (see earlier remark) 2) For U = Σ the split V = V + ⊕ V − is compatibly realized as V ± = { ( v , ± i v ) | v ∈ C n } ⊂ C n ⊕ C n = C N , (or flipped) 3) Proof: ◮ In the cases α = ± 1, the claim is seen by mapping an adapted basis V to the standard basis of C N � 1 ◮ In the cases β = ± 1 the mapping is (e.g.) v 1 �→ � , � 1 i � v 2 �→ − i β , compatibly with the stated V ± (unflipped) − i

  19. The identification V ∼ = C N Let K : C N → C N be the standard complex conjugation Claim: Lone symmetries U = Θ , Σ ( U 2 = γ = ± 1; γ = α or β , hence 2 + 2 cases) on V can be brought to the following form on C N ◮ γ = + 1 ( N = n , 2 n ): U = K ◮ γ = − 1 ( N = 2 n ): U = ε K Remarks. 1) Note that Σ qualifies as Θ (see earlier remark) 2) For U = Σ the split V = V + ⊕ V − is compatibly realized as V ± = { ( v , ± i v ) | v ∈ C n } ⊂ C n ⊕ C n = C N , (or flipped) 3) Proof: ◮ In the cases α = ± 1, the claim is seen by mapping an adapted basis V to the standard basis of C N � 1 ◮ In the cases β = ± 1 the mapping is (e.g.) v 1 �→ � , � 1 i � v 2 �→ − i β , compatibly with the stated V ± (unflipped) − i 4) This foreshadows: The lone symmetry Θ will not contribute to G (to be checked).

  20. The classification task in general Any (symmetry equipped) vector space V can be identified with C N (symmetry equipped as explained).

  21. The classification task in general Any (symmetry equipped) vector space V can be identified with C N (symmetry equipped as explained). However this does not imply that any two of them are homotopic, as the identifications might be non homotopic.

  22. The classification task in general Any (symmetry equipped) vector space V can be identified with C N (symmetry equipped as explained). However this does not imply that any two of them are homotopic, as the identifications might be non homotopic. Viewed through C N , the setting and the task become ◮ Bases (unrestricted) are matrices V ∈ U ( N ) (unitary group as a set)

  23. The classification task in general Any (symmetry equipped) vector space V can be identified with C N (symmetry equipped as explained). However this does not imply that any two of them are homotopic, as the identifications might be non homotopic. Viewed through C N , the setting and the task become ◮ Bases (unrestricted) are matrices V ∈ U ( N ) (unitary group as a set) ◮ Change of basis (in general) is by action of T ∈ U ( N ) (unitary group as a group): V �→ VT

  24. The classification task in general Any (symmetry equipped) vector space V can be identified with C N (symmetry equipped as explained). However this does not imply that any two of them are homotopic, as the identifications might be non homotopic. Viewed through C N , the setting and the task become ◮ Bases (unrestricted) are matrices V ∈ U ( N ) (unitary group as a set) ◮ Change of basis (in general) is by action of T ∈ U ( N ) (unitary group as a group): V �→ VT ◮ Adapted bases form the set B = { V ∈ U ( N ) | symmetry constraint }

  25. The classification task in general Any (symmetry equipped) vector space V can be identified with C N (symmetry equipped as explained). However this does not imply that any two of them are homotopic, as the identifications might be non homotopic. Viewed through C N , the setting and the task become ◮ Bases (unrestricted) are matrices V ∈ U ( N ) (unitary group as a set) ◮ Change of basis (in general) is by action of T ∈ U ( N ) (unitary group as a group): V �→ VT ◮ Adapted bases form the set B = { V ∈ U ( N ) | symmetry constraint } ◮ Change of adapted basis is by action of T = { T ∈ U ( N ) | symmetry constraint preserving }

  26. The classification task in general Any (symmetry equipped) vector space V can be identified with C N (symmetry equipped as explained). However this does not imply that any two of them are homotopic, as the identifications might be non homotopic. Viewed through C N , the setting and the task become ◮ Bases (unrestricted) are matrices V ∈ U ( N ) (unitary group as a set) ◮ Change of basis (in general) is by action of T ∈ U ( N ) (unitary group as a group): V �→ VT ◮ Adapted bases form the set B = { V ∈ U ( N ) | symmetry constraint } ◮ Change of adapted basis is by action of T = { T ∈ U ( N ) | symmetry constraint preserving } ◮ Classification: Right cosets B / T , connected components thereof.

  27. Class A: no symmetry B = U ( N ) , T = U ( N ) , hence B / T trivial.

  28. Class A: no symmetry B = U ( N ) , T = U ( N ) , hence B / T trivial. Only obstruction is N = dim V . So index group is G = Z

  29. Class A: no symmetry B = U ( N ) , T = U ( N ) , hence B / T trivial. Only obstruction is N = dim V . So index group is G = Z Remarks. 1) The index trivializes for Σ , Π by dim V + − dim V − = 0. Do new indices appear? 2) The index survives for just Θ (classes AI, AII). Does the group become larger? (Likely not by earlier remark)

  30. Class AI: Θ with α = + 1 ◮ Basis (normal form): V = Θ V

  31. Class AI: Θ with α = + 1 ◮ Basis (normal form): V = Θ V ◮ Concretely: Θ = K , so V = ¯ V

  32. Class AI: Θ with α = + 1 ◮ Basis (normal form): V = Θ V ◮ Concretely: Θ = K , so V = ¯ V ◮ So: B = O ( N ) . Index Z 2 by det V = ± 1?

  33. Class AI: Θ with α = + 1 ◮ Basis (normal form): V = Θ V ◮ Concretely: Θ = K , so V = ¯ V ◮ So: B = O ( N ) . Index Z 2 by det V = ± 1? ◮ Change of basis V → VT .

  34. Class AI: Θ with α = + 1 ◮ Basis (normal form): V = Θ V ◮ Concretely: Θ = K , so V = ¯ V ◮ So: B = O ( N ) . Index Z 2 by det V = ± 1? ◮ Change of basis V → VT . “Is vs. Ought”: VT = Θ( VT ) = (Θ V )¯ VT = (Θ V ) T , T

  35. Class AI: Θ with α = + 1 ◮ Basis (normal form): V = Θ V ◮ Concretely: Θ = K , so V = ¯ V ◮ So: B = O ( N ) . Index Z 2 by det V = ± 1? ◮ Change of basis V → VT . “Is vs. Ought”: VT = Θ( VT ) = (Θ V )¯ VT = (Θ V ) T , T ◮ So T = ¯ T ,

  36. Class AI: Θ with α = + 1 ◮ Basis (normal form): V = Θ V ◮ Concretely: Θ = K , so V = ¯ V ◮ So: B = O ( N ) . Index Z 2 by det V = ± 1? ◮ Change of basis V → VT . “Is vs. Ought”: VT = Θ( VT ) = (Θ V )¯ VT = (Θ V ) T , T ◮ So T = ¯ T , T = O ( N )

  37. Class AI: Θ with α = + 1 ◮ Basis (normal form): V = Θ V ◮ Concretely: Θ = K , so V = ¯ V ◮ So: B = O ( N ) . Index Z 2 by det V = ± 1? ◮ Change of basis V → VT . “Is vs. Ought”: VT = Θ( VT ) = (Θ V )¯ VT = (Θ V ) T , T ◮ So T = ¯ T , T = O ( N ) and B / T is trivial

  38. Class AI: Θ with α = + 1 ◮ Basis (normal form): V = Θ V ◮ Concretely: Θ = K , so V = ¯ V ◮ So: B = O ( N ) . Index Z 2 by det V = ± 1? ◮ Change of basis V → VT . “Is vs. Ought”: VT = Θ( VT ) = (Θ V )¯ VT = (Θ V ) T , T ◮ So T = ¯ T , T = O ( N ) and B / T is trivial ◮ Index group remains G = Z

  39. Class AII: Θ with α = − 1 ◮ Basis (normal form): Θ V = V ε (or V = − Θ V ε )

  40. Class AII: Θ with α = − 1 ◮ Basis (normal form): Θ V = V ε (or V = − Θ V ε ) ◮ Concretely: Θ = ε K , so ε ¯ V = V ε

  41. Class AII: Θ with α = − 1 ◮ Basis (normal form): Θ V = V ε (or V = − Θ V ε ) ◮ Concretely: Θ = ε K , so ε ¯ V = V ε ◮ So B = { V | V unitary , ε ¯ V = V ε }

  42. Class AII: Θ with α = − 1 ◮ Basis (normal form): Θ V = V ε (or V = − Θ V ε ) ◮ Concretely: Θ = ε K , so ε ¯ V = V ε ◮ So B = { V | V unitary , ε ¯ V = V ε } ◮ Change of basis V → VT .

  43. Class AII: Θ with α = − 1 ◮ Basis (normal form): Θ V = V ε (or V = − Θ V ε ) ◮ Concretely: Θ = ε K , so ε ¯ V = V ε ◮ So B = { V | V unitary , ε ¯ V = V ε } ◮ Change of basis V → VT . “Is vs. Ought”: VT = − Θ( VT ) ε = − (Θ V )¯ VT = − (Θ V ε ) T , T ε

  44. Class AII: Θ with α = − 1 ◮ Basis (normal form): Θ V = V ε (or V = − Θ V ε ) ◮ Concretely: Θ = ε K , so ε ¯ V = V ε ◮ So B = { V | V unitary , ε ¯ V = V ε } ◮ Change of basis V → VT . “Is vs. Ought”: VT = − Θ( VT ) ε = − (Θ V )¯ VT = − (Θ V ε ) T , T ε ◮ So ε T = ¯ T ε ,

  45. Class AII: Θ with α = − 1 ◮ Basis (normal form): Θ V = V ε (or V = − Θ V ε ) ◮ Concretely: Θ = ε K , so ε ¯ V = V ε ◮ So B = { V | V unitary , ε ¯ V = V ε } ◮ Change of basis V → VT . “Is vs. Ought”: VT = − Θ( VT ) ε = − (Θ V )¯ VT = − (Θ V ε ) T , T ε ◮ So ε T = ¯ T ε , T = B and B / T is trivial

  46. Class AII: Θ with α = − 1 ◮ Basis (normal form): Θ V = V ε (or V = − Θ V ε ) ◮ Concretely: Θ = ε K , so ε ¯ V = V ε ◮ So B = { V | V unitary , ε ¯ V = V ε } ◮ Change of basis V → VT . “Is vs. Ought”: VT = − Θ( VT ) ε = − (Θ V )¯ VT = − (Θ V ε ) T , T ε ◮ So ε T = ¯ T ε , T = B and B / T is trivial ◮ Index group remains G = Z

  47. Class D: Σ with β = + 1 ◮ Basis (normal form): Σ V = V ω (or V = − (Σ V ) ω )

  48. Class D: Σ with β = + 1 ◮ Basis (normal form): Σ V = V ω (or V = − (Σ V ) ω ) ◮ Concretely: Σ = K , so ¯ V = V ω

  49. Class D: Σ with β = + 1 ◮ Basis (normal form): Σ V = V ω (or V = − (Σ V ) ω ) ◮ Concretely: Σ = K , so ¯ V = V ω ◮ So B = { V | V unitary , ¯ V = V ω }

  50. Class D: Σ with β = + 1 ◮ Basis (normal form): Σ V = V ω (or V = − (Σ V ) ω ) ◮ Concretely: Σ = K , so ¯ V = V ω ◮ So B = { V | V unitary , ¯ V = V ω } ◮ det V = det V , hence det V = ± 1. Index Z 2 ?

  51. Class D: Σ with β = + 1 ◮ Basis (normal form): Σ V = V ω (or V = − (Σ V ) ω ) ◮ Concretely: Σ = K , so ¯ V = V ω ◮ So B = { V | V unitary , ¯ V = V ω } ◮ det V = det V , hence det V = ± 1. Index Z 2 ? ◮ Change of basis V → VT , T = diag( T + , T − ) .

  52. Class D: Σ with β = + 1 ◮ Basis (normal form): Σ V = V ω (or V = − (Σ V ) ω ) ◮ Concretely: Σ = K , so ¯ V = V ω ◮ So B = { V | V unitary , ¯ V = V ω } ◮ det V = det V , hence det V = ± 1. Index Z 2 ? ◮ Change of basis V → VT , T = diag( T + , T − ) . “Is vs. Ought”: ω T = ¯ T ω , i.e. T − = T +

  53. Class D: Σ with β = + 1 ◮ Basis (normal form): Σ V = V ω (or V = − (Σ V ) ω ) ◮ Concretely: Σ = K , so ¯ V = V ω ◮ So B = { V | V unitary , ¯ V = V ω } ◮ det V = det V , hence det V = ± 1. Index Z 2 ? ◮ Change of basis V → VT , T = diag( T + , T − ) . “Is vs. Ought”: ω T = ¯ T ω , i.e. T − = T + ◮ So T = U ( n )

  54. Class D: Σ with β = + 1 ◮ Basis (normal form): Σ V = V ω (or V = − (Σ V ) ω ) ◮ Concretely: Σ = K , so ¯ V = V ω ◮ So B = { V | V unitary , ¯ V = V ω } ◮ det V = det V , hence det V = ± 1. Index Z 2 ? ◮ Change of basis V → VT , T = diag( T + , T − ) . “Is vs. Ought”: ω T = ¯ T ω , i.e. T − = T + ◮ So T = U ( n ) ◮ Index group is G = Z 2

  55. Class C: Σ with β = − 1 ◮ Basis (normal form): Σ V = V ε ◮ Concretely: Σ = ε K , so ε ¯ V = V ε

  56. Class C: Σ with β = − 1 ◮ Basis (normal form): Σ V = V ε ◮ Concretely: Σ = ε K , so ε ¯ V = V ε ◮ So B = { V | V unitary , V ε V T = ε }

  57. Class C: Σ with β = − 1 ◮ Basis (normal form): Σ V = V ε ◮ Concretely: Σ = ε K , so ε ¯ V = V ε ◮ So B = { V | V unitary , V ε V T = ε } ◮ V symplectic, so det V = + 1.

  58. Class C: Σ with β = − 1 ◮ Basis (normal form): Σ V = V ε ◮ Concretely: Σ = ε K , so ε ¯ V = V ε ◮ So B = { V | V unitary , V ε V T = ε } ◮ V symplectic, so det V = + 1. (Use pf( ABA T ) = det A · pf ( B ) )

  59. Class C: Σ with β = − 1 ◮ Basis (normal form): Σ V = V ε ◮ Concretely: Σ = ε K , so ε ¯ V = V ε ◮ So B = { V | V unitary , V ε V T = ε } ◮ V symplectic, so det V = + 1. (Use pf( ABA T ) = det A · pf ( B ) ) ◮ Change of basis V → VT , T = diag( T + , T − ) .

  60. Class C: Σ with β = − 1 ◮ Basis (normal form): Σ V = V ε ◮ Concretely: Σ = ε K , so ε ¯ V = V ε ◮ So B = { V | V unitary , V ε V T = ε } ◮ V symplectic, so det V = + 1. (Use pf( ABA T ) = det A · pf ( B ) ) ◮ Change of basis V → VT , T = diag( T + , T − ) . “Is vs. Ought”: ε T = T ε , i.e. T − = T +

  61. Class C: Σ with β = − 1 ◮ Basis (normal form): Σ V = V ε ◮ Concretely: Σ = ε K , so ε ¯ V = V ε ◮ So B = { V | V unitary , V ε V T = ε } ◮ V symplectic, so det V = + 1. (Use pf( ABA T ) = det A · pf ( B ) ) ◮ Change of basis V → VT , T = diag( T + , T − ) . “Is vs. Ought”: ε T = T ε , i.e. T − = T + ◮ So T = U ( n )

  62. Class C: Σ with β = − 1 ◮ Basis (normal form): Σ V = V ε ◮ Concretely: Σ = ε K , so ε ¯ V = V ε ◮ So B = { V | V unitary , V ε V T = ε } ◮ V symplectic, so det V = + 1. (Use pf( ABA T ) = det A · pf ( B ) ) ◮ Change of basis V → VT , T = diag( T + , T − ) . “Is vs. Ought”: ε T = T ε , i.e. T − = T + ◮ So T = U ( n ) ◮ Index group is G = 0.

  63. Classes involving Π (AIII, BDI, CI, DIII, CII) An alternate procedure is available. Recall bases adapted to Θ or Σ (but not to Π = ΘΣ ).

  64. Classes involving Π (AIII, BDI, CI, DIII, CII) An alternate procedure is available. Recall bases adapted to Θ or Σ (but not to Π = ΘΣ ). Change to a basis adapted to Π (or i Π ): � 1 0 � Π = , ( 1 = 1 n , 1 2 n ) 0 − 1 Let K be complex conjugation in that basis (thus real).

  65. Classes involving Π (AIII, BDI, CI, DIII, CII) An alternate procedure is available. Recall bases adapted to Θ or Σ (but not to Π = ΘΣ ). Change to a basis adapted to Π (or i Π ): � 1 0 � Π = , ( 1 = 1 n , 1 2 n ) 0 − 1 Let K be complex conjugation in that basis (thus real). In presence of Θ or Σ (and hence all three with α, β = ± 1):

  66. Classes involving Π (AIII, BDI, CI, DIII, CII) An alternate procedure is available. Recall bases adapted to Θ or Σ (but not to Π = ΘΣ ). Change to a basis adapted to Π (or i Π ): � 1 0 � Π = , ( 1 = 1 n , 1 2 n ) 0 − 1 Let K be complex conjugation in that basis (thus real). In presence of Θ or Σ (and hence all three with α, β = ± 1): ◮ α = + 1 ( N = 2 n )

  67. Classes involving Π (AIII, BDI, CI, DIII, CII) An alternate procedure is available. Recall bases adapted to Θ or Σ (but not to Π = ΘΣ ). Change to a basis adapted to Π (or i Π ): � 1 0 � Π = , ( 1 = 1 n , 1 2 n ) 0 − 1 Let K be complex conjugation in that basis (thus real). In presence of Θ or Σ (and hence all three with α, β = ± 1): ◮ α = + 1 ( N = 2 n ) � 1 0 ◮ β = + 1: Θ = � K 0 1

  68. Classes involving Π (AIII, BDI, CI, DIII, CII) An alternate procedure is available. Recall bases adapted to Θ or Σ (but not to Π = ΘΣ ). Change to a basis adapted to Π (or i Π ): � 1 0 � Π = , ( 1 = 1 n , 1 2 n ) 0 − 1 Let K be complex conjugation in that basis (thus real). In presence of Θ or Σ (and hence all three with α, β = ± 1): ◮ α = + 1 ( N = 2 n ) � 1 0 ◮ β = + 1: Θ = � K 0 1 � 0 1 ◮ β = − 1: Θ = � K 1 0

  69. Classes involving Π (AIII, BDI, CI, DIII, CII) An alternate procedure is available. Recall bases adapted to Θ or Σ (but not to Π = ΘΣ ). Change to a basis adapted to Π (or i Π ): � 1 0 � Π = , ( 1 = 1 n , 1 2 n ) 0 − 1 Let K be complex conjugation in that basis (thus real). In presence of Θ or Σ (and hence all three with α, β = ± 1): ◮ α = + 1 ( N = 2 n ) � 1 0 ◮ β = + 1: Θ = � K 0 1 � 0 1 ◮ β = − 1: Θ = � K 1 0 ◮ α = − 1 ( N = 4 n )

  70. Classes involving Π (AIII, BDI, CI, DIII, CII) An alternate procedure is available. Recall bases adapted to Θ or Σ (but not to Π = ΘΣ ). Change to a basis adapted to Π (or i Π ): � 1 0 � Π = , ( 1 = 1 n , 1 2 n ) 0 − 1 Let K be complex conjugation in that basis (thus real). In presence of Θ or Σ (and hence all three with α, β = ± 1): ◮ α = + 1 ( N = 2 n ) � 1 0 ◮ β = + 1: Θ = � K 0 1 � 0 1 ◮ β = − 1: Θ = � K 1 0 ◮ α = − 1 ( N = 4 n ) � 0 ε ◮ β = + 1: Θ = � K ε 0

  71. Classes involving Π (AIII, BDI, CI, DIII, CII) An alternate procedure is available. Recall bases adapted to Θ or Σ (but not to Π = ΘΣ ). Change to a basis adapted to Π (or i Π ): � 1 0 � Π = , ( 1 = 1 n , 1 2 n ) 0 − 1 Let K be complex conjugation in that basis (thus real). In presence of Θ or Σ (and hence all three with α, β = ± 1): ◮ α = + 1 ( N = 2 n ) � 1 0 ◮ β = + 1: Θ = � K 0 1 � 0 1 ◮ β = − 1: Θ = � K 1 0 ◮ α = − 1 ( N = 4 n ) � 0 ε ◮ β = + 1: Θ = � K ε 0 � ε 0 ◮ β = − 1: Θ = � K 0 ε ( ε composite as a rule)

  72. The classification task involving Π Setting: Vector space V = V + ⊕ V − ,

  73. The classification task involving Π Setting: Vector space V = V + ⊕ V − , split encoded in projections P ± onto V ± (hence Π P ± = P ∓ Π ),

  74. The classification task involving Π Setting: Vector space V = V + ⊕ V − , split encoded in projections P ± onto V ± (hence Π P ± = P ∓ Π ), or in ”flattened Hamiltonian” H = H ∗ = P + − P − , H 2 = 1 hence with { H , Π } = 0

  75. The classification task involving Π Setting: Vector space V = V + ⊕ V − , split encoded in projections P ± onto V ± (hence Π P ± = P ∓ Π ), or in ”flattened Hamiltonian” H = H ∗ = P + − P − , H 2 = 1 hence with { H , Π } = 0 � 1 0 � Equivalently (recall Π = in adapted basis) 0 − 1 � 0 U ∗ � H = , U ∈ U ( n ) , U ( 2 n ) U 0

  76. The classification task involving Π Setting: Vector space V = V + ⊕ V − , split encoded in projections P ± onto V ± (hence Π P ± = P ∓ Π ), or in ”flattened Hamiltonian” H = H ∗ = P + − P − , H 2 = 1 hence with { H , Π } = 0 � 1 0 � Equivalently (recall Π = in adapted basis) 0 − 1 � 0 U ∗ � H = , U ∈ U ( n ) , U ( 2 n ) U 0 If further symmetries: [ H , Θ] = 0.

  77. Aside: Normal form of matrices ◮ (Takagi) Every complex symmetric matrix A = A T is of the form A = UNU T with U unitary and N = N T diagonal.

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