Abstract: This paper proves a 1-1 correspondence between minimal probability entrance laws for the superprocess and entrance laws for its underlying process. From this the author deduces that an infinitely divisible probability entrance law for the superprocess is uniquely determined by an infinitely divisible probability measure on the space of the underlying entrance laws. Under an additional condition, a characterization is given for all entrance laws for the superprocess, generalizing the results of Dynkin (1989). An application to immigration processes is also discussed.

Key words: Superprocess, entrance law, 1-1 correspondence