On an application of convexity to discrete systems

AbstractWe prove the following result: Let A be a symmetric matrix, f be gradient (or certain subgradient) of a convex function, and {yi} be a sequence defined by yi + 1 = f(Ayi), y0 arbitrary. Then the only possible periods of {yi} are 1 or 2