A hypercubic lattice is a graph with correlation number 2n and dimensionality n, whose vertices and edges are ordered along orthogonal axes. When the vertices of the graph are denoted by v(k) and the edges by the pair (v(k_a), v(k_b)), the lattice Sⁿ can be formally be represented by the set of edges organized in chains of an unlimited number of consecutive edges:

Herein are j and n natural numbers, k is an integer. See for instance Rosen for graph-theory [7] . The lattice is formulated so it can be used to merge many lattices along one axis, topic of the next paragraph. At similar way as the definition of a lattice, an axis is expressed as the chain of edges, determined by the subscript j:

As usual the axes have the following properties:

Axes are equal if they have at least two vertices common.

Axes are parallel if axes with the same subscript j have no common vertex.

Axes are orthogonal if the different axes have only one common vertex.

Each vertex of Sⁿ is present on a point of intersection of axes making the vertices have a unique location determined by the axes.

The distance in Sⁿ equals the distance of graph theory, namely the number of vertices along the path with the smallest number of edges between two vertices. Call the direct distance the distance between two vertices on an axis, whereby the unit-distance is the smallest distance. The metric of the lattice-like graph is the distance expressed in the direct distances along the orthogonal axes (Figure 1).

The metric makes the hypercubic lattice a space. However, the metric differs from the Euclidean metric, a graph with the proper metric requires a more complex structure.

The four-dimensional lattice Sⁿ will have a well-defined dimensionality and orthogonal axes, but only n axes per vertex which is n (double) directions. To obtain a graph Φ⁴ with many directions take a merging of a large number of four-dimensional hypercubic lattices S⁴. The dimensionality of Φ⁴, the orthogonality of the axes and the measure for distances are to be found in the individual lattices. In order to accomplish such a graph, the numerous lattices have to be united in such a way that the coordination number remains 8. The probably enormous number of four-dimensional lattices will be individualized by labelling them with a natural number s: S_s.

The interconnection along the 4-th axis of the various lattices S_s offers a possible unification Φ⁴. This is achieved by connecting each vertex at location k of S_s with the vertex at the same location of lattice S_s+1 (and S_s−1), instead of with the next vertex along the 4-th axis of the same lattice S_s. The n_point chain-wise connected lattices constitutes the so called the time axis at location k (see Figure 2), formally given by

The time axis forms a path with neither beginning nor end where the same lattice is present after n_point edges. The set of lattices merged along one each 4-th axis is referred to as the multiple space. Each four-dimensional lattice of the multiple space is called a subspace.

The time axes is not only linked to a location k but also coupled to the lattice S_s. The same time axis also connects n_point subspaces, of which n_point − 1 subspaces are different from the initial subspace S_s. At location k all n_point subspaces have one common time axis, this is different for the time axes through the vertices in other subspaces at locations other than k. Except for the location k, there seldom will be another common time axis for the same n_point subspaces. Continuing of this procedure for all the subspaces will result in a multitude of subspaces interconnected somewhere, but with indeterminate relations. This chaotic cohesion will consist of a huge number of different time axes, all without a common vertex. This means that all time axes are parallel, a feature which will be used in the next chapter.

There is the time-axes determined except for the location within the different subspaces, the other axes are completely undetermined. The set of axes orthogonal to the time axes of the many subspaces are called the spatial axes.

The combination of three spatial axes is referred to as the directions of a subspace. The set of spatial axes of the multiple space is denoted by R³, wherein R⁴ is the spacetime. Without additional rules determining the spatial properties, the multiple space offers only a framework. In the next chapter will be determined the effects of some possible rules, formulated as regularities in the presence of directions and subspaces.

The multiple space is not symmetric for interchanging of spatial axes and time axes: Between the directions of one subspace are many indeterminate directions of other subspaces, but not between a spatial direction and the time axis because of the orthogonality of the space and time axes. When the additional rules are such that the directions are uniformly distributed, the multiple space is anisotropic in R⁴ and isotropic in R³.

The presence of a time axis in R³ is called a space-point of multiple space at a certain position. In multiple space, there is some difference in meaning between the position of a point in R³ and the location of the same point in a subspace, to elucidate in the next chapter. In R⁴, the space-point is an endless chain of vertices in time.

Time distances along the point can be expressed in two fundamental units:

Δt: The repetition interval of the point which is also the unit-distance of a subspace, probably the time distance in which phenomena have to be expressed:

δt: The time distance between two adjacent vertices cq. subspaces, called the differential time

Due to the way the numerous lattices are merged, δt is a perfectly synchronized smallest time step for the entire multiple space. Each differential time step δt connects two instants.

Even when n_point is the same for every point, a large number of points will mutually differ in the set of subspaces because n_subspaces ? n_point (see 2.2). For the points which are made up of an equal set of subspaces, two different types of points can be distinguished:

-fully synchronous points: points with equal n_point of which the subspaces have pairs of equal directions at the same instant (this doesn’t mean the same subspace),

-unequal points: points consisting of n_point mutually unequal or partly unequal subspaces.

Due to the parallelism of the time axes, parallel spatial axes can be defined between different subspaces. In order to demonstrate this, express point P at location k in subspace S_a in a time series of successive subspaces:

The set of points P(k_i) of an axis of S_a forms a spatial line at time t_a:

Subspaces S_x(k_i, t_x) are all mutually different for different points P(k_i). In case the unequal subspaces S_a and S_b are present in all points of the set, {P(k_i)} contains two lines at t_a and t_b making that the axis of subspaces S_a and those of S_b have the same spatial direction (Figure 3). So different subspaces have parallel spatial axes when all the points on the axis of the one subspace are also the points of the axis of the other subspace.

Let the space-point be intersected by n_pivot parallel axes of different subspaces with a particular direction. Does this apply to all axis directions and for all space-points, the space has a great regularity. The first regularity is a regularity of the time axis which is, formulated broadly:

The first regularity of multiple space states that a numerical property relating to time series of vertices is applicable to all points of multiple space.

According to the first regularity, each point consists of the same number of n_point subspaces along the time axis before the subspaces are repeated. The first regularity also implies that the number of n_pivot parallel axes is the same for every time axis through any point of multiple space.

Let there be two unequal subspaces S_a and S_b both belonging to dissimilar points P(1) and P(2) meaning that both subspaces have axes pairs intersecting both points. Let there be a lot of such pairs of points and corresponding subspaces. Take of this collection two points with the same direct distance apart from the sign measured in both subspaces, a situation as illustrated in Figure 4. If x, y is the direct distance between P(1) and P(2) in subspace S_a, there is a subspace S_b in

which the same distance will be x, −y. This implies that both x-axes of S_a and S_b are perpendicular to two parallel z-axes through space-point P(1), a property that also holds for the two y axes through point P(2).

Other points on the axes between P(1) and P(2) do not share common subspaces with point P(1). Let there be a regularity in the presence of point pairs with common couple of subspaces, being a regularity on the spatial distances:

According to the second regularity of multiple space two different subspaces with parallel axes contain pairs of points on fixed direct distances measured along the perpendicular axes, independently of the perpendicular axes and the subspaces in question.

When the second regularity is true, it can be shown that the multiple space contains a huge number of both unequal subspaces and non-coincident subspaces with parallel directions. Namely, take at t (>0) the series of x points on the x-axis of S_b. At t = 0 each point is part of subspace predominantly unequal to S_a. This series of subspaces at t = 0 forms a set of mutual unequal subspaces.

Within the spatial unit-cube Δx³ at point P(1), each subspace is part of a space-point P´, component of a set of points {P’} (see Figure 4). This means that the points along the x-axis of S_b cause x non-coinciding points in the unit-cube. With n_point different axes of P(1), the unit-cube contains 1 + (x − 1)n_point distinguished points, not taking into account possible double counting.

When the unit-distance is universal valid in multiple space as will be shown below, the total number of points in the unit-cube is equal to the number of subspaces n_subspaces of the multiple space. Due to the (x − 1)n_point distinguished points within the unit-cube is n_subspaces? n_point. This makes that at the location of the unit-cube is present a tangle of not coincident subspaces.

For entities in a continuous space a universal measure of the distance is not self-evident, see Čapek for elucidation of the problem of the theme of Gulliver [8] . Each subspace of the multiple space has the unit-distance as distance measure, the question is whether the whole multiple space has the same measure for the distance. For this there need to be a matching between the subspaces. The first regularity provides for it.

Two subspaces of a space-point both have the same unit-distance when the axes are parallel (see Figure 3). This also applies to the subspaces of the n_pivot parallel axes of the space-point. Each axis, orthogonal to the n_pivot parallel axes, also has the same unit-distance because they belong to the same subspace. These orthogonal axes in turn have parallel axes for which the same unit-distance is applicable. Repeating the procedure makes all subspaces belonging to a point will have the same unit-distance.

A subspace is intersected by numerous points whose associated subspaces also have the same unit-distance. Because all the subspaces of multiple space somewhere are interconnected by points, the unit-distance is uniform across multiple space.

Note: With an uniform unit-distance, the theme of Gulliver is just half solved. It is also necessary that the size of physical phenomena is uniquely determined by the distances of the subspaces.

The n_subspaces points within the unit-cube indicate a smaller mutual distance than the unit-distance. In the multiple space, the distance between two points is defined as the number of edges along the axes of the common subspace. This definition of distance cannot be used to determine the smallest distance within the unit-cube, the apparently nearest points don’t have direct connections. Indirectly there is a connection via a path over several subspaces and points whereby path-distance >> unit-distance.

In multiple space a distinction is made between the location and the position of a point. The location of a point is given by the coordinates of one of its vertices within a subspace, unique for a particular subspace. The position is determined by the fictive coordinates within a particular unit-cube, expressed in fractions of the unit-distance. To determine the position of an arbitrary point P_a within an unit-cube, take subspace S_u of the unit-cube part of point P_u, and the subspace S_a of the arbitrary point on the same instant. The subspaces S_u and S_a are part of a common point P_c somewhere in space. The position of P_a, a rational number, is mathematically determined by the difference of the direct distances between P_a and P_c in subspace S_a and P_u and P_c in subspace S_u.

Call the virtual distance of two points within a unit-cube the difference of two positions. By taking n_subspaces points equally spread over the unit-cube, the smallest virtual distance expressed in unit-distances is of the size

Note: A workable distance must arise out of the mutual influence of two phenomena. Interaction in multiple space probably is determined by encountering fields with the same axis direction, meaning that the meeting takes place in the same subspace. This makes that the interaction is determined by the direct distance between the entities and not by the virtual one.

The Consider those coupled subspaces with a minimal value of y/x and with one point on a fixed position. Since the fixed point contains n_pivot parallel axes, there are just as many coupled subspaces with minimal y/x. The unfixed points form an unbroken remote connection, a regular polygon if projected onto the Euclidean plane (see Figure 5). The ratio y/x can be associated with an angle which

makes it possible to determine the relation between the direct distance x, y of two coupled subspaces. The arctangent of the smallest ratio of y/x is called the unit-angle α_pivot expressed in radians

A larger angle is the sum of several unit-angles. The sum of unit-angles at a point going from one space direction to the other is referred to as the discrete- angle between two directions.

The discrete-angle enables to determine the trigonometric functions of multiple space, as shown in appendix A. The variables are provided with an inaccuracy denoted by due to the integers used

In which the distances a and b are the adjacent sides of a rectangular triangle, and c is the hypotenuse.

With the help of the discrete-angle, the direct distance in the one subspace can be expressed in direct distances of the other subspace. The discrete-angle as the coupler of subspaces together with the orthogonality of the axes enables to describe the required rectangular triangles. With these features as ingredients, the metric in accordance with the Pythagorean Theorem can be determined using the method of John Wallis’ the proof of similar triangles’ [9] . For applying these methods on the multiple space see appendix B. The variables of the Pythagorean Theorem have a small inaccuracy of the size of the unit-distance:

Euclidean geometry is based on the empirical concepts of points, lines and planes [10] , concepts which also can be used in multiple space. In multiple space

these concepts arise from the more basic entities of vertices, edges and space structure. The geometry resulting from the concept of point and line in multiple space has features which, on a very small scale, differ from the geometry as interpreted from daily experience.

The concept of a point in multiple space and the Euclidean geometry correspond only with regard the position in space. In the Euclidean geometry, a point is continuously present during the time being the place where intersecting spatial lines meet. Random different points always have a mutual distance meaning a point has always a neighbour to be connected.

In multiple space, a point consists of a time series of connected vertices being present stepwise over time. Within the spatial unit-cube Δx³, all the n_subspaces space-points are separated with no direct connection by an edge, which means there are no connected adjacent space-points. Points are only spatially connected within a subspace over distances larger than the unit-distance Δx, meaning that random different space-points only are seldom interconnected.

In Euclidean geometry, a spatial line is a chain of points. Unless parallel, two spatial lines in a plane always intersect in a point.

Within the multiple space, a spatial line is a chain of adjacent vertices along an axis in one of the subspaces. The line is straight by definition. Different spatial line seldom intersect in a space-point, only in case the lines belong to the subspaces of the space-point. Rarely, any two space-points are part of a spatial line, namely in the exceptional case the line is an axis of a subspace. Also in case of two unit-cubes, only on a relatively short distance there is a common subspace with an axis to determine the mutual distance of the unit-cubes.

In multiple space, a curved line is a set of successive pairs of points, each pair on the axis of a common subspace. A curved line is made up of a plurality of such pairs of points. At each point there is a jump in the time of one subspace to the other. The curved line is not smooth, the line is straight on the axes of the subspaces and at each connective point there is a leap in space direction.

Depending on the definition, the concept of a plane in the multiple space differs totally from that in Euclidean space. When as an obvious possibility the plane is defined as a set of vertices determined by two orthogonal axes, the plane is present only in one subspace. By that definition, only planes in the same subspace may have an intersecting line. Arbitrary planes are present in different subspaces and thereby don’t have a line of intersecting, which is an impossibility in Euclidean geometry for non-parallel planes.

With respect to volumes, the difference with the continuous space is even more striking. In continuous space, two partially overlapping volumes always have a common volume. This is not the case in multiple space when a volume is defined as a collection of vertices within a cube of a subspace. Generally, two volumes belonging to different subspaces at about the same position have no common vertices, simply because not coincident subspaces have nothing in common. Rarely different subspaces will have common points, in which case the vertices of the subspaces are connected in the time.

The way in which the volume should be used depends on the manner objects such as fields are disposed in the multiple space.

There are several possibilities to add a field to the multiple space. One possibility directly related to the conventional method is to use the multiple space as a discrete background space in which the quantities determining the field are added to the vertices of the lattice. The different lattices of the multiple space cover all possible spatial directions relative to the other lattices. By an appropriate choice of regularities, the connections between the lattices are invariable in every direction making the directions are evenly distributed. This kind of regular multiple space can act as a discrete reference space, in which each rotation across a discrete angle shows the same the same background space.

A field may also be related to the space by making use of the division of the multiple space into subspaces, making it very likely that quantities describing fields are present only in subspaces with an axis in the direction of the action of the field. Then the field is present in only n_pivot of the n_point subspaces in case the subspaces containing the field are coupled to a specific space-point. Another consequence of this obvious assumption is that interaction can only occur when two fields are present in the same subspaces. For the same reason, fields with different directions will not perform interaction. This also implies that, without mutual influencing, different fields may be present at about the same position in spacetime, as in the vicinity of the core of an electron. The assumption also indicates that a particle with a radially field will be present in n_directions subspaces with different triplet of directions, whereby: n_directions < n_subspaces. The advantage of the presence of a field to a limited number of subspaces is that the various characteristic of multiple space, such as n_pivot and n_directions, can be included in the field description, potentially giving a physical meaning to these characteristics.

The multiple space with some possible regularities cannot include moving phenomena or relativistic effects, since regularities affect the entire space. Namely, in the fixed frame of multiple space, speed and its effect should be a localized phenomenon having different properties with respect to other parts of the space. What remains is the possibility that deviations of the space structure will cause different behaviour of spatial enclaves.

It can be shown that there are possible deviations of the lattice structure in the upper and bottom plane of a spatial cube L³ which will have an impact on the axes of the embedded cube. Within the cube the time axis and one of the spatial axes are not parallel to those of the surrounding space. Following the development in the time, the cube moves relative to the surroundings with a speed v = 1/L forming an inclined corridor in the time. To put it more vividly: the deviations seem to annihilate the surrounding space on the upper plane in order to change it into a moving cube, and subsequently to restore the surroundings at the lower plane at the expense of the moving cube.

A side effect of the moving cube is that the enclosed space is deformed such that the spacetime in the cube has relativistic properties with respect to the surrounding space. The deformation of space is needed to ensure that the spacetime density of the vertices is the same both in and outside the time-corridor of the cube. At the four boundary surfaces of the time-corridor, each vertex has to have eight edges in all spatial directions as connections with other vertices both in and outside the cube. Within the time-corridor of the cube, the space has the shape of a lattice.