Computer proofs for Property (T), and SDP duality

  • Date:


  • Speaker:

    Martin Nitsche

  • Time:

    16:00 - 17:30

  • Abstract

    The optimization problem that lies at the heart of the computer proof for Property (T) satisfies strong duality. The dual problem has a geometric interpretation similar to Property (FH). We explain this and show how the geometric picture can be used to simplify the problem and prove Property (T) for Aut(F_4).


  • Place:

    20.30 SR 2.058