Skip to content

Commit 5fa6877

Browse files
v1.3.1
1 parent 61e5992 commit 5fa6877

1 file changed

Lines changed: 65 additions & 0 deletions

File tree

concept_of_system.md

Lines changed: 65 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,65 @@
1+
---
2+
id: definition-system
3+
version: 1.3.1
4+
scope: standalone
5+
status: FINAL — Human Approved
6+
---
7+
8+
# Definition — System
9+
10+
**Premise:**
11+
12+
1. All ecological embeddings have geometric properties.
13+
14+
2. Flux denotes the rate of information transfer across a surface within G.
15+
16+
3. Dimensionality, Size, and Degrees of Freedom:
17+
- *Dimension* — a particular direction along a Principal Axis. A direction, not a measurement.
18+
- *Size* — the span or magnitude of a quantity along a single dimension.
19+
- *Dimensionality* — the count of independent Principal Axes of G or any subdomain; equivalently, the number of degrees of freedom available within that domain.
20+
- *Degrees of freedom* — coincide with dimensionality. Uncertainty in information transfer within a domain is a function of its degrees of freedom.
21+
- *On common usage:* In architecture and civil engineering, "dimensions" typically denotes physical extents such as length, width, or height — these are sizes in the sense defined here, not dimensions. The two must not be conflated: dimension is direction; size is magnitude along a direction.
22+
23+
---
24+
25+
A **system** S is defined as a triplet **(N, R, G)** such that:
26+
27+
- **N** is a set of **nodes** — the networked things that constitute the system.
28+
- **R** is a set of **relationships** among nodes — including self-relationships, where a node in N relates to itself via a reflexive relation in R.
29+
- **G** is a set of **ecological embeddings** that defines the spatio-temporal adjacency of N and R within a hyper-dimensional space. G mediates R: the relationships in R are made persistent and meaningful by the ecological embedding G provides.
30+
31+
---
32+
33+
## Formal Constraints
34+
35+
1. N and R may each be empty. The empty system (N = Ø, R = Ø) is valid — it is inert or idempotent or void in its informational content, but not ill-formed.
36+
37+
1. A node n in N may hold a reflexive relationship (n, n) in R. In this case, n is simultaneously the sender and receiver of its own signal, ecologically coupled to itself via G. This is the minimal non-degenerate system: a single node with memory of itself.
38+
39+
1. Information transfer within S is possible if and only if R ≠ Ø and |N| ≥ 1. A system with nodes but no relationships is degenerate — no transfer channel exists.
40+
41+
1. Memory of S exists if and only if G is non-trivially structured — nodes in N have spatio-temporal adjacency within the ecological embedding G, and G mediates at least one relationship in R. A system with no ecological embedding, or with an unstructured one, has no memory even if N and R are non-empty.
42+
43+
1. The cost of forgetting within S depends on the ecology encoded in G — the individual, organizational, cultural, and environmental context in which S is embedded. Where relationships in R are non-linear and observer-constituted, forgetting may be irreversible. Where they are linear and observer-independent, forgetting is recoverable from residual components or external records.
44+
45+
---
46+
47+
## Boundary Cases
48+
49+
| N | R | G | Name | Status |
50+
|---|---|---|---|---|
51+
| Ø | Ø || Empty or void system | Valid. Informationally inert and idempotent. |
52+
| ≠ Ø | Ø || Degenerate system | Valid. No transfer possible. No memory. |
53+
| {n} | {(n,n)} | Structured | Minimal system | Valid. Single node, reflexive relation, self-memory via G. |
54+
| ≠ Ø | ≠ Ø | Unstructured | Transfer-capable, memoryless | Theoretically possible but ecologically intangible. |
55+
| ≠ Ø | ≠ Ø | Structured | Fully realized system | Transfer and memory both available. |
56+
57+
---
58+
59+
## Corollary — Graph Representation
60+
61+
Any system S can be represented as a graph where nodes in N are vertices and relationships in R are edges, including self-loops. An equivalent representation is a dictionary where keys are nodes in N and values are the sets of nodes they relate to via R. G is the ecological embedding in which that graph is physically instantiated and temporally persistent — without G, the graph is an abstract structure with no memory.
62+
63+
---
64+
65+
*definition-system-v1_3_1.md — FINAL — Human Approved*

0 commit comments

Comments
 (0)