Graph Construction: Canonical Domain Analysis of Layer 2

Status: Canonical reference. Full 12-step analysis of the methodology's Layer 2 — how analyzed domains are connected through typed edges with specific content. Relationship to other analyses:

• Domain analysis (analysis-domain-analysis.md) covers Layer 1 — what happens within a single domain
• Graph semantics (analysis-graph-semantics.md) covers Layer 3 — what patterns emerge across the graph
• This covers Layer 2 — how edges between domains are characterized

Step 1 — Information Gathering

1.1 What we're analyzing

The process of connecting analyzed domains through typed structural relationships. Layer 2 takes two or more completed domain analyses (Layer 1 outputs) and determines:

• WHETHER they're related
• WHAT KIND of relationship they have
• WHAT CONTENT the relationship carries
• HOW positions in one lattice constrain positions in the other
• HOW the structural vocabulary transforms across the relationship

1.2 Sources

• The methodology document §5-6 (inter-domain graph, bridge primitives, edge content)
• 12+ analyzed edges across all domain analyses:
  • Biology→Chemistry (6 bridge primitives, fully analyzed)
  • Entity system→Digital computing (6 bridge primitives, fully analyzed)
  • Chemistry→Physics (6 bridge primitives, analyzed)
  • Stat mech micro→macro (4 bridge primitives, analyzed)
  • Biology→Info-comp core (role mapping)
  • Entity system→Info-comp core (role mapping)
  • Info-comp core→IT/CC/DS/NT (configuration)
  • Categorical base→Physical cluster (enrichment)
  • Entity system→PL/DB/UI (decomposition)
  • Biology→Organism arch, Entity system→App arch (substrate→surface — from biology analysis series)
  • Organism→Ecosystem, Cognitive arch→Cultural ecosystem (surface→ecosystem)
• The biology analysis series that expanded the edge type inventory (feedback, selection edges)

1.3 What recurs across all edge analyses

Every inter-domain connection involves:

1. An EDGE — the relationship exists between two specific domains
2. A CHARACTER — what kind of relationship (realization, configuration, role-id, enrichment, decomposition, feedback, selection)
3. SUBSTANCE — what the edge carries (bridge primitives, role mappings, configurations, axioms, implementation maps, feedback signals, fitness evaluation)
4. A MAPPING — how primitives in one domain correspond to primitives in the other
5. CONSTRAINTS — how positions in one lattice restrict accessible positions in the other

Step 2 — Landscape Analysis

2.1 The landscape of inter-domain connections

2.2 What's distinctive about this methodology's approach

The methodology's edge analysis is distinctive in TWO ways:

1. Typed edges with specific content — not just "these are related" but specifically HOW they're related (realization vs configuration vs role-id vs enrichment vs decomposition) and WHAT the relationship carries (bridge primitives with their own internal structure, role mappings, parameter settings).

2. Bridge primitives as analyzable structure — realization edges have bridge primitives that are structurally identical to domain primitives. They have partial levels, pairs, core triads, phase transitions. The bridge IS a mini-domain living on the edge. No other framework does this.

Step 3/3b — Primitives and Partial Levels

3.1 Primitive extraction

Five structural elements that recur across all inter-domain connection analyses:

1. Edge (Ed) — The structural relationship between two domains. The fact that a connection exists.

• Structural minimality: without edges, domains are isolated — no inter-domain structure. ✓
• Compositional productivity: edges compose (chaining through intermediate domains), combine with domain content, enable cross-domain analysis. ✓
• Empirical recurrence: every pair of connected domains has at least one edge. ✓

2. Character (Ch) — What kind of relationship the edge represents. The TYPE of connection: realization, configuration, role-identification, enrichment, decomposition, feedback, selection.

• Structural minimality: without character, edges are untyped — you know domains are related but not HOW. You can't predict what content the edge carries or how it behaves. ✓
• Compositional productivity: character determines what substance is possible, what composition rules apply, what constraints to expect. ✓
• Empirical recurrence: every analyzed edge has a character. ✓

Is Character a separate primitive or partial levels of Edge? The v1 meta-structure analysis debated this. Characters are qualitatively different from each other — realization (with bridge primitives) is structurally richer than role-identification (just a mapping table). They don't feel like "more" or "less" of the same thing. But they DO share common structure (source domain, target domain, some content, direction). The previous decision was to keep Edge as one primitive with types-as-partial-levels.

Reconsidering: Character is INDEPENDENT of Edge in the primitive sense. An edge can exist before its character is determined (a proto-edge — "these seem related but we don't know how"). And character determination is a distinct analytical operation from edge detection. Separate primitives.

3. Substance (Sb) — What the edge carries. The specific structural content that makes the relationship concrete. For realization: bridge primitives. For role-id: mapping tables. For configuration: parameter settings. For enrichment: axioms. For decomposition: implementation maps. For feedback: feedback signals. For selection: fitness criteria.

• Structural minimality: without substance, edges are typed but empty — you know it's a realization edge but not WHAT translates between the domains. ✓
• Compositional productivity: substance composes with domain content (bridge primitives interact with domain primitives), enables constraint derivation, provides the material for cross-domain analysis. ✓
• Empirical recurrence: every fully analyzed edge has substance. ✓

4. Mapping (Mp) — How primitives in one domain correspond to primitives in the other. Which primitive plays which role across the edge. For realization: which substrate primitives the bridge mechanisms connect to which surface primitives. For role-id: which concrete primitives fill which abstract roles. For configuration: which abstract primitives are set to which levels.

• Structural minimality: without mapping, you can't translate between domains — positions in one lattice don't connect to positions in the other. ✓
• Compositional productivity: mapping enables positional constraints, unified manifestations, and cross-domain comparison. ✓
• Empirical recurrence: every analyzed edge has a primitive-to-primitive mapping (even if informal). ✓

5. Constraint (Cn) — How positions in one domain's lattice restrict accessible positions in the connected domain's lattice. The cross-lattice implications. For realization: bridge levels at specific positions enable/prevent specific surface capabilities. For configuration: abstract level settings determine concrete domain scope.

• Structural minimality: without constraints, connected lattices are independent — knowing a system's position in one domain tells you nothing about its position in the other. ✓
• Compositional productivity: constraints enable feasible region computation, trajectory prediction, and bottleneck identification. ✓
• Empirical recurrence: every realization edge has positional constraints (bridge level gates). Configuration edges have constraints (level settings determine scope). ✓

3.2 Reduction test

Is Substance reducible to Character? No — character tells you WHAT KIND of content to expect (realization → bridge primitives). Substance IS the specific content (these 6 specific bridge primitives with these specific partial levels). Two realization edges have the same character but different substances (biology→chemistry has {Code,Catalyst,...}; entity→digital has {Encoding,Hash,...}).

Is Mapping reducible to Substance? Partially — mapping IS how substance connects to domain primitives. But mapping can exist without full substance characterization (you can map G→St in a role-identification edge without specifying bridge content). And substance can exist without full mapping (you can identify bridge primitives before knowing exactly which domain pair-surfaces they exercise). They're partially independent.

Is Constraint reducible to Mapping? No — mapping tells you WHAT corresponds to what. Constraint tells you HOW positions restrict each other. You can know that G maps to St without knowing that G3 implies St must be ≥ St2. Constraints require additional analysis beyond mapping.

3.3 Confirmed primitive set: 5 primitives

3.4 Partial levels

Edge (Ed):

Phase transition: Ed1→Ed2 (Confirmation). Below: informal observation ("biology looks like entity system"). Above: confirmed relationship with specific connection points. This is where the proto-edge becomes structural.

Character (Ch):

Phase transition: Ch1→Ch2 (Full characterization). Below: you know the edge is some kind of connection. Above: you know SPECIFICALLY what kind — realization with bridge primitives, or configuration with parameter settings, etc. This determines what to look for in substance analysis.

Substance (Sb):

Phase transition: Sb2→Sb3 (Internal structure). Below: the substance is a LIST — you know the items. Above: the substance is a STRUCTURE — the items have internal relationships, dependencies, and interaction patterns. This is where bridge analysis becomes rich rather than just enumerative.

Mapping (Mp):

Phase transition: Mp2→Mp3 (Detailed mapping). Below: rough correspondence — one-to-one role assignment. Above: DETAILED many-to-many correspondence — bridge mechanisms exercise specific substrate pair-surfaces, multiple bridges share the same surfaces (over-subscription). This is where the mapping becomes rich enough to derive constraints.

Constraint (Cn):

Phase transition: Cn1→Cn2 (Specific gates). Below: general sense that connected domains constrain each other. Above: SPECIFIC level thresholds identified — "bridge primitive X at level 3 is required for surface capability Y." This is where cross-domain analysis becomes predictive.

Step 4 — Dependencies

Ed → (nothing; foundation — edges are the basic unit)
Ch → Ed (you classify an existing edge)
Sb → Ch (substance depends on character — what you carry depends on edge type)
Mp → Ed (mapping requires knowing which domains are connected)
Cn → Mp, Sb (constraints require knowing both the mapping and the substance)

DAG:

Ed (hub — no dependencies)
  ├── Ch → Sb ──┐
  └── Mp ────────┴── Cn

Hub: Edge (Ed). Everything starts from detecting that a connection exists.

Terminal: Constraint (Cn). Constraints require both mapping and substance — you need to know HOW primitives correspond AND what content the edge carries before you can determine cross-lattice restrictions.

Two branches from Ed:

• Character branch: Ed → Ch → Sb (what kind of edge → what it carries)
• Mapping branch: Ed → Mp (how primitives correspond)

Both branches converge at Cn (constraints require both).

Depth: Maximum chain: Ed → Ch → Sb → Cn (depth 3, through Sb). Moderate.

Step 5 — Pair Enumeration

C(5,2) = 10 pairs.

Step 6 — Load Classification

Heavy pairs

Moderate pairs

5 heavy pairs of 10 (50%). Moderate-to-tight integration — consistent with the methodology being a structured analytical process.

Step 7 — Coherent Sub-lattice

Dependency constraints

Ed must be present. Given Ed:

• Ch needs Ed only
• Sb needs Ch
• Mp needs Ed only
• Cn needs Mp AND Sb

Enumeration

Valid subsets of {Ch, Sb, Mp, Cn} given Ed always present:

Valid non-empty: {Ch}, {Mp}, {Ch,Mp}, {Ch,Sb}, {Ch,Sb,Mp}, {Ch,Sb,Mp,Cn}.

Total including {} and {Ed alone}:

• {}: 1
• {Ed}: 1
• {Ed + valid}: 6

Total: 8 coherent subsets of 32 (2^5).

Filter: 8/32 = 25%. Moderate — between tight substrates and loose surfaces. The convergence of two branches at Cn (requiring both Sb and Mp) creates the filtering.

Step 8 — Build-up Sequence

Step 0→1: {} → {Ed}
  Detect that two domains are related. A proto-edge.
  "Biology and entity system seem to share structural features."

Step 1→2: {Ed} → {Ed, Ch}
  Classify the relationship. What KIND of edge is this?
  "This is a role-identification edge — both map to shared abstract roles."

Step 2→3: {Ed, Ch} → {Ed, Ch, Mp}
  Determine how primitives correspond across the edge.
  "G maps to encoding role, R maps to evaluator role, ..."

  OR (alternative branch):

Step 2→3': {Ed, Ch} → {Ed, Ch, Sb}
  Identify the edge's substance.
  "This realization edge has 6 bridge primitives: Code, Catalyst, ..."

Step 3→4: → {Ed, Ch, Sb, Mp}
  Both substance and mapping are known. Bridge primitives connected to
  specific domain pair-surfaces. Role mappings specified.

Step 4→5: {Ed, Ch, Sb, Mp} → {Ed, Ch, Sb, Mp, Cn}
  Derive cross-lattice constraints. Feasible regions computed.
  Specific bridge level gates identified. Unified manifestation positions
  constrained across connected domains.

Note: no single genesis transition for graph construction. Each step adds analytical capability. The most important transition is Sb2→Sb3 (substance gains internal structure — bridge primitives analyzed with their own pairs and core triads). This is when edge analysis becomes structurally rich rather than enumerative.

Step 9 — Load-bearing Compositions

Core triad

{Ch, Sb, Mp} — Character, Substance, Mapping.

"What is an analyzed inter-domain connection?" → The edge has a CHARACTER (what kind), carries SUBSTANCE (what content), and establishes a MAPPING (how primitives correspond).

All three pairs heavy:

• Ch-Sb: character determines substance ✓
• Sb-Mp: substance exercises domain primitives through mapping ✓
• Ch-Mp: character influences mapping style ✓ (moderate-to-heavy)

The Ch-Mp pair is borderline. Alternative core triad:

{Sb, Mp, Cn} — Substance, Mapping, Constraint.

"What does an edge DO?" → The edge carries SUBSTANCE, establishes MAPPING, and derives CONSTRAINTS.

All three pairs heavy:

• Sb-Mp: substance exercises domain primitives ✓
• Mp-Cn: mapping enables constraint derivation ✓
• Sb-Cn: substance determines constraint specificity ✓

This triad is more operationally focused — what the edge PRODUCES rather than what it IS.

The {Ch, Sb, Mp} triad has a borderline pair (Ch-Mp is moderate, not clearly heavy). The {Sb, Mp, Cn} triad has all three pairs clearly heavy: Sb-Mp ✓, Mp-Cn ✓, Sb-Cn ✓.

Core triad: {Sb, Mp, Cn} — the operational core. "What does edge analysis produce?" → Substance mapped to domain primitives, deriving cross-lattice constraints. {Ch, Sb, Mp} is a named composition (edge characterization) but not the core triad.

Named compositions

The full set as a quad

{Ch, Sb, Mp, Cn} — the complete edge analysis. Everything except bare edge detection. This quad IS Layer 2 of the methodology — a fully analyzed inter-domain connection.

Step 10 — Emergent Properties

Step 11 — Cross-Domain Patterns

11.1 Comparing graph construction to the other methodology layers

Observations:

• All three layers have moderate filters (17-30%) — tighter than surfaces, looser than information substrates
• Graph semantics is the tightest — more sequential logic in cross-graph pattern discovery
• Domain analysis and graph construction are similar in integration (47-50% heavy pairs)
• Each layer has a different hub: Pm (what you analyze), Ed (what connects analyses), In (what populates the graph)

11.2 How the three layers connect

Layer 1 (Domain Analysis)
  {Pm, Lv, Dp, Ix, Cp, Ps}
  ↓ produces: analyzed domain
  
Layer 2 (Graph Construction)
  {Ed, Ch, Sb, Mp, Cn}
  ↓ produces: connected, constrained graph of domains
  
Layer 3 (Graph Semantics)
  {In, Ar, Ty, Ab, Pt, Cv}
  → produces: patterns, abstractions, convergence
  → feeds back predictions to Layer 1

Layer 1 output (analyzed domain) is the NODE content. Layer 2 adds EDGES with content. Layer 3 operates on the populated graph as a whole.

Step 12 — Synthesis

12.1 What graph construction IS

Graph construction is a 5-primitive process for connecting analyzed domains through typed, substantiated, mapped, constrained relationships. Its core operation: detect edges (Ed), classify their character (Ch), identify their substance (Sb), establish primitive mappings (Mp), and derive cross-lattice constraints (Cn).

The two branches from hub Ed:

• Character branch: Ed → Ch → Sb (what kind of edge → what it carries)
• Mapping branch: Ed → Mp (how primitives correspond)
• Both converge at Cn (constraints require both substance and mapping)

This convergence structure is distinctive — both branches must be completed before the most valuable output (cross-domain constraints) becomes available.

12.2 The edge type question

The current methodology lists 5-7 edge types: realization, configuration, role-identification, enrichment, decomposition, plus feedback and selection (from biology analysis). Are these really distinct types, or are some reducible?

From this analysis, the CHARACTER primitive captures edge type, and the SUBSTANCE varies by character. This means:

• Edge types are classifications at the Character (Ch) level
• Each type determines expected substance
• The types ARE structurally distinct (realization has bridge primitives; role-id has mapping tables; configuration has parameter settings)
• Whether the list is complete is an empirical question — new types can be discovered (feedback and selection were added during the biology analysis)

12.3 Where unified manifestation connects

The unified manifestation concept uses graph construction's outputs. Specifically:

• Mapping (Mp) connects primitive vocabularies across domains, enabling a single entity to be positioned in multiple lattices
• Constraint (Cn) determines which cross-lattice positions are compatible, filtering the unified position space
• Substance (Sb) at realization edges creates the independent lattice positions that make unified manifestation substantive (bridge primitives exercise domain pair-surfaces independently)

The unified manifestation IS: an entity's Position (from Layer 1) evaluated across all connected lattices using Mappings and Constraints (from Layer 2). It's the natural endpoint of combining Layer 1 and Layer 2 for a specific entity.

Summary

Referenced by the model

Cited as a source by 2 model records (browse the model census):

• methodology-layer2 — domain methodology/sc1
• methodology — arrangement methodology/sc1