This concept introduces a novel way to understand "dimension" through relationships between elements rather than classical coordinate systems, topology, or vector spaces.
In traditional mathematics, dimension typically refers to the number of degrees of freedom in a space—such as 2D or 3D Euclidean space—or the number of basis vectors in a vector space. This approach is largely geometric or algebraic.
However, in complex systems—biological networks, abstract games, social graphs, ontological structures—we often encounter entities where classic notions of "space" and "dimension" do not apply, but structure does. We propose an alternate foundation: relational dimension.
The relational dimension of a system is defined by the minimum number of independent relations required to fully distinguish all elements in the system from each other.
- A relation can be a binary predicate (e.g.
a > b,a friend of b,a connected to b) or more general n-ary relation. - Independence means that no relation is logically derivable from the others.
- The dimensionality is not spatial—it measures logical or structural complexity.
Let:
- S be a finite set of elements.
- R = {R₁, R₂, ..., Rₙ} be a set of relations on S, where each Rᵢ: Sᵏ → {0,1} (a k-ary relation).
The relational dimension of (S, R) is the minimal number d such that:
- There exists a set of
dindependent relations {R₁, ..., R_d} - For every pair of distinct elements
a, b ∈ S, there exists some Rᵢ such thatRᵢ(a) ≠ Rᵢ(b)
Let S = {1, 2, 3} with a single relation R(x, y) = x > y.
This one relation is sufficient to distinguish all pairs in the set:
- 2 > 1
- 3 > 2
- etc.
Relational dimension = 1
Let S be nodes of a graph, R(a, b) be adjacency.
Some nodes may be indistinguishable via adjacency alone.
We might need additional relations (e.g., node color, degree, or metadata) to distinguish them.
The number of such independent relations = relational dimension.
- Knowledge representation (ontologies, semantic graphs)
- Pattern recognition and clustering
- Data compression (minimal distinguishability)
- Security and obfuscation (information indistinguishability)
- Game mechanics and puzzles
- Mathematical foundations of cognition
- Formal axiomatic system
- Exploration in infinite sets and categories
- Category-theoretic formulation
- Relationship with information theory
This is an open foundational idea. I invite critique, extensions, proofs, and applications.
Please fork, comment, and contribute.
© 2025 — Concept proposed via ChatGPT and published by [osukono]