Wedge Product and Determinants .... Tu, Proposition 3.27 ....

Join the discussion
Ask a follow-up here, or get your own question answered by working scientists, mathematicians and engineers — people, not an autocomplete.
Real named experts · corrections over time · the nuance an AI answer skips
2 replies · 3K views
Math Amateur
Gold Member
MHB
Messages
3,920
Reaction score
48
In Loring W. Tu's book: "An Introduction to Manifolds" (Second Edition) ... Proposition 3.27 reads as follows:
?temp_hash=a458333626c1a4c034af30abe82c889b.png

The above proposition gives the wedge product of k linear functions as a determinant ...Walschap in his book: "Multivariable Calculus and Differential Geometry" gives the definition of a determinant as follows:
?temp_hash=a458333626c1a4c034af30abe82c889b.png


From Tu's proof above we can say that ...

##\text{det} [ \alpha^i ( v_j ) ]####= \text{det} \begin{bmatrix} \alpha^1 ( v_1 ) & \alpha^1 ( v_2 ) & \cdot \cdot \cdot & \alpha^1 ( v_k ) \\ \alpha^2 ( v_1 ) & \alpha^2 ( v_2 ) & \cdot \cdot \cdot & \alpha^2 ( v_k ) \\ \cdot \cdot \cdot \\ \cdot \cdot \cdot \\ \cdot \cdot \cdot \\ \alpha^3 ( v_1 ) & \alpha^3 ( v_2 ) & \cdot \cdot \cdot & \alpha^3 ( v_k ) \end{bmatrix}####= \sum_{ \sigma \in S_k } ( \text{ sgn } \sigma ) \alpha^1 ( v_{ \sigma (1) } ) \cdot \cdot \cdot \alpha^k ( v_{ \sigma (k) } )##Thus Tu is indicating that the column index ##j## is permuted ... that is we permute the rows of the determinant matrix ...But in the definition of the determinant given by Walschap we have##\text{det} \begin{bmatrix} a_{11} & \cdot \cdot \cdot & a_{ 1n } \\ \cdot & \cdot \cdot \cdot & \cdot \\ a_{n1} & \cdot \cdot \cdot & a_{ nn } \end{bmatrix}####= \sum_{ \sigma \in S_n } \varepsilon ( \sigma ) a_{ \sigma (1) 1 } \cdot \cdot \cdot a_{ \sigma (n) n }##Thus Walschap is indicating that the row index ##i## is permuted ... that is we permute the columns of the determinant matrix ... in contrast to Tu who indicates that we permute the rows of the determinant matrix ...Can someone please reconcile these two approaches ... do we get the same answer to both ...?

Clarification of the above issues will be much appreciated ... ...

Peter
 

Attachments

  • Tu - Proposition 3.27 ... .png
    Tu - Proposition 3.27 ... .png
    16.6 KB · Views: 642
  • Walschap - Defn of Determinant ... Page 15 ... .png
    Walschap - Defn of Determinant ... Page 15 ... .png
    32.6 KB · Views: 572
  • ?temp_hash=a458333626c1a4c034af30abe82c889b.png
    ?temp_hash=a458333626c1a4c034af30abe82c889b.png
    16.6 KB · Views: 811
  • ?temp_hash=a458333626c1a4c034af30abe82c889b.png
    ?temp_hash=a458333626c1a4c034af30abe82c889b.png
    32.6 KB · Views: 708
Last edited:
on Phys.org
Both definitions are the same, because we sum up all permutations.

Short answer: ##(1,1)(2,2)-(1,2)(2,1)=(1,\operatorname{id}(1))\cdot(2,\operatorname{id}(2))-(1,\sigma(1))\cdot(2,\sigma(2))=(\operatorname{id}(1),1)\cdot(\operatorname{id}(2),2)-(\sigma(1),1)\cdot(\sigma(2),2)##
for ##\sigma = (12) \in S_2##

The long answer is to write ##\sum_{\sigma} f(j,\sigma(j))##, then substitute ##i=\sigma(j)##, which gives ##\sum_{\sigma}f(\sigma^{-1}(i),i)## and observe, that ##\sum_{\sigma} = \sum_{\sigma^{-1}}##

... plus ##\operatorname{sgn}(\sigma) = \operatorname{sgn}(\sigma^{-1})##.
 
Last edited:
fresh_42 said:
Both definitions are the same, because we sum up all permutations.

Short answer: ##(1,1)(2,2)-(1,2)(2,1)=(1,\operatorname{id}(1))\cdot(2,\operatorname{id}(2))-(1,\sigma(1))\cdot(2,\sigma(2))=(\operatorname{id}(1),1)\cdot(\operatorname{id}(2),2)-(\sigma(1),1)\cdot(\sigma(2),2)##
for ##\sigma = (12) \in S_2##

The long answer is to write ##\sum_{\sigma} f(j,\sigma(j))##, then substitute ##i=\sigma(j)##, which gives ##\sum_{\sigma}f(\sigma^{-1}(i),i)## and observe, that ##\sum_{\sigma} = \sum_{\sigma^{-1}}##.
Thanks fresh_42 ...

Reflecting on what you have written ...

Peter