Canon 12 · Causal Lattice

Equation 12

Most outcomes do not descend from one cause. They emerge through a web of conditions.

Equation 12 defines the Causal Lattice as a network of nodes and weighted relations. Causes, conditions, gates, delays, feedback loops, witnesses, and consequences interact across time. The lattice helps prevent single-cause stories from replacing a more complex field.

Canon Identity

Equation record.

Number

Equation 12

Canonical title

Causal Lattice

Primary symbol

\( \mathcal{L}_{c} \)

Status

Codex-origin network framework

Function

Map interacting causes, conditions, gates, delays, feedback, and consequences.

Current version

Canonical web edition · 2026

Equation 12

The Causal Lattice

$$ \boxed{ \mathcal{L}_{c} = \left( V,\, E,\, W,\, \Tau,\, G \right) } $$

The Causal Lattice \( \mathcal{L}_{c} \) contains nodes \(V\), directed relations \(E\), relation weights \(W\), delays \( \Tau \), and gates or conditions \(G\).

Node update relation

$$ x_j(t) = f_j \left[ b_j + \sum_{i=1}^{n} w_{ij}\, g_{ij}(t)\, x_i \left( t-\tau_{ij} \right) \right] $$

The state of node \(j\) depends on its baseline \(b_j\), incoming node states \(x_i\), weights \(w_{ij}\), gates \(g_{ij}\), delays \( \tau_{ij} \), and node response function \(f_j\).

Plain Language

What Equation 12 means.

An outcome may depend on several conditions arriving together. A weak cause can become powerful when another gate opens. A delayed effect may appear far from its source. A consequence may feed back and strengthen the conditions that created it. The lattice maps these interactions without pretending every path is equally known or equally strong.

Nodes hold states

A node may represent a person, material, event, signal, rule, condition, decision, or consequence.

Edges carry influence

A relation indicates that change in one node may affect another under declared conditions.

Weights express strength

Some relations are stronger, more direct, better documented, or more repeatable than others.

Delays hide origin

A consequence may appear later, making its source difficult to recognize without a timeline.

Terms

Every symbol in Equation 12.

\( \mathcal{L}_{c} \)

Causal Lattice

The full network of nodes, relations, weights, delays, gates, and feedback.

\( V \)

Node set

The people, events, variables, materials, signals, rules, actions, or consequences in the model.

\( E \)

Relation set

The directed or undirected links representing possible influence or dependence.

\( W \)

Weight set

The strength, confidence, importance, or estimated influence assigned to each relation.

\( \Tau \)

Delay set

The time between a change in one node and its possible effect on another.

\( G \)

Gate set

The conditions under which a relation becomes active, reduced, delayed, or blocked.

\( x_j(t) \)

Node state

The measured, estimated, observed, or symbolic condition of node \(j\) at time \(t\).

\( w_{ij} \)

Relation weight

The declared strength or confidence of the path from node \(i\) to node \(j\).

\( g_{ij}(t) \)

Conditional gate

The rule controlling whether the path from \(i\) to \(j\) is active at time \(t\).

\( \tau_{ij} \)

Path delay

The time offset between source change and destination effect.

\( f_j \)

Node response

The way node \(j\) converts incoming influence into its next state.

Lattice Elements

Seven structures inside a causal map.

1 Cause

A source condition or event that contributes to change elsewhere.

2 Condition

A background state required for a relation to operate or become stronger.

3 Gate

A threshold or rule that opens, reduces, delays, routes, or closes a path.

4 Mediator

An intermediate node carrying influence between source and consequence.

5 Moderator

A factor that changes the strength or direction of another relation.

6 Feedback

A consequence that returns to alter an earlier node or relation.

7 Outcome

The observed state produced by the active network under current conditions.

Relation Types

Not every edge means the same thing.

Direct relation

A change in one node can affect another without an identified intermediate node.

Indirect relation

Influence travels through one or more mediators.

Conditional relation

The path operates only when a threshold, environment, permission, or state is present.

Reinforcing loop

A change returns through the network and increases the process that produced it.

Balancing loop

A consequence reduces, stabilizes, or counteracts the process that produced it.

Common-cause relation

Two nodes change together because a third node influences both.

Edge Confidence

Every path needs an evidence state.

$$ c_{ij} = \operatorname{Confidence} \left( O_{ij}, M_{ij}, R_{ij}, A_{ij}, U_{ij} \right) $$

Confidence in relation \(i\rightarrow j\) may depend on direct observation \(O_{ij}\), mechanism evidence \(M_{ij}\), replication \(R_{ij}\), alternative explanations \(A_{ij}\), and unresolved contradictions \(U_{ij}\).

Observed

The relation appears in the record, but mechanism may remain unknown.

Supported

Evidence and known mechanism make the relation plausible.

Replicated

The relation persists across repeated or independent tests.

Inferred

The path is suggested by the pattern but not directly observed.

Symbolic

The relation expresses meaning or correspondence rather than a physical mechanism.

Unresolved

The relation remains possible, disputed, incomplete, or underdetermined.

Feedback

Consequences can become new causes.

Reinforcing feedback

$$ x_{t+1} = x_t+\alpha x_t $$

Growth feeds further growth when \( \alpha>0 \).

Balancing feedback

$$ x_{t+1} = x_t-\beta(x_t-x^{*}) $$

The system moves toward target state \(x^{*}\) when \( \beta>0 \).

Delayed feedback

$$ x_{t+1} = f\left(x_t,x_{t-\tau}\right) $$

Earlier states continue influencing the present after delay \( \tau \).

Threshold feedback

$$ g(x) = \begin{cases} 0,&x<\theta\\ 1,&x\geq\theta \end{cases} $$

The loop activates only after threshold \( \theta \) is crossed.

Lattice Protocol

From event to causal network.

1 · Define the outcome

State the observed change without embedding a cause.

2 · Define the boundary

Choose the time range, place, system, participants, materials, and evidence sources.

3 · List candidate nodes

Include causes, conditions, mediators, moderators, gates, feedback, and consequences.

4 · Draw directional relations

Connect nodes only where a possible influence or dependence is being proposed.

5 · Label evidence state

Mark each edge as observed, supported, replicated, inferred, symbolic, or unresolved.

6 · Add weights and delays

Estimate relative strength, confidence, timing, and threshold conditions.

7 · Identify loops and common causes

Look for reinforcing cycles, balancing cycles, and hidden nodes influencing several outcomes.

8 · Test interventions

Ask what should change if one node, gate, path, or condition is removed or altered.

9 · Compare against witness

Check whether the lattice explains timing, variation, failed cases, and contradictory evidence.

10 · Revise and preserve Remnant

Keep the strongest surviving paths and archive rejected relations with reasons.

Worked Example 1

An artifact joint fails.

Outcome

A stone or structural component loosens during use.

Material nodes

Copper hardness, wire gauge, adhesive, stone shape, surface preparation, and joint geometry.

Use nodes

Movement, impact, moisture, temperature, storage, bending, and repeated wear.

Process nodes

Construction order, cure time, inspection, tension, and finishing method.

Possible loop

Small looseness increases movement, which increases wear, which further increases looseness.

Intervention

Change joint geometry, material, tension, surface preparation, or inspection schedule and compare later builds.

Worked Example 2

A housing dispute becomes prolonged.

Outcome

Repairs remain unresolved and conflict escalates over time.

Condition nodes

Property condition, repair urgency, documentation, communication quality, financial pressure, and legal understanding.

Gate nodes

Notice requirements, access, response deadlines, inspection, proof, and agency involvement.

Feedback loop

Delayed repair increases frustration, which worsens communication, which further delays cooperation.

Balancing intervention

Written timelines, precise repair requests, neutral inspection, clear access windows, and documented response paths.

Claim boundary

The lattice organizes contributing conditions without deciding legal fault by itself.

Worked Example 3

A mobile menu fails across every theory page.

Outcome

The navigation icon appears, but tapping it does not reveal the menu.

Shared nodes

Header markup, theory.js, theory.css, selectors, loading order, and responsive state.

Possible paths

Missing event listener, selector mismatch, JavaScript error, absent open class, or CSS that never displays the menu.

Common-cause clue

The defect appears across many pages using the same shared assets.

Best intervention

Repair shared JavaScript and CSS, then test one page across mobile and desktop before updating page-specific markup.

Remnant

The existing HTML button and navigation structure remain useful if the shared behavior is repaired.

Worked Example 4

A listener reports a strong response to a sound field.

Outcome

The listener reports increased focus, discomfort, calm, or another noticeable change.

Audio nodes

Frequency content, volume, rhythm, duration, phase, room acoustics, headphones, and device response.

Human nodes

Expectation, fatigue, mood, prior experience, task, attention, and current environment.

Context nodes

Instruction, symbolism, time of day, setting, interruptions, and social meaning.

Intervention

Compare muted, simplified, randomized, or repeated sessions while preserving consent and safe levels.

Proportionate conclusion

The response is a real witness. Its cause may be distributed across several nodes rather than one frequency alone.

Scope

What Equation 12 does and does not do.

It does

Organize interacting causes, conditions, gates, delays, feedback, and consequences into a visible network.

It does not

Prove every drawn edge, calculate exact causal strength without data, or replace domain-specific analysis.

It supports intervention

The lattice helps identify leverage points where changing one node or gate may alter the larger outcome.

It preserves uncertainty

Weak, inferred, symbolic, and unresolved relations remain visibly different from replicated mechanisms.

Failure Modes

How a causal lattice becomes a convincing fiction.

Edge inflation

Every correlation, coincidence, or narrative connection is drawn as causal.

Weight without evidence

Strong numerical weights create an appearance of precision unsupported by data.

Hidden common cause

Two linked events may both be produced by a third condition that remains outside the map.

Loop as destiny

A reinforcing pattern is treated as inevitable even though gates and interventions can change it.

Boundary blindness

Important external conditions are excluded because the frame was drawn too narrowly.

Blame lattice

A complex outcome is reduced to assigning moral responsibility to one person without sufficient evidence.

Ethical Boundary

A causal map cannot become a weapon of accusation.

$$ \mathcal{L}_{c}^{\,\mathrm{allowed}} = \mathcal{E}_{9} \left[ \mathcal{L}_{c}^{\,\mathrm{proposed}} \right] $$

The lattice must preserve the distinction between contribution, correlation, responsibility, motive, and established cause. Privacy, consent, proportion, and correction remain active when real people or high-consequence decisions enter the map.

Do not convert suspicion into an edge

A relation involving a person should be supported and proportionately described.

Do not hide uncertainty

Inferred and unresolved paths must remain visibly different from established relations.

Protect private nodes

Not every relevant personal detail belongs in a public causal map.

Preserve intervention rights

People affected by a map should have a path to challenge, correct, or contextualize material about them.

Practice

Equation 12 lattice card.

What is the outcome?

State the change without embedding a cause.

Which nodes belong?

List causes, conditions, gates, mediators, moderators, feedback, and consequences.

Which edges are supported?

Label observed, supported, replicated, inferred, symbolic, and unresolved relations.

Where are the delays?

Record time offsets between source changes and later consequences.

Where are the loops?

Identify reinforcing and balancing feedback paths.

What intervention tests the map?

Change one node, gate, path, or condition and compare the outcome.

Canon Connections

The Causal Lattice joins frame, witness, coherence, and update.

Equation 2

Witness

Edges begin as situated observations before they become causal claims.

Open Eq. 2 →

Equation 3

Harmonic Gate

Conditional gates determine when paths open, weaken, delay, or close.

Open Eq. 3 →

Equation 10

Inverse Resonance Ladder

Candidate causes from the ladder become nodes and relations in the lattice.

Open Eq. 10 →

Equation 11

Projection Frame

The frame determines which nodes and edges become visible.

Open Eq. 11 →

Equation 13

Coherence

The lattice is tested for alignment among evidence, timing, structure, and consequence.

Open Eq. 13 →

Equation 14

Update Rule

New witness changes node states, edge weights, and the next system state.

Open Eq. 14 →

Revision Record

Canonical web edition.

This edition formalizes Equation 12 as a weighted, gated, delayed causal network. It defines node states, relation types, feedback, evidence labels, a ten-step lattice protocol, and the ethical limits required when causal maps affect real people or high-consequence decisions.

Continue Reading

Next, measure how well the lattice holds together.