Some results on contractive mappings as related to pattern recognition

Several of the techniques used in pattern recognition are reformulated as the problem of determining fixed points of a function. If x sub 0 is a fixed point of f and if f is contractive at x sub 0, then, for any y belonging to a sufficiently small neighborhood of x sub 0 the orbit of y will converge to x sub 0. Several general results regarding contractive mappings are developed with emphasis on functions.