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

a partial discussion of the kitaev table
SMART_READER_LITE
LIVE PREVIEW

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


slide-1
SLIDE 1

A (partial) discussion of the Kitaev table

Gian Michele Graf, ETH Zurich PhD School: September 16-20, 2019 @Universit` a degli Studi Roma Tre

slide-2
SLIDE 2

A (partial) discussion of the Kitaev table

Gian Michele Graf, ETH Zurich PhD School: September 16-20, 2019 @Universit` a degli Studi Roma Tre

based on discussions with J. Haag, B. Roos

slide-3
SLIDE 3

Outline

slide-4
SLIDE 4

The periodic table of topological matter

Symmetry d Class Θ Σ Π 1 2 3 4 5 6 7 8 A Z Z Z Z AIII 1 Z Z Z Z AI 1 Z Z2 Z2 Z BDI 1 1 1 Z Z Z2 Z2 D 1 Z2 Z Z Z2 DIII

  • 1

1 1 Z2 Z2 Z Z AII

  • 1

Z2 Z2 Z Z CII

  • 1
  • 1

1 Z Z2 Z2 Z C

  • 1

Z Z2 Z2 Z CI 1

  • 1

1 Z Z2 Z2 Z Notation for symmetries: ◮ Θ (time-reversal): antiunitary, HΘ = ΘH, Θ2 = ±1 ◮ Σ (charge-conjugation): antiunitary, HΣ = −ΣH, Σ2 = ±1 ◮ Π = ΘΣ = ΣΘ: unitary

slide-5
SLIDE 5

The periodic table of topological matter

Symmetry d Class Θ Σ Π 1 2 3 4 5 6 7 8 A Z Z Z Z AIII 1 Z Z Z Z AI 1 Z Z2 Z2 Z BDI 1 1 1 Z Z Z2 Z2 D 1 Z2 Z Z Z2 DIII

  • 1

1 1 Z2 Z2 Z Z AII

  • 1

Z2 Z2 Z Z CII

  • 1
  • 1

1 Z Z2 Z2 Z C

  • 1

Z Z2 Z2 Z CI 1

  • 1

1 Z Z2 Z2 Z First version: Schnyder et al.; then Kitaev based on Altland-Zirnbauer; based on Bloch theory

slide-6
SLIDE 6

The periodic table of topological matter

Symmetry d Class Θ Σ Π 1 2 3 4 5 6 7 8 A Z Z Z Z AIII 1 Z Z Z Z AI 1 Z Z2 Z2 Z BDI 1 1 1 Z Z Z2 Z2 D 1 Z2 Z Z Z2 DIII

  • 1

1 1 Z2 Z2 Z Z AII

  • 1

Z2 Z2 Z Z CII

  • 1
  • 1

1 Z Z2 Z2 Z C

  • 1

Z Z2 Z2 Z CI 1

  • 1

1 Z Z2 Z2 Z By now: Non-commutative (bulk) index formulae have been found in all cases (Prodan, Schulz-Baldes)

slide-7
SLIDE 7

Basic symmetries

V: complex Euclidean vector space Symmetries: (anti-)unitary maps U : V → V (names conventional)

  • 1. Time-reversal Θ : V → V antiunitary, Θ2 =: α = ±1

If V = V+ ⊕ V−:

  • 2. Particle-hole Σ : V± → V∓ antiunitary, Σ2 =: β = ±1
  • 3. Chiral symmetry Π : V± → V∓ unitary
  • Remarks. 1) Let U : V → V with U2 = γ; consider ˜

U := cU with c ∈ C, |c| = 1 to be chosen. Then ◮ U unitary: ˜ U2 = c2γ. W.l.o.g. γ arbitrary. ◮ U antiunitary: By U2U = UU2 we have γ = ¯ γ, i.e. γ = ±1. Intrinsic γ: ˜ U2 = |c|2γ = γ 2) For items 2, 3: dim V+ = dim V−. 3) Σ qualifies as Θ, so far.

slide-8
SLIDE 8

Combination of symmetries

V = V+ ⊕ V− 1’. Θ : V± → V±

slide-9
SLIDE 9

Combination of symmetries

V = V+ ⊕ V− 1’. Θ : V± → V± (item 1’ generalizes 1 through V+ = V, V− = {0})

slide-10
SLIDE 10

Combination of symmetries

V = V+ ⊕ V− 1’. Θ : V± → V±

  • 2. Σ : V± → V∓
  • 3. Π : V± → V∓
slide-11
SLIDE 11

Combination of symmetries

V = V+ ⊕ V− 1’. Θ : V± → V±

  • 2. Σ : V± → V∓
  • 3. Π : V± → V∓

Let Π = ΘΣ , [Θ, Σ] = 0 Then any two symmetries imply the third; moreover Π2 = αβ = ±1

  • Remarks. 1) Σ = Θ (flip/no flip)

2) Π = Σ, Θ (unitary/antiunitary) 3) Possible combinations (none, one, three): 1 + 5 + 4 = 10 symmetry classes

slide-12
SLIDE 12

The classification

◮ Each entry of the table shows a group G = 0, Z, Z2 (index group) ◮ Vector bundles over Td (torus) of a given symmetry class (“topological insulators”) are assigned an index I ∈ G ◮ If two of them (with indices I, I′) are homotopy equivalent (within the class), then I = I′ (strong index). ◮ However, this is true only if their restrictions to all tori Td′ ⊂ Td, (d′ < d) are homotopy equivalent (weak indices). ◮ However, also non homotopy equivalent bundles may have I = I′, if they are so upon addition of trivial ones (stably homotopic → K-theory)

slide-13
SLIDE 13

The K-theoretic point of view

Example: Integers k ∈ Z may be identified with pairs (n+, n−) ∈ N2 of naturals, up to equivalence (n′

+, n′ −) ∼ (n′′ +, n′′ −) defined by

(n′

+ + ˜

n, n′

− + ˜

n) = (n′′

+ + ˜

˜ n, n′′

− + ˜

˜ n) for some ˜ n, ˜ ˜ n ∈ N.

slide-14
SLIDE 14

The K-theoretic point of view

Example: Integers k ∈ Z may be identified with pairs (n+, n−) ∈ N2 of naturals, up to equivalence (n′

+, n′ −) ∼ (n′′ +, n′′ −) defined by

(n′

+ + ˜

n, n′

− + ˜

n) = (n′′

+ + ˜

˜ n, n′′

− + ˜

˜ n) for some ˜ n, ˜ ˜ n ∈ N. Idea: k = n+ − n−

slide-15
SLIDE 15

The K-theoretic point of view

Example: Integers k ∈ Z may be identified with pairs (n+, n−) ∈ N2 of naturals, up to equivalence (n′

+, n′ −) ∼ (n′′ +, n′′ −) defined by

(n′

+ + ˜

n, n′

− + ˜

n) = (n′′

+ + ˜

˜ n, n′′

− + ˜

˜ n) for some ˜ n, ˜ ˜ n ∈ N. Idea: k = n+ − n− Here: Pairs of vector spaces V = (V+, V−) instead of V = V+ ⊕ V−.

slide-16
SLIDE 16

The K-theoretic point of view

Example: Integers k ∈ Z may be identified with pairs (n+, n−) ∈ N2 of naturals, up to equivalence (n′

+, n′ −) ∼ (n′′ +, n′′ −) defined by

(n′

+ + ˜

n, n′

− + ˜

n) = (n′′

+ + ˜

˜ n, n′′

− + ˜

˜ n) for some ˜ n, ˜ ˜ n ∈ N. Idea: k = n+ − n− Here: Pairs of vector spaces V = (V+, V−) instead of V = V+ ⊕ V−. Say V ′ ∼ V ′′ if (V ′

+ ⊕ ˜

V, V ′

− ⊕ ˜

V) ∼ = (V ′′

+ ⊕ ˜

˜ V, V ′′

− ⊕ ˜

˜ V) (homotopy).

slide-17
SLIDE 17

The K-theoretic point of view

Example: Integers k ∈ Z may be identified with pairs (n+, n−) ∈ N2 of naturals, up to equivalence (n′

+, n′ −) ∼ (n′′ +, n′′ −) defined by

(n′

+ + ˜

n, n′

− + ˜

n) = (n′′

+ + ˜

˜ n, n′′

− + ˜

˜ n) for some ˜ n, ˜ ˜ n ∈ N. Idea: k = n+ − n− Here: Pairs of vector spaces V = (V+, V−) instead of V = V+ ⊕ V−. Say V ′ ∼ V ′′ if (V ′

+ ⊕ ˜

V, V ′

− ⊕ ˜

V) ∼ = (V ′′

+ ⊕ ˜

˜ V, V ′′

− ⊕ ˜

˜ V) (homotopy). In case of symmetry U = Θ, Σ, Π, the map U : V± → V±/∓ is augmented to U ⊕ ˜ U with ˜ U : ˜ V → ˜ V, ˜ U2 = ±1

  • Remarks. 1) Dimension redefined (only here):

dim V = dim V+ − dim V− 2) If Σ, Π are symmetries, dim V = 0. 3) Notions extended to vector bundles

slide-18
SLIDE 18

The derivation of the table

One more column d = 0: Vector bundles over a point ≡ vector spaces Symmetry d Class Θ Σ Π A Z AIII 1 AI 1 Z BDI 1 1 1 Z2 D 1 Z2 DIII

  • 1

1 1 AII

  • 1

Z CII

  • 1
  • 1

1 C

  • 1

CI 1

  • 1

1 (Same as claimed for d = 8).

slide-19
SLIDE 19

The derivation of the table

One more column d = 0: Vector bundles over a point ≡ vector spaces Symmetry d Class Θ Σ Π A Z AIII 1 AI 1 Z BDI 1 1 1 Z2 D 1 Z2 DIII

  • 1

1 1 AII

  • 1

Z CII

  • 1
  • 1

1 C

  • 1

CI 1

  • 1

1 (Same as claimed for d = 8). We’ll derive it.

slide-20
SLIDE 20

Normal forms of lone symmetries

Let ε = 0 −1

1 0

  • ,

ω = i 0 1

1 0

  • det ε = det ω = 1

We’ll see: Depending on classes, N := dim V = n, 2n, 4n, (n = 1, 2, . . .). We’ll construct adapted orthonormal bases V = (vj)k

j=1 = (v1, . . . , vk)

  • f invariant subspaces of V of dimension k = 1, 2, 4; generated by

arbitrary v1, (v1 = 1).

slide-21
SLIDE 21

Normal forms of lone symmetries

Let ε = 0 −1

1 0

  • ,

ω = i 0 1

1 0

  • det ε = det ω = 1

We’ll see: Depending on classes, N := dim V = n, 2n, 4n, (n = 1, 2, . . .). We’ll construct adapted orthonormal bases V = (vj)k

j=1 = (v1, . . . , vk)

  • f invariant subspaces of V of dimension k = 1, 2, 4; generated by

arbitrary v1, (v1 = 1). Exhaust the complement.

slide-22
SLIDE 22

Normal forms of lone symmetries

Let ε = 0 −1

1 0

  • ,

ω = i 0 1

1 0

  • det ε = det ω = 1

We’ll see: Depending on classes, N := dim V = n, 2n, 4n, (n = 1, 2, . . .). We’ll construct adapted orthonormal bases V = (vj)k

j=1 = (v1, . . . , vk)

  • f invariant subspaces of V of dimension k = 1, 2, 4; generated by

arbitrary v1, (v1 = 1). Exhaust the complement. Left action: UV = (Uv1, . . . , Uvk) (U : V → V map) Right action: VM = (

i viMij)k j=1 (M: matrix of order k)

slide-23
SLIDE 23

Normal forms of lone symmetries

Let ε = 0 −1

1 0

  • ,

ω = i 0 1

1 0

  • det ε = det ω = 1

We’ll see: Depending on classes, N := dim V = n, 2n, 4n, (n = 1, 2, . . .). We’ll construct adapted orthonormal bases V = (vj)k

j=1 = (v1, . . . , vk)

  • f invariant subspaces of V of dimension k = 1, 2, 4; generated by

arbitrary v1, (v1 = 1). Exhaust the complement. Left action: UV = (Uv1, . . . , Uvk) (U : V → V map) Right action: VM = (

i viMij)k j=1 (M: matrix of order k)

◮ Θ (α = +1) has k = 1:

slide-24
SLIDE 24

Normal forms of lone symmetries

Let ε = 0 −1

1 0

  • ,

ω = i 0 1

1 0

  • det ε = det ω = 1

We’ll see: Depending on classes, N := dim V = n, 2n, 4n, (n = 1, 2, . . .). We’ll construct adapted orthonormal bases V = (vj)k

j=1 = (v1, . . . , vk)

  • f invariant subspaces of V of dimension k = 1, 2, 4; generated by

arbitrary v1, (v1 = 1). Exhaust the complement. Left action: UV = (Uv1, . . . , Uvk) (U : V → V map) Right action: VM = (

i viMij)k j=1 (M: matrix of order k)

◮ Θ (α = +1) has k = 1: v1 such that Θv1 = v1,

slide-25
SLIDE 25

Normal forms of lone symmetries

Let ε = 0 −1

1 0

  • ,

ω = i 0 1

1 0

  • det ε = det ω = 1

We’ll see: Depending on classes, N := dim V = n, 2n, 4n, (n = 1, 2, . . .). We’ll construct adapted orthonormal bases V = (vj)k

j=1 = (v1, . . . , vk)

  • f invariant subspaces of V of dimension k = 1, 2, 4; generated by

arbitrary v1, (v1 = 1). Exhaust the complement. Left action: UV = (Uv1, . . . , Uvk) (U : V → V map) Right action: VM = (

i viMij)k j=1 (M: matrix of order k)

◮ Θ (α = +1) has k = 1: v1 such that Θv1 = v1, i.e. ΘV = V

slide-26
SLIDE 26

Normal forms of lone symmetries

Let ε = 0 −1

1 0

  • ,

ω = i 0 1

1 0

  • det ε = det ω = 1

We’ll see: Depending on classes, N := dim V = n, 2n, 4n, (n = 1, 2, . . .). We’ll construct adapted orthonormal bases V = (vj)k

j=1 = (v1, . . . , vk)

  • f invariant subspaces of V of dimension k = 1, 2, 4; generated by

arbitrary v1, (v1 = 1). Exhaust the complement. Left action: UV = (Uv1, . . . , Uvk) (U : V → V map) Right action: VM = (

i viMij)k j=1 (M: matrix of order k)

◮ Θ (α = +1) has k = 1: v1 such that Θv1 = v1, i.e. ΘV = V ◮ Θ (α = −1) has k = 2:

slide-27
SLIDE 27

Normal forms of lone symmetries

Let ε = 0 −1

1 0

  • ,

ω = i 0 1

1 0

  • det ε = det ω = 1

We’ll see: Depending on classes, N := dim V = n, 2n, 4n, (n = 1, 2, . . .). We’ll construct adapted orthonormal bases V = (vj)k

j=1 = (v1, . . . , vk)

  • f invariant subspaces of V of dimension k = 1, 2, 4; generated by

arbitrary v1, (v1 = 1). Exhaust the complement. Left action: UV = (Uv1, . . . , Uvk) (U : V → V map) Right action: VM = (

i viMij)k j=1 (M: matrix of order k)

◮ Θ (α = +1) has k = 1: v1 such that Θv1 = v1, i.e. ΘV = V ◮ Θ (α = −1) has k = 2: v2 := Θv1, Θv2 = −v1; then ΘV = (Θv1, Θv2) = (v2, −v1) = Vε

slide-28
SLIDE 28

Normal forms of lone symmetries (cont.)

◮ Σ (β = +1) has k = 2:

slide-29
SLIDE 29

Normal forms of lone symmetries (cont.)

◮ Σ (β = +1) has k = 2: v1 ∈ V+, v2 := −iΣv1 ∈ V−; then ΣV = (iv2, iv1) = Vω

slide-30
SLIDE 30

Normal forms of lone symmetries (cont.)

◮ Σ (β = +1) has k = 2: v1 ∈ V+, v2 := −iΣv1 ∈ V−; then ΣV = (iv2, iv1) = Vω ◮ Σ (β = −1) has k = 2:

slide-31
SLIDE 31

Normal forms of lone symmetries (cont.)

◮ Σ (β = +1) has k = 2: v1 ∈ V+, v2 := −iΣv1 ∈ V−; then ΣV = (iv2, iv1) = Vω ◮ Σ (β = −1) has k = 2: v1 ∈ V+, v2 := Σv1 ∈ V−; then ΣV = (v2, −v1) = Vε

slide-32
SLIDE 32

Normal forms of lone symmetries (cont.)

◮ Σ (β = +1) has k = 2: v1 ∈ V+, v2 := −iΣv1 ∈ V−; then ΣV = (iv2, iv1) = Vω ◮ Σ (β = −1) has k = 2: v1 ∈ V+, v2 := Σv1 ∈ V−; then ΣV = (v2, −v1) = Vε ◮ Π (γ = −1 w.l.o.g.) has k = 2:

slide-33
SLIDE 33

Normal forms of lone symmetries (cont.)

◮ Σ (β = +1) has k = 2: v1 ∈ V+, v2 := −iΣv1 ∈ V−; then ΣV = (iv2, iv1) = Vω ◮ Σ (β = −1) has k = 2: v1 ∈ V+, v2 := Σv1 ∈ V−; then ΣV = (v2, −v1) = Vε ◮ Π (γ = −1 w.l.o.g.) has k = 2: v1 ∈ V+, v2 := −iΠv1 ∈ V−; then ΠV = (iv2, iv1) = Vω

slide-34
SLIDE 34

Normal forms of combined symmetries Θ, Σ

◮ α = +1, β = ±1 has k = 2: ΘV = V , ΣV = V

  • ω

(β = +1) ε (β = −1)

slide-35
SLIDE 35

Normal forms of combined symmetries Θ, Σ

◮ α = +1, β = ±1 has k = 2: ΘV = V , ΣV = V

  • ω

(β = +1) ε (β = −1) ◮ α = −1, β = ±1 has k = 4: ΘV = V ε 0

0 ε

  • ,

ΣV = V

  • 0 β12

12

slide-36
SLIDE 36

The identification V ∼ = CN

Let K : CN → CN be the standard complex conjugation

slide-37
SLIDE 37

The identification V ∼ = CN

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

slide-38
SLIDE 38

The identification V ∼ = CN

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

  • Remarks. 1) Note that Σ qualifies as Θ (see earlier remark)
slide-39
SLIDE 39

The identification V ∼ = CN

Let K : CN → CN be the standard complex conjugation Claim: Lone symmetries U = Θ, Σ (U2 = γ = ±1; γ = α or β, hence 2 + 2 cases) on V can be brought to the following form on CN ◮ γ = +1 (N = n, 2n): U = K ◮ γ = −1 (N = 2n): 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, ±iv) | v ∈ Cn} ⊂ Cn ⊕ Cn = CN , (or flipped)

slide-40
SLIDE 40

The identification V ∼ = CN

Let K : CN → CN be the standard complex conjugation Claim: Lone symmetries U = Θ, Σ (U2 = γ = ±1; γ = α or β, hence 2 + 2 cases) on V can be brought to the following form on CN ◮ γ = +1 (N = n, 2n): U = K ◮ γ = −1 (N = 2n): 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, ±iv) | v ∈ Cn} ⊂ Cn ⊕ Cn = CN , (or flipped) 3) Proof: ◮ In the cases α = ±1, the claim is seen by mapping an adapted basis V to the standard basis of CN

slide-41
SLIDE 41

The identification V ∼ = CN

Let K : CN → CN be the standard complex conjugation Claim: Lone symmetries U = Θ, Σ (U2 = γ = ±1; γ = α or β, hence 2 + 2 cases) on V can be brought to the following form on CN ◮ γ = +1 (N = n, 2n): U = K ◮ γ = −1 (N = 2n): 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, ±iv) | v ∈ Cn} ⊂ Cn ⊕ Cn = CN , (or flipped) 3) Proof: ◮ In the cases α = ±1, the claim is seen by mapping an adapted basis V to the standard basis of CN ◮ In the cases β = ±1 the mapping is (e.g.) v1 → 1

i

  • ,

v2 → −iβ 1

−i

  • , compatibly with the stated V± (unflipped)
slide-42
SLIDE 42

The identification V ∼ = CN

Let K : CN → CN be the standard complex conjugation Claim: Lone symmetries U = Θ, Σ (U2 = γ = ±1; γ = α or β, hence 2 + 2 cases) on V can be brought to the following form on CN ◮ γ = +1 (N = n, 2n): U = K ◮ γ = −1 (N = 2n): 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, ±iv) | v ∈ Cn} ⊂ Cn ⊕ Cn = CN , (or flipped) 3) Proof: ◮ In the cases α = ±1, the claim is seen by mapping an adapted basis V to the standard basis of CN ◮ In the cases β = ±1 the mapping is (e.g.) v1 → 1

i

  • ,

v2 → −iβ 1

−i

  • , compatibly with the stated V± (unflipped)

4) This foreshadows: The lone symmetry Θ will not contribute to G (to be checked).

slide-43
SLIDE 43

The classification task in general

Any (symmetry equipped) vector space V can be identified with CN (symmetry equipped as explained).

slide-44
SLIDE 44

The classification task in general

Any (symmetry equipped) vector space V can be identified with CN (symmetry equipped as explained). However this does not imply that any two of them are homotopic, as the identifications might be non homotopic.

slide-45
SLIDE 45

The classification task in general

Any (symmetry equipped) vector space V can be identified with CN (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 CN, the setting and the task become ◮ Bases (unrestricted) are matrices V ∈ U(N) (unitary group as a set)

slide-46
SLIDE 46

The classification task in general

Any (symmetry equipped) vector space V can be identified with CN (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 CN, 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

slide-47
SLIDE 47

The classification task in general

Any (symmetry equipped) vector space V can be identified with CN (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 CN, 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}

slide-48
SLIDE 48

The classification task in general

Any (symmetry equipped) vector space V can be identified with CN (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 CN, 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}

slide-49
SLIDE 49

The classification task in general

Any (symmetry equipped) vector space V can be identified with CN (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 CN, 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.

slide-50
SLIDE 50

Class A: no symmetry

B = U(N), T = U(N), hence B/T trivial.

slide-51
SLIDE 51

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

slide-52
SLIDE 52

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)

slide-53
SLIDE 53

Class AI: Θ with α = +1

◮ Basis (normal form): V = ΘV

slide-54
SLIDE 54

Class AI: Θ with α = +1

◮ Basis (normal form): V = ΘV ◮ Concretely: Θ = K, so V = ¯ V

slide-55
SLIDE 55

Class AI: Θ with α = +1

◮ Basis (normal form): V = ΘV ◮ Concretely: Θ = K, so V = ¯ V ◮ So: B = O(N). Index Z2 by det V = ±1?

slide-56
SLIDE 56

Class AI: Θ with α = +1

◮ Basis (normal form): V = ΘV ◮ Concretely: Θ = K, so V = ¯ V ◮ So: B = O(N). Index Z2 by det V = ±1? ◮ Change of basis V → VT.

slide-57
SLIDE 57

Class AI: Θ with α = +1

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

slide-58
SLIDE 58

Class AI: Θ with α = +1

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

slide-59
SLIDE 59

Class AI: Θ with α = +1

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

slide-60
SLIDE 60

Class AI: Θ with α = +1

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

slide-61
SLIDE 61

Class AI: Θ with α = +1

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

slide-62
SLIDE 62

Class AII: Θ with α = −1

◮ Basis (normal form): ΘV = Vε (or V = −ΘVε)

slide-63
SLIDE 63

Class AII: Θ with α = −1

◮ Basis (normal form): ΘV = Vε (or V = −ΘVε) ◮ Concretely: Θ = εK, so ε ¯ V = Vε

slide-64
SLIDE 64

Class AII: Θ with α = −1

◮ Basis (normal form): ΘV = Vε (or V = −ΘVε) ◮ Concretely: Θ = εK, so ε ¯ V = Vε ◮ So B = {V | V unitary, ε¯ V = Vε}

slide-65
SLIDE 65

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.

slide-66
SLIDE 66

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 = −(ΘVε)T , VT = −Θ(VT)ε = −(ΘV)¯ Tε

slide-67
SLIDE 67

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 = −(ΘVε)T , VT = −Θ(VT)ε = −(ΘV)¯ Tε ◮ So εT = ¯ Tε,

slide-68
SLIDE 68

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 = −(ΘVε)T , VT = −Θ(VT)ε = −(ΘV)¯ Tε ◮ So εT = ¯ Tε, T = B and B/T is trivial

slide-69
SLIDE 69

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 = −(ΘVε)T , VT = −Θ(VT)ε = −(ΘV)¯ Tε ◮ So εT = ¯ Tε, T = B and B/T is trivial ◮ Index group remains G = Z

slide-70
SLIDE 70

Class D: Σ with β = +1

◮ Basis (normal form): ΣV = Vω (or V = −(ΣV)ω)

slide-71
SLIDE 71

Class D: Σ with β = +1

◮ Basis (normal form): ΣV = Vω (or V = −(ΣV)ω) ◮ Concretely: Σ = K, so ¯ V = Vω

slide-72
SLIDE 72

Class D: Σ with β = +1

◮ Basis (normal form): ΣV = Vω (or V = −(ΣV)ω) ◮ Concretely: Σ = K, so ¯ V = Vω ◮ So B = {V | V unitary, ¯ V = Vω}

slide-73
SLIDE 73

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 Z2?

slide-74
SLIDE 74

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 Z2? ◮ Change of basis V → VT, T = diag(T+, T−).

slide-75
SLIDE 75

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 Z2? ◮ Change of basis V → VT, T = diag(T+, T−). “Is vs. Ought”: ωT = ¯ Tω , i.e. T− = T+

slide-76
SLIDE 76

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 Z2? ◮ Change of basis V → VT, T = diag(T+, T−). “Is vs. Ought”: ωT = ¯ Tω , i.e. T− = T+ ◮ So T = U(n)

slide-77
SLIDE 77

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 Z2? ◮ 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 = Z2

slide-78
SLIDE 78

Class C: Σ with β = −1

◮ Basis (normal form): ΣV = Vε ◮ Concretely: Σ = εK, so ε ¯ V = Vε

slide-79
SLIDE 79

Class C: Σ with β = −1

◮ Basis (normal form): ΣV = Vε ◮ Concretely: Σ = εK, so ε ¯ V = Vε ◮ So B = {V | V unitary, VεV T = ε}

slide-80
SLIDE 80

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.

slide-81
SLIDE 81

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(ABAT) = det A · pf(B))

slide-82
SLIDE 82

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(ABAT) = det A · pf(B)) ◮ Change of basis V → VT, T = diag(T+, T−).

slide-83
SLIDE 83

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(ABAT) = det A · pf(B)) ◮ Change of basis V → VT, T = diag(T+, T−). “Is vs. Ought”: εT = Tε , i.e. T− = T+

slide-84
SLIDE 84

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(ABAT) = 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)

slide-85
SLIDE 85

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(ABAT) = 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.

slide-86
SLIDE 86

Classes involving Π (AIII, BDI, CI, DIII, CII)

An alternate procedure is available. Recall bases adapted to Θ or Σ (but not to Π = ΘΣ).

slide-87
SLIDE 87

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

0 −1

  • ,

(1 = 1n, 12n) Let K be complex conjugation in that basis (thus real).

slide-88
SLIDE 88

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

0 −1

  • ,

(1 = 1n, 12n) Let K be complex conjugation in that basis (thus real). In presence of Θ or Σ (and hence all three with α, β = ±1):

slide-89
SLIDE 89

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

0 −1

  • ,

(1 = 1n, 12n) Let K be complex conjugation in that basis (thus real). In presence of Θ or Σ (and hence all three with α, β = ±1): ◮ α = +1 (N = 2n)

slide-90
SLIDE 90

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

0 −1

  • ,

(1 = 1n, 12n) Let K be complex conjugation in that basis (thus real). In presence of Θ or Σ (and hence all three with α, β = ±1): ◮ α = +1 (N = 2n)

◮ β = +1: Θ = 1 0

0 1

  • K
slide-91
SLIDE 91

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

0 −1

  • ,

(1 = 1n, 12n) Let K be complex conjugation in that basis (thus real). In presence of Θ or Σ (and hence all three with α, β = ±1): ◮ α = +1 (N = 2n)

◮ β = +1: Θ = 1 0

0 1

  • K

◮ β = −1: Θ = 0 1

1 0

  • K
slide-92
SLIDE 92

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

0 −1

  • ,

(1 = 1n, 12n) Let K be complex conjugation in that basis (thus real). In presence of Θ or Σ (and hence all three with α, β = ±1): ◮ α = +1 (N = 2n)

◮ β = +1: Θ = 1 0

0 1

  • K

◮ β = −1: Θ = 0 1

1 0

  • K

◮ α = −1 (N = 4n)

slide-93
SLIDE 93

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

0 −1

  • ,

(1 = 1n, 12n) Let K be complex conjugation in that basis (thus real). In presence of Θ or Σ (and hence all three with α, β = ±1): ◮ α = +1 (N = 2n)

◮ β = +1: Θ = 1 0

0 1

  • K

◮ β = −1: Θ = 0 1

1 0

  • K

◮ α = −1 (N = 4n)

◮ β = +1: Θ = 0 ε

ε 0

  • K
slide-94
SLIDE 94

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

0 −1

  • ,

(1 = 1n, 12n) Let K be complex conjugation in that basis (thus real). In presence of Θ or Σ (and hence all three with α, β = ±1): ◮ α = +1 (N = 2n)

◮ β = +1: Θ = 1 0

0 1

  • K

◮ β = −1: Θ = 0 1

1 0

  • K

◮ α = −1 (N = 4n)

◮ β = +1: Θ = 0 ε

ε 0

  • K

◮ β = −1: Θ = ε 0

0 ε

  • K

(ε composite as a rule)

slide-95
SLIDE 95

The classification task involving Π

Setting: Vector space V = V+ ⊕ V−,

slide-96
SLIDE 96

The classification task involving Π

Setting: Vector space V = V+ ⊕ V−, split encoded in projections P±

  • nto V± (hence ΠP± = P∓Π),
slide-97
SLIDE 97

The classification task involving Π

Setting: Vector space V = V+ ⊕ V−, split encoded in projections P±

  • nto V± (hence ΠP± = P∓Π), or in ”flattened Hamiltonian”

H = H∗ = P+ − P− , H2 = 1 hence with {H, Π} = 0

slide-98
SLIDE 98

The classification task involving Π

Setting: Vector space V = V+ ⊕ V−, split encoded in projections P±

  • nto V± (hence ΠP± = P∓Π), or in ”flattened Hamiltonian”

H = H∗ = P+ − P− , H2 = 1 hence with {H, Π} = 0 Equivalently (recall Π = 1 0

0 −1

  • in adapted basis)

H = 0 U∗

U

  • ,

U ∈ U(n), U(2n)

slide-99
SLIDE 99

The classification task involving Π

Setting: Vector space V = V+ ⊕ V−, split encoded in projections P±

  • nto V± (hence ΠP± = P∓Π), or in ”flattened Hamiltonian”

H = H∗ = P+ − P− , H2 = 1 hence with {H, Π} = 0 Equivalently (recall Π = 1 0

0 −1

  • in adapted basis)

H = 0 U∗

U

  • ,

U ∈ U(n), U(2n) If further symmetries: [H, Θ] = 0.

slide-100
SLIDE 100

Aside: Normal form of matrices

◮ (Takagi) Every complex symmetric matrix A = AT is of the form A = UNUT with U unitary and N = NT diagonal.

slide-101
SLIDE 101

Aside: Normal form of matrices

◮ (Takagi) Every complex symmetric matrix A = AT is of the form A = UNUT with U unitary and N = NT diagonal.

◮ Obviously conversely

slide-102
SLIDE 102

Aside: Normal form of matrices

◮ (Takagi) Every complex symmetric matrix A = AT is of the form A = UNUT with U unitary and N = NT diagonal.

◮ Obviously conversely ◮ The set of such matrices is connected

slide-103
SLIDE 103

Aside: Normal form of matrices

◮ (Takagi) Every complex symmetric matrix A = AT is of the form A = UNUT with U unitary and N = NT diagonal.

◮ Obviously conversely ◮ The set of such matrices is connected ◮ So is its subset of unitary matrices.

◮ (Youla) Likewise for complex skew-symmetric matrices A = −AT: Here N = −NT block diagonal with blocks of order 2, i.e. ∝ ε.

slide-104
SLIDE 104

Aside: Normal form of matrices

◮ (Takagi) Every complex symmetric matrix A = AT is of the form A = UNUT with U unitary and N = NT diagonal.

◮ Obviously conversely ◮ The set of such matrices is connected ◮ So is its subset of unitary matrices.

◮ (Youla) Likewise for complex skew-symmetric matrices A = −AT: Here N = −NT block diagonal with blocks of order 2, i.e. ∝ ε. Its subset of unitary matrices is connected (blocks zε with |z| = 1).

slide-105
SLIDE 105

Aside: Normal form of matrices

◮ (Takagi) Every complex symmetric matrix A = AT is of the form A = UNUT with U unitary and N = NT diagonal.

◮ Obviously conversely ◮ The set of such matrices is connected ◮ So is its subset of unitary matrices.

◮ (Youla) Likewise for complex skew-symmetric matrices A = −AT: Here N = −NT block diagonal with blocks of order 2, i.e. ∝ ε. Its subset of unitary matrices is connected (blocks zε with |z| = 1). ◮ The group Sp(2n) of complex symplectic matrices U of order 2n, i.e., UεUT = ε (with composite ε), is connected.

slide-106
SLIDE 106

Aside: Normal form of matrices

◮ (Takagi) Every complex symmetric matrix A = AT is of the form A = UNUT with U unitary and N = NT diagonal.

◮ Obviously conversely ◮ The set of such matrices is connected ◮ So is its subset of unitary matrices.

◮ (Youla) Likewise for complex skew-symmetric matrices A = −AT: Here N = −NT block diagonal with blocks of order 2, i.e. ∝ ε. Its subset of unitary matrices is connected (blocks zε with |z| = 1). ◮ The group Sp(2n) of complex symplectic matrices U of order 2n, i.e., UεUT = ε (with composite ε), is connected. Same for Sp(2n) ∩ U(2n)

slide-107
SLIDE 107

Class AIII: Lone Π

H = 0 U∗

U

  • ,

(U ∈ U(n))

slide-108
SLIDE 108

Class AIII: Lone Π

H = 0 U∗

U

  • ,

(U ∈ U(n)) U(n) is connected, hence index group G = 0.

slide-109
SLIDE 109

Class BDI: α = +1, β = +1

H = 0 U∗

U

  • ,

(U ∈ U(n)) , Θ = 1 0

0 1

  • K

[H, Θ] = 0

slide-110
SLIDE 110

Class BDI: α = +1, β = +1

H = 0 U∗

U

  • ,

(U ∈ U(n)) , Θ = 1 0

0 1

  • K

[H, Θ] = 0 means: U = ¯ U ◮ So U ∈ O(n)

slide-111
SLIDE 111

Class BDI: α = +1, β = +1

H = 0 U∗

U

  • ,

(U ∈ U(n)) , Θ = 1 0

0 1

  • K

[H, Θ] = 0 means: U = ¯ U ◮ So U ∈ O(n) ◮ G = π0(O(n)) = Z2 by det U = ±1

slide-112
SLIDE 112

Class CI: α = +1, β = −1

H = 0 U∗

U

  • ,

(U ∈ U(n)) , Θ = 0 1

1 0

  • K

[H, Θ] = 0

slide-113
SLIDE 113

Class CI: α = +1, β = −1

H = 0 U∗

U

  • ,

(U ∈ U(n)) , Θ = 0 1

1 0

  • K

[H, Θ] = 0 means: U = UT ◮ So U unitary and symmetric:

slide-114
SLIDE 114

Class CI: α = +1, β = −1

H = 0 U∗

U

  • ,

(U ∈ U(n)) , Θ = 0 1

1 0

  • K

[H, Θ] = 0 means: U = UT ◮ So U unitary and symmetric: Connected set. ◮ Hence G = 0

slide-115
SLIDE 115

Class DIII: α = −1, β = +1

H = 0 U∗

U

  • ,

(U ∈ U(2n)) , Θ = 0 ε

ε 0

  • K

[H, Θ] = 0

slide-116
SLIDE 116

Class DIII: α = −1, β = +1

H = 0 U∗

U

  • ,

(U ∈ U(2n)) , Θ = 0 ε

ε 0

  • K

[H, Θ] = 0 means: Uε = εUT

slide-117
SLIDE 117

Class DIII: α = −1, β = +1

H = 0 U∗

U

  • ,

(U ∈ U(2n)) , Θ = 0 ε

ε 0

  • K

[H, Θ] = 0 means: Uε = εUT ◮ For ˜ U := Uε it means ˜ U = −˜ UT

slide-118
SLIDE 118

Class DIII: α = −1, β = +1

H = 0 U∗

U

  • ,

(U ∈ U(2n)) , Θ = 0 ε

ε 0

  • K

[H, Θ] = 0 means: Uε = εUT ◮ For ˜ U := Uε it means ˜ U = −˜ UT ◮ So ˜ U unitary and skew-symmetric:

slide-119
SLIDE 119

Class DIII: α = −1, β = +1

H = 0 U∗

U

  • ,

(U ∈ U(2n)) , Θ = 0 ε

ε 0

  • K

[H, Θ] = 0 means: Uε = εUT ◮ For ˜ U := Uε it means ˜ U = −˜ UT ◮ So ˜ U unitary and skew-symmetric: Connected set. ◮ Hence G = 0

slide-120
SLIDE 120

Class CII: α = −1, β = −1

H = 0 U∗

U

  • ,

(U ∈ U(2n)) , Θ = ε 0

0 ε

  • K

[H, Θ] = 0

slide-121
SLIDE 121

Class CII: α = −1, β = −1

H = 0 U∗

U

  • ,

(U ∈ U(2n)) , Θ = ε 0

0 ε

  • K

[H, Θ] = 0 means: Uε = ε¯ U

slide-122
SLIDE 122

Class CII: α = −1, β = −1

H = 0 U∗

U

  • ,

(U ∈ U(2n)) , Θ = ε 0

0 ε

  • K

[H, Θ] = 0 means: Uε = ε¯ U ◮ So UεUT = ε

slide-123
SLIDE 123

Class CII: α = −1, β = −1

H = 0 U∗

U

  • ,

(U ∈ U(2n)) , Θ = ε 0

0 ε

  • K

[H, Θ] = 0 means: Uε = ε¯ U ◮ So UεUT = ε , i.e. ◮ U ∈ Sp(2n) ∩ U(2n), which is a connected group. ◮ Hence G = 0

slide-124
SLIDE 124

Conclusion

Symmetry d Class Θ Σ Π A Z AIII 1 AI 1 Z BDI 1 1 1 Z2 D 1 Z2 DIII

  • 1

1 1 AII

  • 1

Z CII

  • 1
  • 1

1 C

  • 1

CI 1

  • 1

1