14.02.2013 Views

Grassmann Algebra

Grassmann Algebra

Grassmann Algebra

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

ExploringClifford<strong>Algebra</strong>.nb 30<br />

���<br />

�<br />

���Α<br />

�<br />

� Ε � Θ � Γ�� �<br />

� m s z p�<br />

���Γ<br />

�<br />

� Θ � Β � ∆�� � p z k q�<br />

���<br />

� �∆ � Ε � Ω � Θ� � q s r z<br />

� ���<br />

�<br />

���Θ<br />

† † �<br />

� Γp �� ����<br />

� z �<br />

���Θ<br />

�<br />

� �� � z p�<br />

�����Α<br />

� Ε � Β � ∆� � �∆ � Ε � Ω � Θ� � m s k q q s r z<br />

� ���<br />

�<br />

���Θ<br />

† † �<br />

� Γp �� ����<br />

� z �<br />

���Θ<br />

�<br />

� �� � z p�<br />

������1�<br />

�<br />

sk † †<br />

���Ε � ∆q � ���� �Εs � ∆����Α � Β���Ω� Θ� s<br />

q m k r z<br />

� ��1� sk � � ��<br />

�<br />

���Θ<br />

†<br />

�<br />

†�<br />

Γp �� ����<br />

� z �<br />

���Θ<br />

�<br />

� �� �z<br />

p�<br />

������Ε<br />

† †<br />

� ∆q � ���� �Εs � ∆����Α � Β � Ω � Θ� � s<br />

q m k r z<br />

On the other hand we can associate the second pair to obtain the same result.<br />

���Α<br />

�<br />

� Ε � Θ � Γ�� �<br />

� m s z p�<br />

���<br />

�<br />

���Γ<br />

�<br />

� Θ � Β � ∆�� � �∆ � Ε � Ω � Θ� � p z k q�<br />

q s r z ���<br />

�<br />

� ���Α<br />

�<br />

� Ε � Θ � Γ�� � ��1�<br />

�m<br />

s z p�<br />

zk�z��s�r� † †<br />

���Θ � ∆q � ���� �Θz � ∆��� z<br />

q � ��Γ<br />

�<br />

� �� ��� � � p k�<br />

s r<br />

� ��1� zk�z��s�r� † †<br />

���Θ � ∆q � ���� �Θz � ∆��� z<br />

q ���Α<br />

�<br />

� Ε � Θ � Γ�� �<br />

�m<br />

s z p�<br />

���Γ<br />

�<br />

�  � Š� �� � p k s r�<br />

� ��1� zk�z��s�r��sz�ks † †<br />

���Θ � ∆q � ���� �Θz � ∆��� z<br />

q ���Α<br />

�<br />

� Θ � Ε � Γ�� �<br />

�m<br />

z s p�<br />

���Γ<br />

�<br />

� Š�  � �� � p s k r�<br />

� ��1� zk�zr�ks † †<br />

���Θ � ∆q � ���� �Θz � ∆��� z<br />

q � ��<br />

�<br />

���Ε<br />

†<br />

�<br />

†�<br />

Γp �� ����<br />

�s<br />

�<br />

���Ε<br />

�<br />

� �� � s p�<br />

�����Α<br />

� ���� � � m z k r<br />

� ��1� sk � � ��<br />

�<br />

���Θ<br />

†<br />

�<br />

†�<br />

Γp �� ����<br />

� z �<br />

���Θ<br />

�<br />

� �� �z<br />

p�<br />

������Ε<br />

† †<br />

� ∆q � ���� �Εs � ∆����Α � Β � Ω � Θ� � s<br />

q m k r z<br />

In sum: We have shown that the Clifford product of possibly intersecting but otherwise totally<br />

orthogonal elements is associative. Any factors which make up a given individual element are<br />

not specifically involved, and hence it is of no consequence to the associativity of the element<br />

with another whether or not these factors are mutually orthogonal.<br />

A mnemonic formula for products of orthogonal elements<br />

Because Θ z and Γ p<br />

are orthogonal to each other, and Ε s and ∆ q are orthogonal to each other we can<br />

rewrite the inner products in the alternative forms:<br />

���Θ<br />

† � †�<br />

Γp �� ����<br />

� z �<br />

���Θ<br />

�<br />

� Γ�� † � �Θ ���� Θz ��<br />

�z<br />

p�<br />

z<br />

� ��Γ<br />

� p<br />

† ���� Γp<br />

���<br />

�<br />

† † † †<br />

�Ε � ∆q � ���� �Εs � ∆� � �Ε ���� Εs ���∆ ���� ∆q �<br />

s<br />

q s<br />

q<br />

The results of the previous section may then summarized as:<br />

2001 4 26

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!