Cube this problem, and in 1837 Pierre Wantzel proved it to be impossible because the cube root of 2 is not a constructible number. The cube has three uniform colorings, named by the colors of the square faces around each vertex: 111, 112, 123. The cube has three classes of symmetry, which can be represented by vertex-transitive coloring the faces. The highest octahedral symmetry O has all the faces the same color. The dihedral symmetry D comes from the cube being a prism, with all four sides being the same color. The lowest symmetry D is also a prismatic symmetry, with
Theorem of the cube Theorem of the cube In mathematics, the theorem of the cube is a condition for a line bundle over a product of three complete varieties to be trivial. It was a principle discovered, in the context of linear equivalence, by the Italian school of algebraic geometry. The final version of the theorem of the cube was first published by , who credited it to André Weil. A discussion of the history has been given by . A treatment by means of sheaf cohomology, and description in terms of the Picard functor, was given by . The theorem states that for