You can imagine a Fib object as a tree, wher the branch elements (e. g. root and the list elements) representing the branches in the tree. Because in computer science in general the root is displayed at the top, the Fib elements, which are contained in an element , are below it, and the Fib elements, which are containing the element , are above it.
Below a Fib element means, that the elements are meant, that the element directly or indirectly contains. In contrast, above a Fib element are the Fib elements, that are containing the Fib element directly or indirectly.
This is illustrated in figure 2. The list element in the middle, which is marked with 1 is the element with respect to which above and below is determined.