Recursive eigen extrusion: Expanding eigenbasis conjecture

Abstract

Consider n linearly independent vectors in Cn which form columns of a matrix A. The recursive evaluation of eigen directions (normalized eigenvectors) of A is the solution of an eigenvalue problem of the form AiXi=Xii with i=0,1,2 …; and here i is the diagonal matrix of eigenvalues and columns of Xi are the eigenvectors. Note that Ai+1=φ(Xi) where φ normalizes all eigenvectors to unit L2 norm such that all diagonal elements [φ(X)φ(X)]jj=1. It is to be proven that for any matrix Ao and n ≤ 7, the limiting set of matrices Ai with i ∞ is the set of unitary matrices U(n) with Xi Xi I. Interestingly, this problem also represents a recursive map that maximizes some average distance among a set of n points on the unit n-sphere. We first formally pose this conjecture, present extensive numerical results highlighting it, and prove it for special cases.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…