Proof of Kitaev determinant trivialization conjecture

Using ideas from algebraic $K$-theory, we prove that a simple and naturally applicable criterion of Kitaev suffices to trivialize the Fredholm determinant of a multiplicative commutator.

💡 Research Summary

The paper proves a conjecture originally suggested by A. Kitaev concerning the triviality of the Fredholm determinant of a multiplicative commutator under a simple trace‑class condition. Let L(H) denote the bounded operators on a Hilbert space H and L₁(H) the ideal of trace‑class operators. For invertible operators U, V∈L×, the “Kitaev condition” requires that both (U‑1)(V‑1) and (V‑1)(U‑1) belong to L₁. Under this hypothesis the commutator C = UVU⁻¹V⁻¹ satisfies C‑1∈L₁, so its Fredholm determinant det(C) is well defined. The main theorem (Theorem 1.1) asserts that det(C)=1 for any such pair (U,V).

The proof proceeds in two distinct parts. First, an algebraic reduction embeds C into a 3×3 block matrix and expresses it as a product of elementary matrices eᵢⱼ(T) (matrices with a single off‑diagonal entry T). Using Whitehead’s lemma and the Steinberg relations (commutation, addition, and mixed‑index commutator identities), the authors rearrange the product so that all trace‑class factors can be discarded without affecting the determinant (Lemma 2.1). This manipulation yields Proposition 2.2, which reduces det(C) to the determinant of a four‑factor product of elementary matrices: \