作者air11 (拿出一張白紙...)
看板Math
標題[代數] laws of composition
時間Wed Sep 28 14:11:34 2011
題目是這樣的....
|N={1,2,3,...} is nature number, and let s:|N -->|N be the shift
map, defined by s(n)=n+1.
Prove that s has no right inverse, but that is has infinitely
many left inverses.
這題想好久,不知道該從何下手....
煩請各位大大的指教了 :)
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 180.177.112.173
→ keroro321 :for any map g:|N->|N ,((s。g)^(-1))(1) = ? 09/28 14:31
推 recorriendo :left inverse只需要把2變回1 3變回2... 至於1可以變 09/28 14:45
→ recorriendo :到任何數 沒有right inverse是因為他不surjective 09/28 14:45