|
> It also seems he hadn't completely realized that a graph is merely a collection of points, not a nice line-like object. This last is more explicit in non-continuous functions, but you don't usually see those in high school. Well, I find whole thing rather controversial, so to say. Depends on what do one mean by "collection" and by "point", eg. if we take point literally: (x, y) \in RxR, then we have to assume that "collection" is uncountable (which seems counterintuitive, esp. from the school student's pov). OTOH, one could treat "point" as representation of that point, eg. pencil mark, so that point is no longer single element, but rather an uncountable subset containing the point of interest, along with its neighbourhood => our "collection" becomes countable, so we could think about it as bunch of indexed points (much more intuitive, isn't it?), shifting our attention towards mapping's representation from the mapping itself. tl;dr Treating graph as a collection of points is no more correct/better, compared to treating it as a continous line. Different problems require different approaches and different "angles" of view. Barely an insight from the author - the most of the mathematics is about abstractions and pattern matching. |
The whole paragraph does not make sense to me. For example, how is a collection uncountable somehow unintuitive? Why should a point not be a single element, but a subset or a pencil mark? Are you confusing the theoretical graph with the graph actually drawn (which has finite width)?