Linear Algebra / Linear Maps (Transformations)

Click For Summary
SUMMARY

The discussion centers on the concept of linear transformations in linear algebra, specifically regarding the output of a transformation applied to a complex n-tuple. The user initially confuses the concept of permutations of an n-tuple with the output of a linear transformation, which produces a single ordered n-tuple rather than a set of permutations. The clarification provided emphasizes that only one specific permutation is relevant to the transformation, not the total number of permutations.

PREREQUISITES
  • Understanding of linear transformations in linear algebra
  • Familiarity with complex n-tuples
  • Knowledge of permutations and their properties
  • Basic grasp of operator theory in mathematics
NEXT STEPS
  • Study the properties of linear transformations in linear algebra
  • Learn about the role of operators in vector spaces
  • Explore the concept of permutations and their applications in linear mappings
  • Investigate examples of linear transformations using complex n-tuples
USEFUL FOR

Students and educators in mathematics, particularly those focusing on linear algebra, as well as anyone seeking to deepen their understanding of linear transformations and their implications in vector spaces.

Hypercube
Messages
62
Reaction score
36
This isn't really a homework question, I just need help understanding the example:

=====================
upload_2016-12-24_15-10-25.png

====================

So transformation takes complex n-tuple as input, and it seems output is also a complex n-tuple (which is what makes it "operator"). But permutations of n entries is not n. I'm confused! Let's use the simple example, let x = (1, 2, 3). Permutations of this vector would be a set of 3! entries:

{(1, 2, 3),(1, 3, 2),(2, 1, 3),(2, 3, 1),(3, 1, 2),(3, 2, 1)}

But the transformation seems to produce one single ordered n-tuple, rather than a whole set.

Alternative interpretation would be that entries in the range of T: eta1, eta2, eta3, ..., etan are the number of permutations of the first n elements. But that also makes no sense, I would end up with a sequence of natural numbers that do not depend on the input vector.

I must be misunderstanding something, and I have a feeling it's obvious. Any help would be appreciated, thanks in advance.

(Note to moderator: I have not used the template since it is not applicable; no questions nor relevant equations. My thoughts and effort on the example have been included though. Also, apologies if I am posting in the wrong place.)
 
Physics news on Phys.org
Hypercube said:
So transformation takes complex n-tuple as input, and it seems output is also a complex n-tuple (which is what makes it "operator"). But permutations of n entries is not n. I'm confused! Let's use the simple example, let x = (1, 2, 3). Permutations of this vector would be a set of 3! entries:
That is not relevant to this problem. We are just talking about one particular permutation, π, not how many different ones there might be. Aπ is just one particular way of shuffling the elements of x.
 
FactChecker said:
That is not relevant to this problem. We are just talking about one particular permutation, π, not how many different ones there might be. Aπ is just one particular way of shuffling the elements of x.
You are right! I was just about to post that I have figured it out. Thank you for your reply!
 

Similar threads

  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 18 ·
Replies
18
Views
3K
  • · Replies 10 ·
Replies
10
Views
2K
Replies
15
Views
2K
Replies
9
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 25 ·
Replies
25
Views
4K
  • · Replies 11 ·
Replies
11
Views
2K
Replies
9
Views
2K