Every Q-polynomial distance-regular graph is sharp over R
Abstract
Let denote a distance-regular graph with vertex set X and diameter D ≥ 3. Fix a vertex x ∈ X. Let the field F be either R or C. Let MatX(F) denote the F-algebra of matrices whose rows and columns are indexed by X and all entries in F. The Terwilliger algebra TF = TF(x) is the subalgebra of MatX(F) generated by the adjacency matrix A of and the dual primitive idempotents \Ei*\i=0D of with respect to x. Let \Ei\i=0D denote the primitive idempotents of A. Assume that the ordering \Ei\i=0D is Q-polynomial. Let W denote an irreducible TF-module. We say that W is sharp over F whenever (Er* W) = 1, where r is the endpoint of W. It is known, by Nomura and Terwilliger (2008), that every irreducible TC-module is sharp. In this paper, we prove that every irreducible TR-module is sharp. Once this is established, we obtain four additional results: (i) if W is an irreducible TR-module, then its complexification WC= W R C is an irreducible TC-module; (ii) two irreducible TR-modules W1 and W2 are isomorphic if and only if their complexifications W1C and W2C are isomorphic as TC-modules; (iii) if i=1h Matni(C) is the Wedderburn decomposition of TC, then i=1h Matni(R) is the Wedderburn decomposition of TR; (iv) each of the subalgebras E1* T E1*, E1 T E1, ED* T ED*, and ED T ED is commutative and every element of these algebras is a symmetric matrix.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.