The Eight Vertices of a Cube: A Connection Between Coordinate Geometry, Vector Algebra and the Algebraic Structure Z₂³

1Introduction

Coordinate geometry represents points in three-dimensional space by ordered triples (x,y,z). In ordinary Euclidean vector algebra, the standard basis vectors are i = (1,0,0), j = (0,1,0), and k = (0,0,1). Thus the position vector of a point (x,y,z) is r = x i + y j + z k. For example, (1,0,0) corresponds to i, (1,1,0) corresponds to i + j, and (1,1,1) corresponds to i + j + k.

If each coordinate is restricted to 0 or 1, there are exactly 2³ = 8 triples. These are the vertices of the unit cube [0,1]³. The same set of triples can be viewed algebraically as the vector space Z₂³, provided that addition and scalar multiplication are performed modulo 2. This dual viewpoint links a familiar geometric object with a finite algebraic system.

2Objectives

• To list and interpret the eight vertices of the unit cube.
• To express each vertex as a vector using i, j, and k.
• To define the binary vector space Z₂³ and distinguish it from the real vector space R³.
• To prove elementary algebraic properties of the binary triples.
• To explain applications in digital systems, coding theory, and cube graphs.

3The eight vertices of the unit cube

The unit cube is the set of points (x,y,z) for which 0 ≤ x,y,z ≤ 1. Its vertices occur when every coordinate is either 0 or 1. The complete list is given in Table 1.

Binary triple / coordinate point	Euclidean position vector	Geometric description
(0,0,0)	0	Origin
(1,0,0)	i	Unit step along x-axis
(0,1,0)	j	Unit step along y-axis
(0,0,1)	k	Unit step along z-axis
(1,1,0)	i + j	Vertex in the xy-plane
(1,0,1)	i + k	Vertex in the xz-plane
(0,1,1)	j + k	Vertex in the yz-plane
(1,1,1)	i + j + k	Opposite vertex to the origin

4The algebraic structure Z₂³

Let Z₂ = {0,1} be the field with two elements. Its addition and multiplication are taken modulo 2. In particular, 1 + 1 = 0, 1 + 0 = 1, and 1·1 = 1. Define V = Z₂ × Z₂ × Z₂. An element of V is a triple (a,b,c), where a,b,c ∈ Z₂.

For u = (a,b,c) and v = (d,e,f), define componentwise addition by u + v = (a+d, b+e, c+f), with each coordinate calculated modulo 2. Scalar multiplication by λ ∈ Z₂ is λu = (λa, λb, λc). Under these operations V is a vector space over Z₂.

The set V has eight elements, but its addition is not ordinary Euclidean vector addition. For example, in R³, i + i = (2,0,0); in Z₂³, (1,0,0) + (1,0,0) = (0,0,0). The coordinate labels are the same, but the arithmetic is different.

5Addition table for the eight binary triples

Table 2 gives u + v in Z₂³. Each entry is the componentwise sum modulo 2.

+	000	100	010	001	110	101	011	111
000	000	100	010	001	110	101	011	111
100	100	000	110	101	010	001	111	011
010	010	110	000	011	100	111	001	101
001	001	101	011	000	111	100	010	110
110	110	010	100	111	000	011	101	001
101	101	001	111	100	011	000	110	010
011	011	111	001	010	101	110	000	100
111	111	011	101	110	001	010	100	000

6Fundamental properties

Proposition 1. The set Z₂³ is an abelian group under binary addition.

Proof. Addition is defined coordinatewise using addition in Z₂. Since addition in Z₂ is associative and commutative, the same properties hold in every coordinate of a triple. The zero vector (0,0,0) is the identity. Every vector is its own additive inverse because (a,b,c)+(a,b,c) = (0,0,0), as each coordinate satisfies a+a=0 in Z₂. Therefore Z₂³ is an abelian group. ∎

Proposition 2. Z₂³ is a vector space of dimension three over Z₂.

Proof. The vector-space axioms follow coordinatewise from the field axioms of Z₂. The vectors (1,0,0), (0,1,0), and (0,0,1) span every triple: (a,b,c)=a(1,0,0)+b(0,1,0)+c(0,0,1). They are linearly independent, because a(1,0,0)+b(0,1,0)+c(0,0,1)=(0,0,0) implies a=b=c=0. Hence they form a basis and dim(Z₂³)=3. ∎

Proposition 3. The eight binary triples correspond bijectively to the eight vertices of the unit cube.

Proof. Map each triple (a,b,c) ∈ Z₂³ to the point with the same coordinates in [0,1]³. Each coordinate is either 0 or 1, so the image is a cube vertex. Distinct triples give distinct points, and every cube vertex has such a triple. Thus the correspondence is one-to-one and onto. This is a bijection of sets; it does not claim that Euclidean geometry and binary vector addition are the same operation. ∎

7Worked examples

7.1Example 1: the vertex (1,1,1)

In Euclidean vector algebra, its position vector is r = i + j + k. In binary vector notation it is (1,1,1). Adding it to itself in Z₂³ gives (1,1,1)+(1,1,1)=(0,0,0). By contrast, the Euclidean vector added to itself is (2,2,2).

7.2Example 2: addition of two vertices in Z₂³

Let u=(1,1,0) and v=(1,0,1). Then u+v=(1+1,1+0,0+1)=(0,1,1), with all coordinates reduced modulo 2. Thus 110 + 101 = 011.

7.3Example 3: Hamming distance and cube edges

Two binary triples are joined by an edge of the cube exactly when they differ in one coordinate. For example, 000 and 100 differ in one coordinate, so they are adjacent. The Hamming distance between two binary triples is the number of coordinates in which they differ.

8Geometric and algebraic interpretations

The cube has eight vertices, twelve edges, and six square faces. Its vertices can be labelled by binary triples. An edge corresponds to changing exactly one bit, which is equivalent to adding one of the basis vectors 100, 010, or 001 in Z₂³. This gives a direct link between cube geometry and the Cayley graph of the additive group Z₂³.

However, the binary operation is an algebraic operation on labels, not ordinary displacement in Euclidean space. For example, adding 100 modulo 2 to 100 returns 000, whereas moving one unit in the positive x-direction twice in Euclidean space reaches (2,0,0), outside the unit cube.

9Applications

9.1Digital electronics

A triple such as (1,0,1) can encode three binary signals. Bitwise addition modulo 2 is the XOR operation: 1 XOR 1 = 0 and 1 XOR 0 = 1. This is useful in parity computation and digital logic.

9.2Coding theory

Binary triples are binary words of length three. The Hamming distance measures the number of bit positions at which two words differ. This distance is fundamental in detecting and correcting transmission errors.

9.3Graph theory

The cube graph Q₃ has one vertex for each binary triple, with two vertices adjacent when they differ in exactly one bit. Every vertex has degree three, and the graph has eight vertices and twelve edges.

9.4Finite algebra

The additive group of Z₂³ is an elementary abelian group of order eight. It is not the cyclic group of order eight: every element satisfies u+u=0. The same set of triples also forms a three-dimensional vector space over the field Z₂.

9.5Coordinate geometry and linear algebra

The correspondence helps students move between ordered coordinates, basis-vector notation, and abstract vector spaces. It also demonstrates that a single set can support different mathematical interpretations depending on the operations defined on it.

10Limitations and clarifications

The notation Z₂³ means Z₂ × Z₂ × Z₂, with each coordinate calculated modulo 2. It should not be confused with the eight vertices treated as points in R³ with ordinary real-number arithmetic. The map from binary triples to cube vertices is a bijection, but it does not preserve Euclidean vector addition as a binary operation.

Also, the cube vertices alone are not a real vector subspace of R³, because, for example, (1,0,0)+(1,0,0)=(2,0,0), which is not a vertex. The set of cube vertices is closed under addition modulo 2, not under ordinary real vector addition.

11Digital algebra and three-bit systems

Digital algebra studies algebraic systems built from discrete symbols, especially binary values 0 and 1, together with precisely defined operations. The field Z₂ = {0,1} has two elements. When three binary coordinates are used, Z₂³ models three-bit words or three digital signals. The eight cube vertices can therefore be interpreted as the eight possible states of a three-bit digital system.

11.1Binary operations and logic gates

In digital algebra, addition in Z₂ is the exclusive-OR (XOR) operation: 0+0=0, 0+1=1, 1+0=1, and 1+1=0. Multiplication in Z₂ agrees with the AND operation: 0·0=0, 0·1=0, 1·0=0, and 1·1=1. Boolean OR is different from addition modulo 2 because 1 OR 1 = 1, whereas 1+1 in Z₂ equals 0. Thus Boolean OR must not be confused with field addition. The three operations are compared in Table 3.

a	b	a+b in Z₂ (XOR)	a·b (AND)	a OR b
0	0	0	0	0
0	1	1	0	1
1	0	1	0	1
1	1	0	1	1

11.2The cube as the state space of a digital device

A triple (a,b,c) can represent three switches, three bits in a register, or three binary sensors. For instance, 101 means that the first and third bits are 1 and the second bit is 0. The eight triples 000, 001, 010, 011, 100, 101, 110, and 111 give the complete state space. Changing exactly one bit moves between adjacent vertices of the cube graph.

11.3Worked digital-algebra example

Let u = (1,1,0) and v = (1,0,1). Bitwise XOR gives u ⊕ v = (1⊕1, 1⊕0, 0⊕1) = (0,1,1), or 011. If the same words are combined bitwise using AND, the result is (1·1, 1·0, 0·1) = (1,0,0), or 100. These are different operations on the same set of eight binary triples.

Proposition 4. The XOR operation forms an abelian group on the three-bit states.

Proof. XOR is componentwise addition in Z₂. It is associative and commutative because addition in Z₂ has these properties. The identity is 000, and every word is its own inverse because u⊕u=000. Hence the three-bit words form an abelian group of order eight under XOR. This is the additive group of the vector space Z₂³. ∎

11.4Applications

This model is useful in digital circuit design, parity-bit calculations, error detection, finite-state machines, binary encodings, and cube networks. A cube edge represents a one-bit change; the Hamming distance between two states counts the minimum number of bit changes needed to move between them. The algebraic model is exact for binary operations, while the geometric cube provides a visual representation of state transitions.

12Two-dimensional example: the unit square

For a two-dimensional unit square, the four vertices are (0,0), (1,0), (0,1), and (1,1). In R², with basis vectors i=(1,0) and j=(0,1), these correspond to 0, i, j, and i+j. The set {0,1}² is also Z₂² when addition is modulo 2. For example, 10+11=01 in Z₂², while ordinary real-vector addition gives (1,0)+(1,1)=(2,1). The square has four vertices and four edges.

13Four-dimensional example: the tesseract

The pattern extends naturally to four dimensions. The set {0,1}⁴ has 2⁴ = 16 binary vectors, corresponding to the 16 vertices of a four-dimensional unit hypercube (tesseract). In ordinary R⁴, the standard basis vectors are e₁=(1,0,0,0), e₂=(0,1,0,0), e₃=(0,0,1,0), and e₄=(0,0,0,1). A point (a,b,c,d) has position vector ae₁+be₂+ce₃+de₄. For example, (1,0,1,1) corresponds to e₁+e₃+e₄, and (1,1,1,1) corresponds to e₁+e₂+e₃+e₄. Interpreted in Z₂⁴, these same tuples use modulo-2 arithmetic.

The four-dimensional analogue of the cube is called a tesseract or 4-cube. It has 16 vertices, 32 edges, 24 square faces, and 8 cubic cells. These counts can be obtained from the formula for the number of k-dimensional faces of an n-dimensional cube: 2^n−k times the binomial coefficient C(n, k). In particular, for n = 4, the number of vertices is 2⁴=16 and the number of edges is 2³·C(4,1)=32.

13.1Geometry and algebra in four dimensions

Under componentwise addition modulo 2, the 16 four-bit words form the vector space Z₂⁴. For example, 1011 + 1101 = 0110 because each coordinate is added modulo 2. Every word added to itself gives 0000. Two tesseract vertices are connected by an edge when their labels differ in exactly one bit. Each vertex has four incident edges, one for each coordinate direction.

14The general n-dimensional pattern

These examples establish the general rule: in dimension n, the vertices of the unit n-cube are exactly the 2ⁿ binary coordinate tuples in {0,1}ⁿ. They can be viewed geometrically as points in Rⁿ or algebraically as vectors in Z₂ⁿ, but the operations must be specified. Over R, vector addition is ordinary addition; over Z₂, coordinates are added modulo 2. The binary vector space has dimension n and 2ⁿ elements.

For n=2, the square has four vertices; for n=3, the cube has eight vertices; and for n=4, the tesseract has sixteen vertices. In each case, changing exactly one coordinate from 0 to 1 or from 1 to 0 moves along an edge. The corresponding graph is the n-dimensional hypercube graph Qₙ.

14.1Comparison of dimensions

The unit square, cube, tesseract and general hypercube are compared in Table 4, and examples of points with their position vectors and binary labels are given in Table 5.

Dimension	Geometric object	Number of vertices	Binary vector space
2	Unit square	2² = 4	Z₂²
3	Unit cube	2³ = 8	Z₂³
4	Tesseract (4-cube)	2⁴ = 16	Z₂⁴
n	n-dimensional hypercube	2ⁿ	Z₂ⁿ

Dimension	Example point	Euclidean position vector	Binary label
2	(1,1)	i + j	11
3	(1,1,1)	i + j + k	111
4	(1,0,1,1)	e₁ + e₃ + e₄	1011
4	(1,1,1,1)	e₁ + e₂ + e₃ + e₄	1111

15Conclusion

The eight vertices of a unit cube provide a clear and instructive connection between coordinate geometry, vector algebra, finite algebra, and digital algebra. In Euclidean space, (1,0,0), (0,1,0), and (0,0,1) correspond to i, j, and k, while (1,1,1) corresponds to i+j+k. Interpreted over Z₂, the same coordinate triples form the vector space Z₂³ with eight elements. This structure explains binary addition, XOR operations, cube-graph adjacency, and coding-theory concepts; it also models the eight states of a three-bit digital system. The key lesson is that the same coordinate labels can describe different structures when the underlying operations change.

References

1. [1]Anton H, Rorres C (2013). Elementary Linear Algebra: Applications Version (11th ed.). Wiley.
2. [2]Axler S (2015). Linear Algebra Done Right (3rd ed.). Springer.
3. [3]Biggs N (1993). Algebraic Graph Theory (2nd ed.). Cambridge University Press.
4. [4]Hamming RW (1950). Error detecting and error correcting codes. Bell System Technical Journal, 29(2), 147–160.
5. [5]Lidl R, Niederreiter H (1997). Finite Fields (2nd ed.). Cambridge University Press.
6. [6]Mano MM, Ciletti MD (2017). Digital Design (6th ed.). Pearson.