Jump to content

Talk:Closed graph theorem

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Vlad Patryshev (talk | contribs) at 11:56, 21 February 2024 (a closed graph). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

what does it mean? a closed graph? Jackzhp (talk) 00:32, 10 August 2010 (UTC)[reply]

Answering your question. A closed graph is a graph of a map (as defined in the article, {(x,f(x)}, and it is closed as a subspace, that is, it's equal to its closure. Do we need to update the article to add links? Vlad Patryshev (talk) 11:56, 21 February 2024 (UTC)[reply]

left as an exercise

Left as an exercise? come on.. this is not a students textbook —Preceding unsigned comment added by 85.2.3.42 (talk) 14:47, 19 December 2010 (UTC)[reply]