A novel procedure for constructing invariant subspaces of a set of matrices

Ahmad Y. Al-Dweik; Ryad Ghanam; Gerard Thompson; Hassan Azad

doi:10.1007/s10231-022-01233-7

Home/Archive/arXiv

arXiv · 2103.08316

A novel procedure for constructing invariant subspaces of a set of matrices

Ahmad Y. Al-Dweik·Ryad Ghanam·Gerard Thompson·Hassan Azad

View original source ↗Read source document ↗Export metadata ↓

Abstract

A problem that is frequently encountered in a variety of mathematical contexts, is to find the common invariant subspaces of a single, or set of matrices. A new method is proposed that gives a definitive answer to this problem. The key idea consists of finding common eigenvectors for exterior powers of the matrices concerned. A convenient formulation of the Pl\"ucker relations is then used to ensure that these eigenvectors actually correspond to subspaces or provide the initial constraints for eigenvectors involving parameters. A procedure for computing the divisors of totally decomposable vector is also provided. Several examples are given for which the calculations are too tedious to do by hand and are performed by coding the conditions found into Maple.

Explore related subjects

math.GM

Keep this discovery

BibTeX RIS

Ahmad Y. Al-Dweik, Ryad Ghanam, Gerard Thompson, Hassan Azad. 2021-03-09. A novel procedure for constructing invariant subspaces of a set of matrices. https://doi.org/10.1007/s10231-022-01233-7

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Average Chord Lengths in a Triangle

Let $P$ be a point inside a triangle $T$. We consider the average length of the chords of $T$ through $P$, where the direction of the chord is chosen uniformly. An elementary formula is obtained in terms of the distances from $P$ to the sides and vertices of the triangle. Several classical triangle centers give especially simple specializations. For example, if $I$ is the incenter, then \[ M_T(I)=\frac{2r}{\pi} \log\left(\cot\frac A4\cot\frac B4\cot\frac C4\right). \] Our main result is the sharp inequality \[ M_T(P)\le \frac{p}{\pi\sqrt3}\log(2+\sqrt3), \] valid simultaneously for every triangle of perimeter $p$ and every interior point $P$. Thus, among all such pairs $(T,P)$, the largest possible average chord length occurs only when $T$ is equilateral and $P$ is its center. The proof is an elementary symmetrization argument. We close with brief remarks relating the problem to the radial center of a convex body, the electrostatic potential center of a triangle, and dual quermassintegrals.

math.GM↗

arXiv2026

The decrease in sectional curvature of the Fisher--Rao manifold of beta distributions

In the paper, the author develops a general convexity lemma and applies it to demonstrate the monotonic decrease of a function involving polygamma functions, arising from the sectional curvature of the Fisher--Rao manifold of beta distributions.

math.GM↗

arXiv2026

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. We prove a conjecture of Liu stating that \[\sum_{\mathrm{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \geq 2+\left(\frac{2r}{R}\right)^k,~~k>1, \] with the reverse inequality for $0<k<1$. The proof reduces the problem to three positive variables with fixed sum and product. We also determine the equality cases.

math.GM↗