In this paper, the conditions required for convexity of chromaticity diagrams are discussed. We derive a general solution of color matching functions to satisfy convexity of chromaticity diagrams. Using the general solution, analysis related to the shape of color matching functions are performed which is impossible without the general solution. The results of this paper will contribute to a systematization of color matching functions from a view point of theoretical framework.