Search arXivSearch

arXiv · 2204.06320

Eigenvector in Non-Commutative Algebra

Abstract

$\newcommand{\Vector}[1]{\bar{#1}{}}$ $\newcommand{\Basis}[1]{\bar{\bar{#1}}{}}$ $\newcommand{\RC}{{}_*{}^*-}$ Let $\Basis e$ be a basis of vector space $V$ over non-commutative $D$-algebra $A$. Endomorhism $\Vector{\Basis eb}$ of vector space $V$ whose matrix with respect to given basis $\Basis e$ has form $Eb$ where $E$ is identity matrix is called similarity transformation with respect to the basis $\Basis e$. Let $V$ be a left $A$-vector space and $\Basis e$ be basis of left $A$-vector space $V$. The vector $v\in V$ is called eigenvector of the endomorphism \[\Vector f:V\rightarrow V\] with respect to the basis $\Basis e$, if there exists $b\in A$ such that \[ \Vector f\circ{v}= \Vector{\Basis eb} \circ{v} \] $A$-number $b$ is called eigenvalue of the endomorphism $\Vector f$ with respect to the basis $\Basis e$. There are two products of matrices: ${}_*{}^*$ (row column: $(ab)^i_j=a^i_kb^k_j$) and ${}^*{}_*$ (column row: $(ab)^i_j=a^k_jb^i_k$). $A$-number $b$ is called $\RC$ eigenvalue of the matrix $f$ if the matrix $f-bE$ is $\RC$ singular matrix. The $A$-number $b$ is called right $\RC$ eigenvalue if there exists the column vector $u$ which satisfies to the equality \[a{}_*{}^* u=ub\] The column vector $u$ is called eigencolumn for right $\RC$ eigenvalue $b$. The $A$-number $b$ is called left $\RC$ eigenvalue if there exists the row vector $u$ which satisfies to the equality \[u{}_*{}^* a=bu\] The row vector $u$ is called eigenrow for right $\RC$ eigenvalue $b$. The set $\RC$ $\mathrm{spec}(a)$ of all left and right $\RC$ eigenvalues is called $\RC$ spectrum of the matrix a.

Explore related subjects

Keep this discovery

BibTeXRIS

Aleks Kleyn. 2022-04-11. Eigenvector in Non-Commutative Algebra. https://arxiv.org/abs/2204.06320

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

KEEP EXPLORING

Related papers

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

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