#permutation matrices
44 messages · Page 1 of 1 (latest)
- Do not ping the Moderators, unless someone is breaking the rules.
- Do not ping the Helper Moderators, unless there is a conflict between helpers.
- Do not ping other members randomly for help.
- Ask your question and show the work you've done so far. If you've posted a screenshot of a question, specify which part you need help with.
- Wait patiently for a helper to come along.
- If the Helper has answered your question, remember to thank them with the Mathematics Ranks bot and close the thread with:
+close
Feel free to nominate the person for helper of the week in #helper-nominations
If you're happy with the help you got here, and the server overall, you can contribute financially as well:
if $(e_i){1 \le i \le p}$ is the canonical basis of $\bR^{p}$ what is $A{\sigma} e_i$ ? $\forall \sigma \in S_p, \forall i \in {1,…,p}$
😑 ɿototoЯ | Rototor 😑
you can also try expressing the coefficients of $A_{\sigma}$ using the kronecker delta notation
😑 ɿototoЯ | Rototor 😑
For any permutation $\sigma$
😑 ɿototoЯ | Rototor 😑
We didn't have the kronecker delta notation in the lecture, which is why we are not allowed to use it. Regarding your other suggestion. A_σ is the unit matrix, but with swapped rows, so that A_σ has a 1 in the 𝜎(i)-th position and a zero otherwise. However, I don't know exactly how I can deduce Aσ - Aτ = A_σ◦τ and, above all, how this can be written down formally / mathematically.
Prove that $\forall i \in {1,…,p}$ A_{\sigma} e_i=e_{\sigma(i)}$
😑 ɿototoЯ | Rototor 😑
Compile Error! Click the
reaction for more information.
(You may edit your message to recompile.)
$A_{\sigma} A_{\tau}=A_{\sigma \circ \tau}$ if and only if $\forall i \in {1,…,p}, A_{\sigma} A_{\tau} e_i=A_{\sigma \circ \tau} e_i$
😑 ɿototoЯ | Rototor 😑
a linear map is uniquely determined by its image for each element of the basis
@dry sundial
Try proving the right proposition
After proving this
Does e_i mean the unit vector, in other words a vector that has a 1 in the i-th position and a 0 in the remaining positions?
Yes
.
I proposed to do it with the canonical basis but you can also show that if $x=(x_1,….,x_p)$ then $A_{\sigma} x=(x_{\sigma(1)},….,x_{\sigma(p)})$
😑 ɿototoЯ | Rototor 😑
Can I send my proof and you tell me if I've done something wrong?
Yeah go right ahead
The light blue one says that e_i only has a 1 at the i-th position and a 0 otherwise, from which it follows that only if j=i, the multiplication is not 0.
The green one says that E_σ has a 1 at σ(i), i has a 0 otherwise and e_i has a 1 only at i, from which it follows that the multiplication results in a single-column matrix that is not equal to 0 only at σ(i), consequently e_σ(i).
Behauptung, Beweis = Assertion, proof
@spark tendon
Are you still online?
Yeah sorry I was eating
No problem. I was just wondering why there was no answer.
Looks good
Although I’d explain a bit why this is
At the beginning of your proof
What exactly would you explain? Why I calculate A_σ*e_i or do you mean something else?
I mean, why to prove that both matrices are equal, does it suffice do prove that their image is the same on the canonical basis, if it’s a property you’ve seen in class, then you just need to mention that is what you are using, if you haven’t seen it, it requires more justification
Something like that, and if so, where would you best insert that into the proof.
Right before $A_{\sigma} e_i=e_{\sigma(i)}$ me thinks
😑 ɿototoЯ | Rototor 😑
No eligible helpers were found in this thread. You can still close this post if you don't require helper any longer.
You are very welcome
This post has been closed and archived. Thank you for using our help system!
@dry sundial here