There's two sections on chain maps Chris2crawford (talk) 21:43, 5 October 2017 (UTC)Reply
| This article is rated C-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||
| |||||||||||
There's two sections on chain maps Chris2crawford (talk) 21:43, 5 October 2017 (UTC)
I'd like to suggest changing all in this article to , so that can be recycled as the connecting homomorphism. Is this a bad idea? Any alternative suggestions? I've got one text that uses for both, and another text that tries to distinguish between the two in this way. linas 12:50, 17 April 2007 (UTC)
The first section defines chain complexes and cochain complexes, but they appear to be the same thing, but for the fact the indices run in the other direction. Is there something hidden or missing? Jfr26 (talk) 20:38, 15 March 2009 (UTC)
I think it would be good to have some mention of double complexes, either on this page or on a separate page. I'd vote that they qualify as chain complexes, there are just a few subtleties involved. Amazelgee (talk) 18:00, 26 May 2009 (UTC)
Consider the de Rham complex F of M as a singular complex (M is triangulable), we obtain the following natural isomorphism .
Then I'll modify--Enyokoyama (talk) 01:52, 11 March 2015 (UTC)
This article was marked as "B class" quality, and it seems obviously not so, however, it could be if, for example, some fraction of the contents of chapter 3 section 2 of Novikov "Topology I General Survey" was reproduced here. The article currently lacks the following "notable" topics:
In my eyes, that would probably transform this article from C class to B and then to get to B+ or GA article, a more category-theoretic approach e.g. cribbed from JP May. "concise course in algebraic topology" book. 67.198.37.16 (talk) 18:40, 7 May 2016 (UTC)
To my knowledge the quotient module is written
and not as
Madyno (talk) 13:36, 10 October 2020 (UTC)
Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.