Notes for AKT-091008-2/0:26:47: Difference between revisions
From Drorbn
Jump to navigationJump to search
No edit summary |
(No difference)
|
Latest revision as of 20:15, 20 October 2009
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.