Notes for AKT-091008-2/0:26:47

From Drorbn
Revision as of 20:15, 20 October 2009 by Conan777 (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigationJump to search

sketch of the proof of PBW theorem:

Given any word, go through each letter and change the ordering of the letters by applying the relation this process will yield an expression of the word using only non-decreasing words in the basis elements.