Stable linear transformations under composition

Click For Summary

Discussion Overview

The discussion revolves around the properties of linear transformations over finite fields, specifically focusing on transformations that exhibit stability under composition. Participants explore conditions under which certain linear maps satisfy specific equations, and they seek general formulas or examples for such maps.

Discussion Character

  • Exploratory
  • Technical explanation
  • Conceptual clarification
  • Debate/contested

Main Points Raised

  • One participant inquires about linear transformations f such that f^n = f^N for all N ≥ n, and also about transformations g satisfying g = g ∘ f^i for any i ≥ 0.
  • Another participant notes that the properties discussed are not specific to finite fields and suggests that the transformations decompose the vector space.
  • A participant proposes that if g = g ∘ f, then it can be expressed in terms of a partition defined by f, leading to a discussion about equivalence classes.
  • There is interest in finding a general formula for g in terms of f, with an example provided that utilizes the properties of finite fields.
  • Another participant mentions that the set of powers of f forms a finite semigroup with at least one idempotent, which may be relevant to the discussion.
  • One participant suggests that if g = g ∘ f, then the image of I - f must lie in the kernel of g, leading to a characterization of g based on the kernel and image relationships.
  • A later reply discusses the restriction of g's kernel to the image of I - f, questioning whether an expression for g in terms of f can be derived.
  • There is uncertainty about whether the converse of the proposed kernel condition holds in all cases of f.

Areas of Agreement / Disagreement

Participants express various viewpoints and hypotheses regarding the properties of linear transformations, with no consensus reached on a general formula or the validity of certain conditions.

Contextual Notes

Limitations include the dependence on specific definitions of linear transformations and the unresolved nature of certain mathematical relationships discussed.

burritoloco
Messages
81
Reaction score
0
Hi,

Let f be a linear transformation over some finite field, and denote f^{n} := f \circ f \circ \cdots \circ f, n times. What do we know about the linear maps f such that there exist an integer n for which f^{N} = f^n for all N \geq n? Also, how about linear maps g satisfying g = g \circ f^i for any i\geq 0? Something tells me that I've seen this before in my undergrad years but my memory is very vague on this. Thanks!
 
Physics news on Phys.org
Remark: In the 2nd question, f doesn't have to satisfy the property in the 1st question.
 
That does not have to do with finite fields particularly. Both cases are related. The transformation decomposes the vector space.
Suppose if g=gf
then we can write x=y+z where
gfy=0
gfz=gz
in other words f can change x to another vector with the same value under g
f thus defines a partition or equivalence class
 
Thanks lurflurf. I'm not sure I understand why it defines a partition. But I was particularly interested in knowing whether there is a general formula for the linear maps g satisfying g = g \circ f^i, in terms of f. For instance, the fact that we have a finite field guarantees that we can find two powers of f that are the same, sayf^a = f^b with a < b. Then if we let g = \sum_{j=a}^{b-1} f^j, it satisfies our property. I am wondering if there exists a more general expression for g. Cheers.
 
Last edited:
If not a general formula, it would be nice to have as many examples as possible, like the above. OK, I understand what you mean now (after a good night sleep! hehe). Thanks. But as you can see from the previous post I'm more interested in, given f, what are the g's satisfying this? It might be of use to know that the set of powers of f on a finite field forms a finite semigroup and hence has at least one idempotent.
 
Last edited:
If g = gf then g(I-f) = 0, which means that the image of I-f must lie in the kernel of g. Similarly the image of I-f2, I-f3 etc lie in the kernel of g. So let K be the sum of the images of all I-fk for all k (of which you only need to check finitely many), then g can be any linear transformation such that K lies in the kernel of g.
 
Thank you. Now, suppose that we restrict g so that its kernel is the image of id - f. One can show that this g also satisfies g = g \circ f^i for each i \geq 0. Any ideas whether it would be possible to obtain an expression for g in terms of f or so?
 
Last edited:
For instance, the example that I gave for g has the image of id - f contained in its kernel, but I'm not sure that we can show the converse is true in all cases of f.
 

Similar threads

  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 15 ·
Replies
15
Views
5K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 26 ·
Replies
26
Views
1K
  • · Replies 9 ·
Replies
9
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 6 ·
Replies
6
Views
3K