We prove that under some natural condition eager class initialization of a Java program P, as proposed in Kozen and Stillerman (2002), does not depend on the choice of a topological sort of the graph of class initialization dependencies of P. We also identify further natural conditions under which the eager and lazy class initializations of P assign the same initial values to the static fields of P. The latter result partially solves a problem raised in Kozen and Stillerman (2002).