When we invoke genetic algorithms (GAs), we retrieve enormous numbers of individuals. If we can construct, simply, a set having some sense from individuals, it would make engineering applications easier. Schemata in GAs is a simple forms representing such a set. We define modified schemata where instances of a schema represent a continuous region assuming that the GA phenotype is real vector space. We induce expected and maximum numbers of schemata required to represent any continuous region. We show ways to construct a schema set from individuals in GA, constructing a Pareto optimum set on multiobjective optimization theory.