Now we can consider chains of rising arrows made on these maps, and classify them as follows:• Class 1: The chain ends on A.• Class 2: The chain ends on B.• Class 3: The chain has no end, because it has an infinite number of steps, or only one.This partition also permits us to make a partition of the elements of A into three disjoint sets, and to make a conjecture of what the bijection h is: If x in A is in a chain of Class 1, then h(x) = f(x). If x is in a chain of Class 2, then h(x) = g-1(x), and if x is in a chain of Class 3, then h(x) = f(x). Now the problem remains to prove that h is indeed a bijection, which is the case.It is clear that the representation made in this example of the sets A and B, and the representation of descending or rising arrows are not the same as the mathematical concepts they represent, but they are clear enough to construct the map h which solves the problem.This example illustrates that perceptual experience can be an important component in the stimulation of conjecturing.
đang được dịch, vui lòng đợi..
![](//viimg.ilovetranslation.com/pic/loading_3.gif?v=b9814dd30c1d7c59_8619)