Pure Data Spaces: Theory and Practice

• Pure data spaces are formal constructs defined via minimal data sequences or finite topologies that postpone rich semantic interpretation to enable emergent mathematical structures.
• They are applied across foundational, topological, and architectural frameworks to create consistent models, supporting everything from abstract algebra to secure, decentralized data sharing.
• The framework promotes automated knowledge discovery and robust governance through methods that integrate algebraic, topological, and semantic perspectives.

Pure data spaces are formal constructs that appear in several technically distinct research programs. In one line of work, the only primitive is the finite sequence, objects with mathematical meaning are data, and collections of mathematical objects are associative data called spaces (Youssef, 19 Aug 2025). In another, the “pure data space” is the finite topological space $D=(X,\mathcal T)$ on a data set $X$, prior to interpreting variables, functions, and relations in a domain (Chen et al., 2014). In decentralized data-sharing architectures, a Pure Data Space (PDS) is an idealized, minimal instance of a data-space architecture in which all data stay at their original sources, integration is performed purely at the semantic level, and the soft infrastructure is completely decoupled from any centralized storage or compute platform (Marojevikj et al., 1 Sep 2025).

1. Terminological scope

The phrase “pure data spaces” is used for at least three non-identical notions in the cited literature. In the foundational program, a space is the basic collection analogous to sets in Set Theory or objects in Category Theory, and spaces are studied via their semiring of endomorphisms (Youssef, 19 Aug 2025). In the data-information-knowledge program, a data space is a finite topological space whose underlying set of points is a given data set $X$, with further informational and knowledge-bearing structure arising only after interpretation in a specific domain $\Delta$ (Chen et al., 2014). In the architectural program, a Pure Data Space is a decentralized semantic data-space architecture specified by open standards, semantic contracts, and machine-readable policies rather than centralized storage or monolithic middleware (Marojevikj et al., 1 Sep 2025).

A common source of ambiguity is that all three usages retain the word “space” while assigning it different formal roles. One usage is algebraic and foundational, one topological and pre-semantic, and one infrastructural and interoperability-oriented. This suggests a shared methodological pattern: each formulation begins from a deliberately minimal substrate and postpones richer semantic, inferential, or operational structure until later stages.

2. Pure data as finite-sequence substrate

In the foundational framework, the only primitive is the notion of a finite sequence. A coda is a pair of data, written $(A:B)$, and a data is any finite sequence of codas, including the empty sequence $()$. Two operations are primitive: concatenation $(AB)$ and pairing as a coda $(A:B)$ (Youssef, 19 Aug 2025).

The earlier axiomatization states the same substrate as follows: Data is the smallest set such that $()\in\mathrm{Data}$, $A,B\in\mathrm{Data}\Rightarrow AB\in\mathrm{Data}$, and $X$0. The entire system is governed by a single Axiom of Definition, where a context $X$1 is a partial function from codas to Data, extended recursively by

$X$2

The empty context $X$3 is valid, and if $X$4 is valid and a new definition $X$5 has disjoint domain, then $X$6 is also valid (Youssef, 2023).

Mathematical meaning is introduced by choosing such a partial function $X$7 and declaring $X$8 on its domain of definition, then closing under the congruence rules for concatenation and colon (Youssef, 19 Aug 2025). A coda $X$9 is a fixed point if $X$0; any data reducible to a fixed point is an atom; and a data $X$1 is invariant if every coda in $X$2 is a fixed point and its left- and right-components are themselves invariant (Youssef, 19 Aug 2025). The system begins from the empty context, and a minimal consistency argument forces the introduction of one distinguished atom (:) with

$X$3

after which a small library of combinator definitions is added, but no arithmetic axioms are assumed (Youssef, 19 Aug 2025).

The same framework defines an internal three-valued logic. In any valid context, $X$4 is true iff $X$5, false iff $X$6 is atomic, and undecided iff $X$7 and $X$8 is not atomic (Youssef, 2023). This internal logic is not primitive; it arises from the permanent dichotomy between empty and atomic data.

3. Spaces, morphisms, and the semiring of endomorphisms

A data $X$9 is a space if

$\Delta$0

equivalently, if the binary operator

$\Delta$1

is associative (Youssef, 19 Aug 2025). In particular,

$\Delta$2

so $\Delta$3 is idempotent in the global sense, and the data $\Delta$4 are precisely its fixed points under colon (Youssef, 19 Aug 2025). The earlier formulation writes the same law as

$\Delta$5

and calls $\Delta$6 the neutral element of $\Delta$7 (Youssef, 2023).

Morphisms are also defined internally. One exposition defines a morphism $\Delta$8 as a distributive data satisfying

$\Delta$9

with composition $(A:B)$0 and identity given by $(A:B)$1 (Youssef, 2023). Another defines a morphism $(A:B)$2 as any product $(A:B)$3 with $(A:B)$4, so that an endomorphism of $(A:B)$5 is any $(A:B)$6 with

$(A:B)$7

Composition is pure-data concatenation (Youssef, 19 Aug 2025). In the earlier presentation, spaces and morphisms form a “coda-category,” in which every pair of morphisms is automatically composable (Youssef, 2023).

For a fixed space $(A:B)$8, the set $(A:B)$9 of endomorphisms carries a semiring structure. Addition is

$()$0

where $()$1 is the global data sum $()$2; multiplication is composition; the additive identity is $()$3; and the multiplicative identity is $()$4 (Youssef, 19 Aug 2025). Within this semiring, several classes are distinguished:

• Subspaces: idempotent endomorphisms $()$5 with $()$6, ordered by $()$7.
• Homomorphisms: endomorphisms $()$8 satisfying

$()$9

• Central endomorphisms: endomorphisms commuting with every unit in the group of units.
• Units: invertible elements under composition.

The semiring viewpoint supports several structural results: isomorphic spaces have isomorphic semirings; every morphism $(AB)$0 factors uniquely as $(AB)$1 with $(AB)$2 a monomorphism and $(AB)$3 idempotent; and a space $(AB)$4 is a field if and only if every non-constant homomorphism of $(AB)$5 is a unit (Youssef, 19 Aug 2025).

4. Organic emergence of classical mathematical structures

One of the main claims of the foundational literature is that familiar objects from classical mathematics emerge from pure data spaces “grown organically” from the substrate of pure data with minimal combinatoric definitions, including natural numbers, integers, rational numbers, boolean spaces, matrix algebras, Gaussian Integers, Quaternions, and non-associative algebras like the Integer Octonions (Youssef, 19 Aug 2025).

Structure	Pure-data realization	Stated outcome
Natural numbers	$(AB)$6	$(AB)$7 is the standard semiring $(AB)$8
Integers	subspace reduce of $(AB)$9	central semialgebra isomorphic to $(A:B)$0
Matrix algebra	subspace sort of $(A:B)$1	realizes $(A:B)$2
Boolean space	$(A:B)$3	$(A:B)$4 has four elements: $(A:B)$5
Positive rationals	$(A:B)$6	field isomorphic to $(A:B)$7
Sequences	$(A:B)$8	space of finite $(A:B)$9-valued sequences

For the natural numbers, the fixed points of $()\in\mathrm{Data}$0 are $()\in\mathrm{Data}$1, the operation

$()\in\mathrm{Data}$2

gives ordinary addition, and homomorphisms $()\in\mathrm{Data}$3 are exactly multiplication by a fixed $()\in\mathrm{Data}$4, namely

$()\in\mathrm{Data}$5

The non-constant idempotents are the endomorphisms

$()\in\mathrm{Data}$6

and fields occur precisely when $()\in\mathrm{Data}$7 is prime, yielding the prime fields $()\in\mathrm{Data}$8 (Youssef, 19 Aug 2025).

For integers, the fixed points of reduce are identified with $()\in\mathrm{Data}$9 via $A,B\in\mathrm{Data}\Rightarrow AB\in\mathrm{Data}$0 and $A,B\in\mathrm{Data}\Rightarrow AB\in\mathrm{Data}$1. For the sort subspace, fixed points are $A,B\in\mathrm{Data}\Rightarrow AB\in\mathrm{Data}$2, and a homomorphism is determined by a $A,B\in\mathrm{Data}\Rightarrow AB\in\mathrm{Data}$3 matrix over $A,B\in\mathrm{Data}\Rightarrow AB\in\mathrm{Data}$4 through

$A,B\in\mathrm{Data}\Rightarrow AB\in\mathrm{Data}$5

In the four-atom space $A,B\in\mathrm{Data}\Rightarrow AB\in\mathrm{Data}$6, suitable sorting and cancellation recover a copy of $A,B\in\mathrm{Data}\Rightarrow AB\in\mathrm{Data}$7, while further increases in the number of atoms and suitable involutive cancellations produce the integer quaternions and the integer octonions $A,B\in\mathrm{Data}\Rightarrow AB\in\mathrm{Data}$8 (Youssef, 19 Aug 2025).

The framework also realizes algebraic and combinatorial structures beyond number systems. The space $A,B\in\mathrm{Data}\Rightarrow AB\in\mathrm{Data}$9 is the Boolean sequence space, and the algebraic semilattice space $X$00 realizes the power-set $X$01 ordered by inclusion, with constants forming the union-lattice of subsets, units forming the symmetric group $X$02, and homomorphisms exactly the union-preserving maps (Youssef, 19 Aug 2025).

5. The pure data space as finite topology

In the data-information-knowledge framework, a data space $X$03 on a finite nonempty data set $X$04 is a pair

$X$05

where $X$06 satisfies $X$07, $X$08, any union of members of $X$09 lies in $X$10, and any finite intersection of members of $X$11 lies in $X$12 (Chen et al., 2014). The family $X$13 is the data structure of $X$14, and its members are open sets. A data function of arity $X$15 is any map $X$16, while a data relation of arity $X$17 is any Boolean-valued map $X$18 (Chen et al., 2014).

Concrete examples include the discrete topology on $X$19, the cofinite topology on the same set, and a preorder-induced data space on $X$20 with preorder $X$21, where the open sets are the upper sets and

$X$22

For finite data spaces, the stated properties include compactness, the $X$23-discrete dichotomy, a characterization of connectedness in terms of the preorder graph, and the fact that a data space is metrizable if and only if it is discrete (Chen et al., 2014).

At this level, no semantics have yet been assigned to points or open sets. The construction proceeds by interpreting variables, functions, and explicit relations over $X$24 in a specific domain $X$25 to obtain an information space $X$26, and then building a knowledge space $X$27 as the product of $X$28 and $X$29. Here $X$30 is obtained from $X$31 by using the induction principle to generalize propositional relations to quantified relations, the deduction principle to generate new relations, and standard mechanisms to validate relations; $X$32 is the space of specifications of methods with operational instructions valid in $X$33 (Chen et al., 2014).

This formulation explicitly distinguishes the “pure data space” from later semantic enrichment. It constrains only how data points cluster or separate via $X$34, and what syntactic constructions are available as data-functions and data-relations. Information retrieval then consists essentially in mining domain objects and relations, and knowledge discovery consists essentially in applying induction and deduction, synthesizing and modeling information, and validating the resulting propositions and specifications (Chen et al., 2014).

6. Pure Data Space as decentralized semantic architecture

In the systems and interoperability literature, a Pure Data Space (PDS) is an idealized, minimal instance of a data-space architecture in which all data stay at their original sources, integration is performed purely at the semantic level, and the soft infrastructure is completely decoupled from any centralized storage or compute platform (Marojevikj et al., 1 Sep 2025). Relative to a general data space, the defining negatives are explicit: no “data lake” or aggregated staging area exists, even transiently; no proprietary or monolithic middleware is assumed; and governance is enforced exclusively through machine-readable policies such as SPARQL guards and ODRL (Marojevikj et al., 1 Sep 2025).

The theoretical core is expressed through data sovereignty, semantic integration, decentralization, and soft infrastructure. If $X$35 is the set of participants, $X$36 the set of semantic connectors, $X$37 the global semantic model, and $X$38 the governance layer, then

$X$39

For any request $X$40, the permission function is

$X$41

and is computed at the connector of $X$42 via policy evaluation. Semantic integration is driven by a shared vocabulary $X$43, mapping each raw data item $X$44 to a triple set $X$45 (Marojevikj et al., 1 Sep 2025).

The architecture is decomposed into minimal, protocol-driven microservices or linkable libraries:

Component	Role	Key basis
Semantic connectors	Data-plane and control-plane	HTTP/HTTPS, WebSub, LDES, REST/OpenAPI, SPARQL Protocol
Federated registry & catalogs	Metadata and policy endpoints only	SPARQL endpoint for discovery
Identity & Access Management	Peer identity and credential checks	DIDs and Verifiable Credentials
Policy enforcement layer	Local authorization	ODRL profiles with SPARQL-based guard
Governance & certification service	Governance rules and compliance	machine-readable smart contracts, test suite

Interoperability is organized around a lightweight core ontology $X$46 for Entities, Attributes, and Provenance, extended by domain-specific ontologies. Raw schema fields are semantically mapped, for example by annotations of the form

$X$47

Authorization is performed locally through a SPARQL-based “authorization guard”: policies are stored as named graphs $X$48, and at request time a connector executes a SPARQL ASK query against $X$49 plus the requested data graph; if the ASK returns true, the data transfer proceeds, otherwise it is denied (Marojevikj et al., 1 Sep 2025).

The literature lists concrete deployments and pilots: Catena-X in automotive, the European Health Data Space in healthcare, Smart Freight Centre on AWS in logistics, the Flanders Smart Data Space in smart cities, and the Green Deal Data Space. Across these cases, data remain at producer sites, edge nodes, hospital EHR systems, or origin registries, while shared semantic models, RDF mappings, and SPARQL-guard policies enable federated access without centralizing raw data (Marojevikj et al., 1 Sep 2025).

7. Comparative significance and open questions

The three usages of pure data spaces converge on a common emphasis on minimal structure, but they diverge sharply in formal objective. The foundational program seeks an axiomatic basis for mathematics and computing in which proof and computation are both sequences of equalities on pure data, and in which all familiar mathematical structures arise as associative data with semiring-organized endomorphisms (Youssef, 2023). The topological program isolates the raw combinatorial footprint of a data set before semantic interpretation, then derives information and knowledge spaces by interpretation, induction, deduction, synthesis, modeling, and validation (Chen et al., 2014). The architectural program pursues secure and efficient data exchange under data sovereignty, interoperability, and trust by combining semantic connectors, ontologies, DIDs, verifiable credentials, ODRL, and SPARQL-based authorization (Marojevikj et al., 1 Sep 2025).

Several open directions are explicit in the literature. In the foundational setting, a rich—but as yet only partially explored—theory of external morphisms between different spaces is anticipated; brute-force scans of data up to modest width and depth already produce small spaces, but the growth of data is doubly exponential; and whether the framework will scale to topology, category theory, analysis, or cohomology remains an open frontier (Youssef, 19 Aug 2025). In the architectural setting, observed challenges include the performance of real-time SPARQL authorization on very large RDF streams, versioning and evolution of the shared ontology $X$50, and onboarding new participants with non-standard schemas (Marojevikj et al., 1 Sep 2025). In the data-information-knowledge framework, the key observation is that efficient approaches may be designed to discover profound knowledge automatically from simple data, as demonstrated in the case of geometry (Chen et al., 2014).

Accordingly, “pure data spaces” should be interpreted contextually. In one body of work the term denotes associative data that serve as basic mathematical collections; in another it denotes the topological skeleton $X$51 of a data set before semantic enrichment; and in a third it denotes a fully decentralized semantic overlay for data exchange. The shared vocabulary is real, but the mathematical objects, operational mechanisms, and intended applications are distinct.