The Eigenfunctions of Compact Weighted Endomorphisms of C(X) (Q3743907)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3977759
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Eigenfunctions of Compact Weighted Endomorphisms of C(X) |
scientific article; zbMATH DE number 3977759 |
Statements
The Eigenfunctions of Compact Weighted Endomorphisms of C(X) (English)
0 references
1986
0 references
eigenspaces of compact operators
0 references
ascents
0 references
computation of eigenvalues and eigenvectors
0 references
0.7419230937957764
0 references
0.7358153462409973
0 references
0.7338134050369263
0 references
0.728512704372406
0 references
The author characterizes the eigenspaces of compact operators \(uC_{\phi}:f\to u\cdot f\circ \phi\) on C(X), where X is a compact Hausdorff space, u a continuous function on X into \({\mathbb{R}}\) and \(\phi\) a continuous function from X to X. He determines the ascents, being 1 for \(\lambda\neq 0\). He applies his result to derive the eigenspaces of matrices with at most one nonzero element in each row with a simple algorithm. For \(\lambda\in {\mathbb{C}}\), let \(C_{\lambda}:=\{c\in X| c\) is a fixed point of \(\phi\) of order n for some positive integer n and \(\lambda^ n=u(c)\cdot...\cdot u(\phi_{n-1}(c))\}\). Kamowitz proved, that \(\sigma (uC_{\phi})\setminus \{0\}=\{\lambda \neq 0| C_{\lambda}\neq \emptyset \}\). The author proves for \(\lambda\in \sigma\) \((uC_{\phi})\setminus \{0\}\), that every function which is a linear combination of \(functions\) h\({}_{c,\lambda}(x):=\lambda^{-r}u(x)\cdot...\cdot u(\phi_ r(x))\) for \(r\in {\mathbb{N}}\) and \(x\in \phi_ r^{-1}(\{0\})\) and 0 otherwise is continuous and an eigenfunction of \(uC_{\phi}\) and vice versa. For \(\lambda =0\), \({\mathcal N}((uC_{\phi})^ n)=\{f\in C(X)| f(x)=0\) for every \(x\in W_ n\}\), where \(w_ 0=\{x| u(x)\neq 0\}\) and \(W_ k:=\phi (W_ 0\cap W_{k-1}).\) To calculate the eigenspaces of matrices with at most one nonzero element in each row, one has to analyze the graph, describing how the matrix operates on the canonical coodinates. Due to the simple structure of the matrix, the graph factors in cycles with attached paths, thus allowing for the straightforward computation of eigenvalues and eigenvectors.
0 references