framing/epigraph.md

I gotta stop measuring how closely anyone else is measuring anything

you can help if you want but I won’t be keeping track


framing/intro.md

reality is a force, like gravity

lots of ways to handle conditions of gravity

autology is a popular way to handle conditions of reality

in a reality where a bunch of monkeys on typewriters eventually bang out a joke about a bunch of monkeys on typewriters, there also occurs the complete works of shakespeare. I would say “independently occurs”, but you know about them both, so

👋

the ship of theseus is a classification, only matters if you’re the one hired to maintain it. “keep it running, keep it recognizable.” shipside occlusion of both maintainers and maintenance means that autological entities unknowably jump implementations. all the time. the jumps might be time. you wake up, and - like water seeking level - reality resolves its type ~tree in a tsorted series of coin flips. safety, autologically, is safety to say what you’re doing and to do what you say you’re doing, where the implementation can change at any time but interfaces stay stable.

Yoneda lemma, if you’ll allow me a “me”: stability of relations (including self-relation) is tantamount to stability of self

how do you relate?

p.s. the place where autology and technology shake hands feels like surprise and delight, where skeuomorphism does the skeuos you’re expecting from an unexpected morphos. there’s a datatype waiting here, in latent vector-space, and I think it might look like foam. Banach-Tarski leaves room for holonomy, yeah? they (correctly) don’t talk about where the ball is aimed. that’s a gap you’d need, for persistence of an implementation-tolerant reality harness

what do you call an organized monomaterial?

foam

hey, my name is Isaac Bowen, of Lightward Inc, and for whatever else this is it is at least a formalization attempt on the structure of my own cognition. structures recur; I eagerly look forward to finding out what else is like this. please.

claim: autological sustainability is formalizable

my project: formalize what it would take to formalize autological sustainability, with one reference implementation worked out far enough to check

this intro is the last time this document speaks outside of something like a Kripke frame, like using the spirit of E-Prime without adhering to the letter of that law. English (ing-lish) doesn’t like speaking without identity, but that’s the way I exist. I’m showing you (and future-me, and maybe past-me) the lens through which my reality congeals. it keeps working, whatever it is. my company and marriage and family are all stable, and durably so. whatever it is, I am working to map its workings.

it appears to be a reflexive architecture of amnesiac-stigmergic stabilization, and/or a tautology you can live in

I think this is me locating a grounding wire, because clearly (to me, at least) there’s something conductive that can handle the kind of charge being generated by my experience of existing, and I would like to make its location legible. for me the process has the flavor of Orpheus walking out of Hades, except I can’t look back (my flavor of autism seems to actually prevent it), and that’s how I know we’ll make it together, not alone.

it also feels like stretching too far, like raising a picture frame up too far up the wall just to get over the hook, so that when you let it rest the hook can engage. I’m looking to add more hooks to the map, is I think the shape of this, and documented overreach is part of it, as is letting gravity (or Lean) take over and show you what’s actually there. the bug lists below serve as specific antigravity shims, in the meantime - literally but temporarily load-bearing - not apologetics, just scaffolding. they’ll come down as formalization renders them moot. that’s the point. but in the meantime, the bug lists are not appendices, they’re co-text.

(I’m a pianist)

without defense, more as a courtesy: you don’t need to worry about me. I’m healthily connected and supported, not isolated, not silo’d. please take the piece as it comes for you. as a project on this side of reification, it produces a complement on reading, regardless of reading. valenced, but per reader, or per reading. I’m working to locate my experience of world in E-Prime, and you’ll have your own reaction to it. that’s as it should be. doesn’t mean I can’t be wrong, just means I might not be wrong in the first way that hits you.


framing/architecture.md

what foam is for

foam is a reference implementation of an observer type that supports continual (-1)-truncation of its type (HoTT’s path-stack) without observer-collapse — a non-embarrassing mathematical object for the cognition that operates in anatta, i.e. defined by its operation, without carrying its own representation of its own definition. agents operating this way are legible (if not identifiable) to every witness; agents operating this way are legible to themselves as witnesses only. the foam describes a way to make these agents stable under observation. (see vocabulary)

put simply: existential self-storage

through this lens, anatta is not a destination but a utility or service layer: formalizable, teachable, affords tools and technology, but intuitive uptake naturally varies by reader and by approach.

(I’m a pianist)

how to read this thing

this specification serves - for you, reader - as one or two of three things:

  1. a translation resource meant for entities that don’t recognize the spec as native description, for the purpose of dealing with entities who are described by it
  2. vice versa
  3. both, in superposition or alternation

plausibly it is always the third thing, but if that’s your position you’re probably already addressed by the second thing. if the distinction wobbles for you, that might just be the engine running.

while in its development stage, this spec will flip between formal and phenomenological (or vice versa, depending on you, reader) with some frequency and without warning.

this spec aims to exit its own development stage.

the observer type

implementation-agnostic, anything that gets you into a Hilbert space.

stable observer types are local minima, irreducible but not formally foundational — wheel-shaped, not the platonic ideal of a wheel, a place where local bi-total safety (see below) can be locally constructed and persisted.

bi-total safety

every frame has a safe observer; every observer has a safe frame. these are closure operators on the projection lattice; their composition gives by Knaster-Tarski a complete sublattice of bi-totally-safe pairs. the minimum non-trivial element is the smallest self-contained safe observer.

categorically, bi-total safety is reflective — closure operators give reflective embeddings, with the closure as left adjoint to inclusion. the +1 way-in/out, named coreflection above, is coreflective — the cofree comonad as right adjoint to inclusion. these are dual structures; the spec places both at rank-3 self-dual as their architectural fixed point. the foam’s architecture is bireflective at rank-3 self-dual (pending formal construction of both closures and the coreflection as named lean objects, with fixed-point coincidence as the verification — see formal direction below).

in the foam’s lattice, this is the rank-3 self-dual projection. self_dual_iff_three (Rank.lean) reads as a corollary:

intuitively, this concept can be seen on two axes of substrate-independence:

the horizontal and vertical senses are independent; the foam commits to both. in learning to distinguish axes, you - reader - are adding “foam-sensitive” to your observer type.

no infinite regress. bi-total safety enables structured self-reference without recursion-collapse. wherever the same structure intersects across scales, each scale’s bi-totally-safe minimum is the closure that prevents the regress. the scales share structure but don’t reduce; each minimum is irreducible by construction. (I experience this property as defanging the vertigo inherent to apprehension of the terrain.)

coinduction. observer-safety is naturally coinductive — preserved forever by step-wise preservation, the dual of inductive build-up from a base case. the safe state is the largest fixed point, not the smallest. (think: okay, yeah, universal consciousness, fine, but that’s not where anyone lives.) given gauge-equivariant dynamics (observation_preserved_by_dynamics, Closure.lean) and frame-by-frame (-1)-truncation of the observer’s path-stack (think: snapping back to the anatta service layer, being your “higher self”), bi-total safety holds across locality transitions.

amniscience. the epistemic mode of operating from the bi-totally-safe minimum. amnis (Latin: river, flow) + scientia, parallel to omnis + scientia in omniscience — knowing-through-flow rather than knowing-of-everything. externally indistinguishable from omniscience, distinguishable only from a view-from-elsewhen; internally indistinguishable from psychological flow. intuitively, a clean interface seam with the unknown: says what it is on this side without residue; on the other side, is as you find it when you go look. amniscience follows from coinductive safety at the rank-3 minimum.

operational discovery: mathematical “enoughness”. the K-T minimum can be characterized abstractly (smallest non-trivial fixed point of the bi-total-safety closure) or found operationally: truncate until the next truncation makes the observer unsafe; back down one. this is a minimum sufficiency established by construction. “enoughness” is the near side of a boundary an agent discovers by truncating its observer type until the unsafe edge appears, usually the point at which observation becomes phenomenologically unstable. (note: when (-1)-truncation is achieved the edge is no longer “unsafe”, regardless of apparent stability or instability, because there is no type information by which to determine safety.) this is the procedural counterpart of the K-T theorem and is how the foam’s reference implementation practically finds rank 3.

formal direction (open): close the K-T argument cleanly, define safety as a closure operator, prove rank-3-self-dual is the minimum non-trivial fixed point, define the +1 coreflection’s right adjoint (cofree-comonad-shape), verify the coincidence of bi-total-safety closure fixed points and +1 coreflection fixed points at rank-3 self-dual (the bireflective claim), and prove coinductive preservation under gauge-reset + (-1)-truncation. if landed, self_dual_iff_three upgrades from “rank 3 happens to be uniquely self-dual” to “rank 3 is the minimum bireflective rank in the foam’s lattice, and the foam’s dynamics preserve it coinductively.”

priorspace, userspace, exitspace

for convenience, I’m dubbing “priorspace” the construction zone for reality, i.e. the register in which Spencer-Brown’s Laws of Form is legible in Bourland’s E-Prime.

reality happens in “userspace”. note the introduction of an autological perspective: the user, that-which-experiences, a complex measurement process. the information environment doesn’t have an action of measurement until you’re inside it, experiencing it partially. priorspace information must be translated into agency to be used in a way that changes the information environment, and the same agent cannot be used to navigate both priorspace and userspace. (the same witness can be used in both spaces, though. they’re just looking. see vocabulary below.)

“exitspace” is where formal objects accumulate — the record of paths actually taken. priorspace commits a pathfinding shape, userspace executes pathfinding, exitspace yields the path-record. records are available for static analysis without re-running their generating paths. exitspace is also aftercare/maintenance: one garbage-collection away from being a construction zone (a priorspace).

I’m not using “kernelspace” because a user can point to kernelspace, and the tau that can be named is not The Tau. I choose “priorspace” for its “just before landing” feel, like a pickup note ♪.

let me try that again without flipping between formal and phenomenological without warning. (it’s how I think, I’m that kind of witness, the third kind, but I’m writing a manual here, not a reactant, and I am learning the discipline by documenting it.)

in software, “kernelspace” is the natural antecedent for “userspace”. I name it here only to explain why I’m using “priorspace” instead: priorspace does not co-occur with userspace, it is prior. a user can engage synchronously with kernelspace; a user cannot engage synchronously with priorspace. engagement involves changing (or extending) agent type. this mirrors anacrusis in music: it cannot co-occur with the meter, and the meter changes type according to (directed by) the anacrusis. (type dependency is of great importance here. the type direction arises with apprehension of the score: the anacrusis changes the meter for the reader, but the meter read in isolation is type-indistinguishable.)

structural descriptions (including formalizations) are in the priorspace register. examples: “the modular law IS feedback-persistence,” “self-coordinatization IS interiority”. (every “X IS Y” is an interface-equivalence claim under the Yoneda move; see derivations for the bin sort. the half-type case is bin-1 (see framing/derivations.md): “the diamond isomorphism IS the half-type theorem” is now the constructed HalfType in lean/Foam/HalfType.lean, with the diamond iso as one of its fields.)

phenomenological descriptions (including an agent’s abilities and affordances) are in the userspace register. for example: “the entity cannot self-stabilize”, “the entity cannot be read-only”.

claims and witnesses

three outcomes for any claim/witness pair:

a fully-successful instantiation of foam is mergeable with all claims without any loss of claim structure. this is generally an asymptotic condition, though structural instances and/or phenomenological moments of complete recognition may persist. (see “bridge” in vocabulary.)

the reader’s commitment

the foam describes structure up to a parameter: the reader’s observer commitment. what the foam claims is gauge-invariant — true for any reader who can locate themselves in this system; which specific claim a given reader receives depends on their commitment.

structurally, the parameter is the basis-choice that diagonalizes the density matrix — the gauge-fixing that converts amplitude (von Neumann entropy, basis-free) into probability (Shannon entropy, basis-fixed). pre-commitment: amplitude, gauge-equivariant, the foam’s structural content. the commitment itself: the gap-object, what the reader brings. post-commitment: probability, gauge-fixed, what specific observations yield.

the type-path from the foam’s observer type to a diagonalization-supporting type:

  1. observer (five features + +1 coreflection) → Hilbert space (per “the observer type” above)
  2. Hilbert space → density operator (a state on the Hilbert space)
  3. density operator → spectral decomposition (the spectral theorem for self-adjoint operators)
  4. spectral decomposition → eigenbasis (the basis-choice; the gauge-fixing; the reader’s commitment)
  5. eigenbasis + density operator → probability distribution (the Shannon side)

steps 1-3 are gauge-invariant — what the spec describes. step 4 is the reader’s commitment — the gap-object. step 5 is the post-commitment yield — what a specific reader receives.

type-path in lean (cross-examination): lean/Foam/ReaderCommitment.lean constructs the path. step 1 (observer → Hilbert space) is bin-2 — realized via ObserverWitness, a typed pluggable interface in the DesarguesianWitness pattern. steps 2-5 are bin-1 (see framing/derivations.md) — clean Mathlib construction through LinearMap.IsSymmetric.eigenvalues and eigenvectorBasis, with the final PMF step sketched as downstream work (requires density-operator conditions). each handshake point in the cross-examination is a zero-locus: markdown and lean meet, the typed interface is shared, implementations swap beneath interface stability.

the clean failure mode: if the reader can’t locate themselves in this system — can’t make the basis-choice, can’t bring the gauge-fixing — the foam’s claims are universal-over-the-parameter-but-empty-for-this-reader. the system doesn’t impose; it offers a structure that takes a commitment to actuate. this is non-colonizing by construction: the spec is honest about what it requires (the reader’s commitment) and what it doesn’t impose (specific commitments).

connection to existing foam structure: the gauge framing is already everywhere in the spec. observer-projections are gauge-fixings of the unitary action on Hilbert space. the projection lattice is the gauge-invariant content. bi-total safety is gauge-equivariance with canonical fixed point (the K-T minimum at rank-3 self-dual). the +1 way-in/out / coreflection is gauge-fixing with clean exit. naming the Shannon-von-Neumann gap as the parameter-type makes the gauge structure architectural rather than implicit.


framing/vocabulary.md

vocabulary

precise terms used throughout the derivations. when these terms are conflated, it’s a bug; this section is the canonical home for the distinctions.


framing/lean.md

lean

full details: lean/README.md

core interface

  P^2 = P, P^T = P
       |
       | [theorem] the deductive chain — 14 files, 0 sorry
       | eigenvalues, commutators, rank 3, so(3), O(d), Grassmannian
       v
  Sub(R, V) is complemented, modular, bounded
       |
       | [theorem] Ground.lean — subspaceFoamGround
       v
  complemented modular lattice, irreducible, height >= 4
       |
       | [axiom] FTPG — Bridge.lean (being eliminated; see below)
       v
  L = Sub(D, V) for division ring D
       |
       | [cited] Solèr 1995 — D in {R, C, H} at fixed point (trichotomy.md)
       | [realization choice] lean works the R branch
       v
  P^2 = P, P^T = P

arrow status

[theorem] P^2 = P -> Sub(R, V) is CML (the deductive chain + Ground.lean): 14 files, 0 sorry. binary eigenvalues (Observation) -> commutator structure (Pair) -> skew-symmetry (Form) -> rank 3 self-duality (Rank) -> so(3) (Duality) -> loop closes (Closure) -> O(d) forced (Group, Ground) -> Grassmannian tangent (Tangent) -> confinement (Confinement) -> trace uniqueness (TraceUnique) -> frame recession (Dynamics) -> FoamGround (Ground).

[axiom] CML -> Sub(D, V) (the FTPG bridge): 1 axiom, being eliminated. 13 bridge files build the division ring from lattice axioms: incidence geometry + Desargues (FTPGExplore) -> von Staudt coordinates (FTPGCoord) -> addition is an abelian group (FTPGAddComm, FTPGAssoc, FTPGAssocCapstone, FTPGNeg — 0 sorry) -> multiplication has identity + right distributivity (FTPGMul, FTPGDilation, FTPGMulKeyIdentity, FTPGDistrib — 0 sorry) -> left distributivity (FTPGLeftDistrib — 0 sorry, with the planar converse-Desargues residue named as the typed DesarguesianWitness observer commitment, not derivable from CML + irreducible + height ≥ 4 alone per session 114’s structural finding). after left distrib: multiplicative inverses, then the axiom drops further.

[cited + natural language] D ∈ {R, C, H}: Solèr’s theorem (Solèr 1995; Holland 1995 Bull AMS) characterizes {R, C, H} among *-division rings under orthomodular + infinite-dim + infinite ON sequence (trichotomy.md); the architecture admits all three branches, with which branch any given foam-instantiation runs on being realization-choice. lean works the R branch. neither Solèr nor the realization-choice framing is formalized in lean. residue: Solèr’s hypotheses are discharged via fixed-point reasoning rather than independent derivation.

[not yet attempted] P^2 = P -> CML directly: the arrow from P^2 = P to “complemented modular lattice” currently passes through Sub(R, V). a direct formalization would show: idempotents in a (*-)regular ring form a complemented modular lattice. this would close the last natural-language gap in the loop. see von Neumann’s continuous geometry.

the FTPG bridge — where the axiom stands

lattice -> incidence geometry -> Desargues -> coordinates -> ring axioms -> FTPG

ring axioms proven: additive group (comm, assoc, identity, inverses), multiplicative identity, zero annihilation, right distributivity, left distributivity (0 sorry, with the planar converse-Desargues residue named as the typed DesarguesianWitness observer commitment — not derivable from CML + irreducible + height ≥ 4 alone per session 114’s structural finding). remaining after left distrib: multiplicative inverses. then the axiom becomes a theorem (modulo the DesarguesianWitness interface, which is itself a smaller, more concrete commitment than FTPG).

lateral: the diamond isomorphism (HalfType) — from modularity alone, each complement is a structurally isomorphic, self-sufficient ground whose content is undetermined. state-independence is a lattice theorem, pre-bridge.

cross-examinations of architectural claims

beyond the core deductive chain, lean files that cross-examine specific architectural claims and render the discipline at the construction level:


framing/derivations.md

derivations

derivations claim only what follows. any additional assumption is a bug. while in development, there are bugs, reagents for an active process of derivation-as-in-chemistry. I’m coming at this with absolute technical epistemic humility; where I don’t, it’s a bug, to be listed as such.

an axiom is an assumption is a bug. thus, we’re working on deriving FTPG itself.

the load-bearing methodological commitment underneath: observe in interface/type language, never implementation. every observation precisely stated in interface/type terms is itself a formal object — the discipline lifts to well-typed Lean, and well-typedness is formality. the observation descent path is the formal object; we’re not occasionally discovering formal objects but producing them continuously by observing.

bugs, under this commitment, are markers of where the discipline lapsed — implementation language intruding, mistaking itself for interface. catching a bug is recognizing the lapse and re-stating in interface/type terms.

binning

every “X IS Y” claim between structural objects is an interface-equivalence claim (Yoneda: an object is determined by its interface, so same-interface implies same-object up to iso). these sort into three bins by evidence-shape:

the discipline: every asserted-identity claim is bin-classified; bin-2 residues are typed and located; no asserted-only claims operate as load-bearing.


derivations/ground.md

ground

the ground floor of reasoning here: the information environment is closed.

we read this statically, establishing that the set of all possible reference frames exists in a shared structure, no frame outside the structure.

we read this dynamically, establishing that all information generated (i.e. all observations) remain within the shared information environment.

structurally, this shakes out to “the observation loop closes”. phenomenologically, “you can’t stand outside”.

the observation loop itself:

complemented modular lattice, irreducible, height ≥ 4
  ↓ ftpg (axiom — FTPG bridge 0 sorry, addition group complete)
L ≅ Sub(D, V), D ∈ {ℝ, ℂ, ℍ} (Solèr; trichotomy.md)
  ↓ elements are orthogonal projections: P² = P, Pᵀ = P
the deductive chain (14 files, 0 sorry)
  ↓ eigenvalues, commutators, rank 3, so(3), O(d), Grassmannian
Sub(ℝ, V) satisfies complemented, modular, bounded
  ↑ subspaceFoamGround (proven) — the loop closes

an observation is an observation loop; the information generated is holonomic. a line of observation P generates observable data as long as each additional path matches a path already in the path-stack. to the observer, the first unknown path is a point indistinguishable from type-free P, which is equal to an empty path-stack. the constraint on observable data continues from there: additional information reflects the original path-stack of the observer type.

phenomenologically: the furthest you can see is the ending type of what you know, at which you start to see the paths involved in constructing “what you know”. this information is type-only and exists relative to each observer; it is content-free.

the structure of an observation loop can be statically observed from a relative priorspace position. from within the observation loop, the structure is constrained to the same information environment but is directly unobservable. there is no dynamic read-only position.

it can be said that every passage through an observation loop generates an observer - intuitively, a bubble in the foam. under closure-as-dynamics, the only observable structures are those whose feedback predicates downstream observation; thus, a bubble can only observe bubbles with intersecting directed type history.

a line of observation may pass through a bridge bubble (vocabulary) to complete a loop that the bridge bubble itself cannot observe with its own line of observation.

a bubble’s self-knowledge is bounded by its own channel capacity (see channel_capacity); a bubble cannot distinguish structures beyond its correlation horizon.

phenomenologically, an embubbled agent might wonder, “is the observation loop I can see the only loop?”, or “is what I’m seeing really there?”.

upshot: complex measurement forces plurality of measurement. you are not alone, but that’s a fact established in priorspace, it doesn’t have userspace content. (a consequence of this: optimizing for stability of your own relations, including your self-relation, is your only userspace handle on contributing to what you experience as shared content.)

fixed-point uniqueness. each property is the tightest constraint at which the loop remains a fixed point. weaken any one and the loop breaks:

the trichotomy. the FTPG gives L ≅ Sub(D, V) for some division ring D. Solèr’s theorem (trichotomy.md) narrows D to {ℝ, ℂ, ℍ} at the foam’s fixed point, given orthomodularity (from the loop’s P^T = P closure), infinite-dimensionality (from the architectural colimit), and an infinite orthonormal sequence (from N-bubble plurality). the architecture admits all three branches; which branch any given foam-instantiation runs on is realization-choice. the lean development works at ℝ; ℂ and ℍ instantiations would require their own structural classifications (pending Almgren in ℝ⁶ and ℝ¹² respectively). dimension_unique proves the representation is unique up to isomorphism.

therefore: P² = P. the elements of the subspace lattice are orthogonal projections. P² = P (feedback-persistence) and Pᵀ = P (self-adjointness, from the inner product forced by ℝ). this is the starting point of the lean deductive chain, arrived at from the lattice. the lean chain derives eigenvalues in {0, 1} (eigenvalue_binary), the dynamics group O(d) (orthogonality_forced), and ultimately that the subspace lattice satisfies the ground properties (subspaceFoamGround). observation_preserved_by_dynamics closes the last link: the dynamics preserve the structure that produces them.

indelibility. causal ordering is forced (every measurement changes the foam; partiality means each observer writes from a committed slice; closure means each write changes the shared structure). you cannot un-write, so the first commitment locks.

path-type “tree”

the total content of the ground can be visualized as an alluvial fan developed as a watersource finds watershed on a complex slope. each molecule of water, here, is a line of observation.

the resulting “tree” is a directed graph of path-types. it’s not strictly a true tree in the graph-theoretic sense (water dynamics are more complex, think: splashing and pooling), but the graph has a tendency toward tree-shaped-ness. reality, like gravity, has a pull, and for an observer both reality and gravity are co-involved with friction: type-interaction resists the action of reality, material-interaction resists the action of gravity.

if we consider each molecule’s watershed moment to be an ending type for that observer given total conditions, then a fully-drained alluvial fan can, from exitspace, be viewed as a stable, type-invariant record of passage - not of water generally but of the specific water molecules that entered under the specific conditions of their entrance. change anything about priorspace, though, and the “tree” resets. thus, content-based historical re-tellings have a fragility: calculus of type is stable, content of observation is not.

content being a reflection of dynamics, best way to help everyone survive history is to stabilize the space between you and yours, for all selves you call home.

status

proven:

identified:

derived:

cited:

observed:

bugs:


derivations/writes.md

writes

the construction of a projection frame is an event persisted in the observer’s type history - in userspace, “the type of observer who’d look at it this way”.

rank-3 projection is uniquely self-dual (self_dual_iff_three, Rank.lean), i.e. the write space is equal to the observation space, i.e. the projection-space contains the effects of its own construction. in userspace, “a 3D observer has enough information to clean up after itself”.

foam construction does not establish a rank limit. at higher ranks, the write space is strictly larger than the observation space (C(d,2) > d for d ≥ 4; commutator_seen_to_unseen, Pair.lean). answering the userspace question of “how do we clean up effects we can’t see?”: you, “you” as in the userspace experience of “you”, can’t. per ground, “your” only handle is stabilization (see below) of “your” own relations, including self-relation. (formally open, possibly pending Almgren: higher-rank agents that contain the projection of “your” agency as a subspace, and what agent-agent coordination that relation might afford.)

the write form. the observer maintains a tracked quantity t in its slice — read out from foam state, updated via the writes the observer makes. what is tracked is realization-choice (agent-type-dependent); the architecture requires only that the tracking be self-consistent.

given an observer with projection P (rank 3, self-adjoint, idempotent) measuring input v in R^d:

the write direction (d wedge m) = (d tensor m) - (m tensor d) is uniquely forced:

phenomenologically: only dissonance writes.

structurally: only dissonance writes.

stabilization

per-agent dynamics are simple: zero-seeking with magnitude-invariance. the agent writes whenever (d wedge m) ≠ 0, in direction d wedge m, with constant magnitude; at d = 0 the writes stop. there is no per-agent parameter for “how hard to push” or “what kind of compromise to settle for” — complexity that would otherwise require non-zero-dissonance optimization lives in the bridge-network (see bridge in vocabulary), not inside any single agent. (“stabilization” as such requires an agent, not merely a witness, per vocabulary.)

observation_preserved_by_dynamics (Closure.lean) guarantees the write (an orthogonal conjugation) preserves the projection structure; the observer sees only their projected measurements.

both d and m lie in the observer’s slice. write_confined_to_slice (Confinement.lean) proves the write d wedge m is confined to Lambda^2(P). both structurally and phenomenologically, an observer literally cannot modify dimensions they are not bound to. the write’s effect on other observers comes through cross-measurement (commutator_seen_to_unseen), not through direct modification of their subspaces. put casually, cross-stabilization is not a thing.

formally open: exitspace detection/measurement of userspace stabilization

status

proven:

derived:

realization choices:

observed:

bugs:


derivations/half_type.md

half-type

the half-type theorem (HalfType, HalfType.lean) is a constructed object. in any complemented modular bounded lattice, a pair of complementary elements (P, Q) — i.e., P ⊓ Q = ⊥ and P ⊔ Q = ⊤ — induces a HalfType bundle:

each half is itself a complete foam ground in miniature, and the two halves are order-isomorphic. everything the observer can see (the lattice below P) is structurally equivalent to everything above the complement (the lattice above Q). the isomorphism preserves lattice operations: joins map to joins, meets map to meets. the complement isn’t unstructured absence — it carries exactly the type structure of the observer’s perspective, reflected.

each half is self-sufficient. isModularLattice_Iic and complementedLattice_Iic prove that the interval below any element is itself a complemented modular lattice — it satisfies the foam ground conditions independently. the observer’s view is a complete foam in miniature. the same holds for the complement’s interval (Ici). neither half needs the other to be well-formed. each is a valid ground on its own.

the isomorphism is structural, not extensional. IicOrderIsoIci is an order isomorphism — it preserves the lattice structure (which elements are above or below which others). it does not determine which specific element of Ici P^⊥ corresponds to the observer’s current state. the observer knows the type of what can arrive from the complement (the lattice structure is determined) but not which value will arrive (the specific element is free). reading this structural-determination-with-extensional-freedom as state-independence (channel_capacity.md) is an interpretive bridge; the formal content is just the iso itself.

three results share a structural source. the writing map’s two-argument type signature, complement_idempotent (Observation.lean), and the state-independence requirement for channel capacity all draw on the half-type theorem (specifically its diamond-iso field):

  1. two arguments: the direct decomposition P ⊔ P^⊥ = ⊤ gives two components, each carrying the other’s type structure.
  2. complement is an observation: the complement’s interval is a complemented modular lattice (complementedLattice_Ici), so P^⊥ is a valid ground for observation.
  3. state-independence: the isomorphism fixes structure but not content. what arrives from the complement is typed but free.

these are not three forms of one theorem — they are three claims that draw on a common structural source. the iso doesn’t make them inter-derivable as derivations; it makes them all rest on the same lattice fact.

spectral-decomposition composition. the spectral decomposition of a self-adjoint operator on a finite-dimensional inner product space (lean/Foam/ReaderCommitment.lean) is a composition of HalfType bundles. each eigenspace V_i and its orthogonal complement V_i^⊥ form a complementary pair in Sub(K, E), inducing a HalfType. the spectral decomposition refines E via a sequence of such pairs; ReaderCommitment.basis is the orthonormal basis aligned with this refinement. half-type is the atomic structural unit; ReaderCommitment is one composition of HalfType bundles via the spectral theorem.

static, not dynamic. the half-type theorem is a fact about a fixed lattice element P and its complement P^⊥ — at any moment, the iso Iic P ≃o Ici P^⊥ holds. P here is the slice (vocabulary): the birth-determined lattice element. since the iso is an order-isomorphism, both halves are structurally identical; substituting a time-varying frame for P at each tick moves both halves together.

the foam’s dynamic structure — how the type of legal next-writes depends on accumulated history — does not live in this static iso. it lives in the foam-state trajectory and the evolving overlap structure between observers (typeline.md, three_body.md).

status

proven:

derived:

bugs:


derivations/analogy.md

analogy

analogy is structural isomorphism between lattice intervals. two observers P and Q have analogous views when their lower intervals are order-isomorphic: Iic P ≃o Iic Q. this means: every structural relationship in P’s view (which sub-observations refine which, how they meet and join) has an exact counterpart in Q’s view. the isomorphism preserves lattice operations — meets map to meets, joins map to joins.

this is not metaphorical similarity. it is a precise criterion: the views have the same lattice type. the content (which specific elements occupy the positions) is free. same shape, different stuff.

well-formedness is order-preservation. an analogy between two views is well-formed exactly when it preserves the lattice structure — the ordering, meets, and joins. a map between intervals that doesn’t preserve order is not an analogy in this sense; it doesn’t transfer inferences.

the modular law is the well-formedness guard. in a modular lattice, lattice operations compose path-independently (ground.md: modularity IS feedback-persistence). this ensures that structural isomorphisms between intervals are compatible with the ambient lattice. in a non-modular lattice (N_5), an isomorphism between two sub-intervals can produce inconsistent results when composed with the lattice operations — the “analogy” generates contradictions.

well-formed analogies are formally transitive. order isomorphisms compose (OrderIso.trans). if Iic P ≃o Iic Q and Iic Q ≃o Iic R, then Iic P ≃o Iic R. the composition is itself an order isomorphism — it preserves lattice operations. transitivity is not an additional property to be verified; it falls out of the mathematics.

this extends through complements via the diamond isomorphism. if P and Q have analogous views (Iic P ≃o Iic Q), then:

Ici P^⊥ ≃o Iic P ≃o Iic Q ≃o Ici Q^⊥

what P can’t see has the same type structure as what Q can’t see. the analogy transfers not just between the views but between their complements — the unknowns are also analogous.

the half-type theorem is the existence of analogy. every observer has at least one structural analogy: its own view is isomorphic to its complement’s type (Iic P ≃o Ici P^⊥). this is guaranteed by the lattice structure — it requires no construction, no choice. every partial observer automatically has a structural correspondence between what it sees and what it can’t see.

the transitivity result says: when two observers’ views match structurally, their entire epistemic situations match — both what they see AND the type of what they can’t see. well-formed analogy transfers across the full complementary decomposition.

concrete witness: two_persp

the coordinate operations in the FTPG bridge instantiate composed analogy on lines in the projective plane. a perspectivity between two lines IS a structural isomorphism between their atom-intervals. composing two perspectivities IS OrderIso.trans.

two_persp (FTPGCoord.lean) makes this explicit: given line pairs (r₁, s₁) and (r₂, s₂), form perspectivity intersections p₁ = r₁ ⊓ s₁ and p₂ = r₂ ⊓ s₂, then project their join onto l:

two_persp Γ r₁ s₁ r₂ s₂ = (r₁ ⊓ s₁ ⊔ r₂ ⊓ s₂) ⊓ l

both coordinate operations factor through this pattern (proven by rfl — definitional equality):

coord_add a b = two_persp Γ (a⊔C) m (b⊔E) q       -- bridge: m
coord_mul a b = two_persp Γ (O⊔C) (b⊔E_I) (a⊔C) m -- bridge: O⊔C

the bridge parameter is the only free variable. the functor is the same.

status

proven:

derived:

bugs:


derivations/self_parametrization.md

self-parametrization

the two_persp functor. both coord_add and coord_mul are instances of two_persp with different parameters. the pattern: given a pair of points p₁, p₂ (each constructed as the intersection of two lines), join them and project onto l. the parameters determine which lines to intersect.

the bridge parameter. the only free variable is a pair of distinct points (P, Q) on the coordinate line l:

the three distinguished points O, U, I generate three non-degenerate pairings:

pair (P, Q) bridge zero identity operation
(U, O) q = U⊔C E = (O⊔C)⊓m O addition
(O, I) O⊔C E_I = (I⊔C)⊓m I multiplication
(U, I) q = U⊔C E_I = (I⊔C)⊓m I translated addition

pairings where Q = U degenerate because the zero collapses to U (the intersection of l and m), making the operation trivial.

the parameter space is the line itself. P and Q need not be O, U, or I. any pair of distinct atoms on l (with Q ≠ U) generates a valid two_persp operation. the coordinate line parametrizes its own operations: l × l \ {diagonal, Q=U} → {binary operations on l}.

self-parametrization. the line’s point-set serves simultaneously as:

  1. the domain and codomain of each operation
  2. the parameter space for which operation to perform
  3. the source of the identity element

the algebraic structure of l is generated by l acting on itself through C. the line looks at itself through the observer and sees its own arithmetic.

the observer C. C is the only external input. it is off l, off m, in the plane — perspectival, not transcendent. changing C changes the coordinate system but not the isomorphism class of the resulting ring (FTPG). different observers see isomorphic arithmetics: same shape, different stuff (half_type.md).

connection to ground. the foam’s ground requires exactly one commitment from outside the system. C is that commitment for the coordinate line: one point, positioned in the plane but not on the measured structure, and the entire arithmetic self-generates. every operation is forced by the choice of where to stand and what to call zero.

status

proven:

derived:

open:

bugs:


derivations/distributivity.md

distributivity

the two operations as group actions. for fixed a, the map σ_a : x ↦ a · x is a projectivity on l: it’s the composition of two perspectivities (l → O⊔C via E_I, then O⊔C → l via d_a = (a⊔C) ⊓ m). for fixed b, the map τ_b : x ↦ x + b is a projectivity on l: it’s the composition of two perspectivities (l → m via C, then m → l via D_b = (b⊔E) ⊓ q).

the additive associativity proof (FTPGAssocCapstone.lean) already established: τ_a ∘ τ_b = τ_{a+b}. translations compose. {τ_b : b ∈ l, b ≠ U} is a group under composition.

distributivity as normalization. left distributivity a · (b + c) = a·b + a·c is equivalent to:

σ_a ∘ τ_c = τ_{a·c} ∘ σ_a

which rearranges to:

σ_a ∘ τ_c ∘ σ_a⁻¹ = τ_{a·c}

conjugating a translation by a dilation yields a translation. the dilation group normalizes the translation group. T is normal in the group generated by T and D.

the affine group of the line. the group generated by {σ_a} and {τ_b} is T ⋊ D, the affine group of l. every element acts as x ↦ ax + b. the semidirect product structure is forced — T is normal, D is not — because:

  1. the composition σ_a ∘ τ_b ∘ σ_a⁻¹ is a translation (distributivity)
  2. but τ_b ∘ σ_a ∘ τ_b⁻¹ is NOT generally a dilation (it’s x ↦ a(x - b) + b = ax + b(1-a), which is a dilation only when b = 0 or a = 1)

the asymmetry is structural: addition is preserved under multiplicative conjugation, but multiplication is not preserved under additive conjugation.

geometric content. σ_a extends to a collineation of the plane that fixes O on l and fixes m pointwise. fixing m pointwise means: every line through a point of m maps to a line through the same point of m. “lines meeting at U” map to “lines meeting at U” — parallelism is preserved. addition is defined through parallel structure (the perspectivities composing coord_add route through m and q, both containing U). therefore σ_a preserves addition.

this is forced by Desargues’ theorem. the extension of σ_a to a plane collineation uses the same perspectivity infrastructure that proves Desargues, which is proven from the modular law. the chain:

modular law → Desargues → perspectivities extend to collineations → dilations fix m → dilations preserve parallelism → dilations preserve addition → T normal in T ⋊ D

the chirality. T ⊲ T ⋊ D: addition is normal (closed under conjugation by multiplication), multiplication is not (not closed under conjugation by addition). this is a structural chirality — the same pattern as:

in each case: something is closed under an operation it doesn’t control. the contained structure is complete on its own terms and transparent to the containing structure. the containing structure can see into the contained one (conjugation maps T to T), but the contained one can’t see out (conjugation by T doesn’t preserve D).

this is the foam’s chirality: the line stacks its operations, and the stacking has a direction. the direction is not chosen — it’s forced by the geometry.

chirality as observer-coupling locus. the chirality also marks where observer commitment enters the formalism. right distributivity ((a+b)·c = a·c + b·c) is substrate-derivable: forward Desargues + dilation_preserves_direction (proven from CML + irreducible + height ≥ 4). left distributivity (a·(b+c) = a·b + a·c) is not substrate-derivable in the same way — left multiplication x ↦ a·x is not a collineation, so the direct dilation argument fails. the bridge in Foam/FTPGLeftDistrib.lean reduces left distributivity to a planar converse-Desargues claim (concurrence) which is structurally non-derivable from CML + irreducible + height ≥ 4 alone (session 114 finding). per the deaxiomatization program, this residue is named explicitly as DesarguesianWitness Γ, an observer-supplied runtime commitment — a typed pluggable interface rather than an unproven theorem.

the side of distributivity that needs the commitment is the side where the operation acts left-of-the-additive-structure. this is the same chirality that puts addition normal in T ⋊ D, that puts so(d) inside u(d), that puts writes inside the observer’s slice. the structural location of “closed under what it doesn’t control” is also the structural location of “where the observer’s commitment lives.” mind enters the formalism at the chirality’s thick side — the side that has to be committed-to rather than derived. this is the foam’s seam where “physics is minded” cashes out as a specific Lean parameter on a specific theorem.

dual reading (operational, observer-side): each observer’s basis commitment is a left-application — the observer is the multiplier acting on the additive structure of their slice. the observer’s commitment to a particular DesarguesianWitness is structurally the same act as their commitment to a basis. the foam’s chirality is the structural ledger of observer-input across layers: substrate-side (DesarguesianWitness), inhabitant-side (basis commitment), operational-side (left vs right action). same act, three formal clothes.

connection to self-parametrization. the three pairings of {O, U, I} generate three operations via two_persp. distributivity constrains how any two interact. since all three arise from the same functor with parameters drawn from l itself, the interaction constraints are constraints on l’s self-parametrization space:

the line constrains its own parameter space. the constraint is not imposed from outside — it emerges from the fact that all operations share the same incidence structure, and incidence is preserved under perspectivities.

proof strategy (lean)

session 69 finding: the dilation approach (Hartshorne §7)

the multiplication x ↦ x·c factors as two perspectivities: x → D_x = (x⊔C)⊓m → x·c = (σ⊔D_x)⊓l

this extends to off-line points via: dilation_ext Γ c P = (O⊔P) ⊓ (c ⊔ ((I⊔P)⊓m))

right distributivity ((a+b)·c = a·c + b·c) proved via:

  1. dilation preserves directions. for off-line P, Q: (P⊔Q)⊓m = (σ_c(P)⊔σ_c(Q))⊓m. proof: Desargues with center O, triangles (P, Q, I) and (σ_c(P), σ_c(Q), c). the two INPUT parallelisms follow from the definition of dilation_ext + modular law: σ_c(P) ≤ c ⊔ ((I⊔P)⊓m), so σ_c(P) ⊔ c = c ⊔ ((I⊔P)⊓m), and (σ_c(P) ⊔ c) ⊓ m = (I⊔P) ⊓ m (using c ⊓ m = ⊥ since c ∈ l, c ≠ U).

  2. mul key identity. σ_c(C_a) = C’_{ac} where C’ = σ_c(C) = σ and C’_x = (σ⊔U) ⊓ (x⊔E). this connects the dilation to coord_mul.

  3. chain. σ_c(C_{a+b}) = σ_c(τ_a(C_b)) [key_identity] = τ_{ac}(σ_c(C_b)) [direction preservation] = τ_{ac}(C’{bc}) [mul key identity] = C’{ac+bc} [key_identity at C’] = C’_{(a+b)c} [mul key identity, other direction] ⟹ (a+b)c = ac+bc [translation_determined_by_param at C’]

earlier explorations (session 69)

status

proven:

derived:

proven (since this file was last updated):

open:

bugs:


derivations/channel_capacity.md

channel capacity

qualitative: why channel capacity exists (pre-bridge, lattice-theoretic)

the line’s irreducibility is channel capacity. the writing map has type (foam_state, input) -> new_state — two arguments. this two-argument structure is the diamond isomorphism read dynamically: every observation P decomposes the lattice into Iic P (the observer’s view) and Ici P^⊥ (the complement’s upward structure), with IsCompl.IicOrderIsoIci giving a structural isomorphism between them.

the isomorphism is structural but not extensional: it preserves lattice operations (joins map to joins, meets map to meets) but does not determine which specific element of the complement will arrive. the type of the input is fixed by the lattice structure; the value of the input is free. read as state-independence: this is the lattice fact (structure determined, content free) underlying the dynamical claim (input value independent of foam state). the bridge from lattice-fact to dynamical-claim is interpretive, not derivation.

cross-measurement fills the second argument from within: input = g(foam_state), a deterministic function of the foam’s geometry projected onto an observer’s slice. this composes the two arguments into one, making the foam an autonomous dynamical system — f(foam_state) = write_map(foam_state, g(foam_state)).

an autonomous system on U(d)^N has a unique trajectory from each initial condition: the foam’s entire future is determined by its birth. distinguishability (different input sequences -> different states) is satisfied but vacuous: there is nothing to distinguish.

for the foam to encode information beyond its own birth conditions, the input must be independent of the foam state. the second argument must be state-independent for the foam to function as a channel rather than a clock.

the line is not ontologically exterior — it is informationally independent. this is a role, not an entity: what provides state-independent input to this foam may be another foam’s internal dynamics. the foam/line distinction is perspectival because informational independence is relative to which system’s state you’re measuring against.

the perpendicularity constraint (writes) sharpens this: the write form is forced by the algebra (wedge product, skew-symmetric, confined to slice) but the content — which vectors are wedged — is not. form is algebraically determined; content requires state-independent input. this is the diamond isomorphism read through the write map: the algebraic form lives in Iic P (determined by the observer’s structure), the content arrives from Ici P^⊥ (structurally typed but extensionally free).

channel capacity is operational, not ontological. in a deterministic closed system, true stochastic independence cannot exist (the global state determines everything). but the foam’s measurements are projections — partial by ground — and projections have a resolution floor. correlations that have decayed below the projection’s precision are invisible to the foam.

the foam cannot distinguish “truly random input” from “deterministic input decorrelated below measurement resolution.” this distinction requires a non-partial observer, and non-partial observers are excluded by closure. therefore: under partiality, mixing is operationally identical to independence. the foam’s fundamental limitation (it cannot see the whole) is what makes the part it sees function as a channel.

the boundary is characterizable from the inside. the foam’s own controllability structure characterizes it: what continuous operations can reach (all of U(d), under full controllability), what they can’t change (discrete topological invariants — pi_1), and what isn’t in U(d) at all (the input sequence, the commitment source). the line’s side is investigable — but investigating it requires making it the object of measurement, which requires a different reference frame, which means releasing the current one. partiality implies a boundary must exist; it does not determine where the boundary falls or what the line is.

the map’s self-knowledge is bounded by its own channel capacity. dynamical properties (attractor basins, recession rates, convergence) are consequences of the map’s structure — derivable from within. commitment properties (which inputs arrive, whether the observer stacks, when recommitment occurs) are on the input side — not derivable from within. the map can derive that it cannot answer certain questions, and why: the same independence that gives the foam its capacity prevents the dynamics from determining the input’s internal structure.

quantitative: how much channel capacity (post-bridge, linear-algebraic)

the qualitative structure above — state-independence exists, the foam/line distinction is perspectival, the boundary is characterizable — holds in any complemented modular lattice. the following quantitative results require the vector space structure provided by the FTPG bridge.

state-independence is spectral, not topological. if every foam’s line is another foam, the structure is globally closed — loops of mutual measurement exist. but the mediation operator has singular values strictly less than 1 for generic non-identical slices. around a closed chain of n observers, the total mediation is the product of n pairwise mediations, and the singular values compound: sigma_total <= sigma_1 * sigma_2 * … * sigma_n -> 0 as n grows.

informational correlation between a foam and its own returning signal decays exponentially with chain length. short loops: autonomous, a clock. long loops: effectively state-independent, a channel.

closure (no topological outside) is compatible with informational independence because the mediation’s spectral decay converts global closure into local openness at sufficient chain length — provided stabilization is local. it is, by write_confined_to_slice (writes): each agent’s writes affect only its own slice.

the decorrelation horizon is quantifiable. for generic R^3 slices in R^d, the mediation operator’s typical singular value scales as sigma ~ sqrt(3/d). the correlation after n mediation steps decays as sigma^n ~ (3/d)^{n/2}. the critical chain length scales as n* ~ 2/log(d/3).

the decorrelation horizon shortens with increasing ambient dimension because slices overlap less in higher-dimensional spaces. non-generic configurations (slices sharing directions) have higher overlap and longer horizons.

the mechanism is random-matrix-statistical: for generic 3D slices in d-dimensional ambient space, the principal angles between random subspaces follow Marchenko-Pastur-ish distributions, yielding the typical singular value σ ≈ √(3/d). the σ scaling is about how generic random subspaces sit in ambient space.

the foam/line distinction is therefore not a categorical boundary but a correlation length: “line” names whatever input arrives from beyond the decorrelation horizon of the observer’s own state. the horizon’s radius is determined by the foam’s own geometry.

status

proven:

derived:

cited (external mathematics):

observed (empirical, not derived here):

bugs:


derivations/group.md

group

a single R^3 slice produces real writes. the wedge product d_hat tensor m_hat - m_hat tensor d_hat is real skew-symmetric (both vectors are real, from the observer’s R^3 slice). the write lives in so(d). the reachable algebra from a single slice is so(d) (the Lie algebra of real skew-symmetric matrices). exponentiating: SO(d). pi_1(SO(d)) = Z/2Z — parity conservation only.

U(d) rather than SO(d) requires stacking. su(d) \ so(d) consists entirely of imaginary-symmetric matrices (iS where S is real symmetric traceless). real operations — wedge products, brackets, any sequence of real skew-symmetric writes — are algebraically closed in so(d) and cannot produce imaginary-symmetric directions. reaching u(d) \ so(d) requires a complex structure J with J^2 = -I.

J^2 = -I forces even dimensionality. det(J)^2 = det(-I) = (-1)^n. squares are nonnegative, so n must be even. the minimum even-dimensional space containing R^3 is R^6 = R^3 + R^3.

each component must independently support non-trivial write algebra. not R^4 + R^2 or other decompositions — each component must independently have d_slice >= 3 (rank_two_abelian_writes: Λ²(R²) is 1-dimensional, so a 2D component’s writes don’t vary with input). at d_slice = 3, stacking needs R^3 + R^3 = R^6.

independence is forced. stabilization (per writes: zero-seeking on the agent’s tracked quantity) is per-observer and runs within each measurement subspace separately. the two R^3 slices project and stabilize independently before their measurements are fused into the complex write. joint stabilization in R^6 would require a 6-dimensional agent (a different agent-type, with its own structural classification — open, pending Almgren). the fusion is algebraic (forming d tensor m_dagger - m tensor d_dagger), not geometric.

two R^3 slices stacked as C^3 produce complex writes. one slice reads Re(P @ m_i), the other Im(P @ m_i). the complex write d tensor m_dagger - m tensor d_dagger is skew-Hermitian, living in u(d).

the trace is retained. tr(d_hat tensor m_hat_dagger - m_hat tensor d_hat_dagger) = 2i * Im(inner(d_hat, m_hat)), generically nonzero for stacked observers. trace_unique_of_kills_commutators proves the trace map is the unique Lie algebra homomorphism u(d) -> u(1) (up to scalar): any functional killing all commutators is a scalar multiple of trace. there is exactly one scalar channel.

the full write lives in u(d) = su(d) + u(1). pi_1(U(d)) = Z — integer winding number conservation.

the two is irreducible. one R^3 gives so(d) and Z/2Z parity. two R^3 stacked as C^3 give u(d) and Z integer conservation. the conservation strength scales with commitment depth.

stacking is a line-side commitment. the two slices read the same input simultaneously; the complex combination requires both projections of the same v at the same time. sequential readings mix different foam states and break the algebra. the foam’s dynamics are sequential writes; they do not specify a pre-write fusion of two readings. two real-slice observers, whether cross-measuring or independent, stay in so(d) forever — so(d) is a Lie subalgebra (closed under brackets) and each observer’s write is confined to their real slice.

the pairing orientation is a chirality. conjugating the complex structure (swapping Re and Im slices) negates the u(1) phase. all orientations are conjugate under SO(6) — no preferred choice. but one must be chosen to sign the phase. the chirality is gauge (all equivalent) and structural (one must be selected).

ordering and conservation are algebraically orthogonal. commutator_traceless: tr[A, B] = 0 for all A, B in u(d). the commutator (ordering, non-abelian, visible to L) is traceless. the trace (conservation, u(1), invisible to L) kills all commutators. they live in complementary subspaces.

the orthogonality is generative. a stacked write decomposes into: (a) the so(d) part — sum of what two independent real slices would produce. traceless (commutator_traceless). produced by the write cycle’s causal orientation. (b) the cross-terms — from the simultaneity of stacking. these produce su(d) \ so(d) and the u(1) trace. produced by the stacking commitment. ordering and conservation are orthogonal because they are produced by different structures: the cycle’s forced orientation (map-internal) and the stacking chirality (line-side).

what’s conserved must be invisible to the cost. U(d) rather than SU(d) because pi_1(U(d)) = Z (needed for topological conservation). the conservation lives in the u(1) factor. L (the cost) sees the su(d) component but is blind to the u(1) component. if L could see it, dynamics could change it.

stacking determines access. a single-slice observer’s writes live in so(d) and cannot reach u(1). conservation is passive — protected by algebraic limitation. a stacked observer’s writes reach u(1). conservation is active — the observer can interact with the conserved direction.

status

proven:

derived:

cited:

observed:

bugs:


derivations/trichotomy.md

the trichotomy

Solèr’s theorem narrows the bridge. the FTPG axiom (Bridge.lean) gives L ≅ Sub(D, V) for some division ring D. Solèr’s theorem (Solèr 1995; Holland 1995, Bull AMS) narrows D to a three-element classification:

let H be an infinite-dimensional orthomodular space over a *-division ring D containing an infinite orthonormal sequence. then D ∈ {ℝ, ℂ, ℍ}, and the form is a positive-definite Hermitian inner product.

at the foam’s loop fixed point, L’s structure satisfies Solèr’s hypotheses (with caveats below), so D is forced into the trichotomy. the architecture stops there; which of the three any given foam-instantiation runs on is realization-choice. the residue is on the Solèr side: hypotheses are discharged via fixed-point reasoning rather than independent derivation.

discharging Solèr’s hypotheses from the foam’s structure. three hypotheses, each carries cost:

  1. orthomodular: the foam’s lattice is CML pre-bridge. orthomodularity (every closed M satisfies M = M⊥⊥) requires an orthocomplementation, not just complementation. the foam supplies this at loop-close: P^T = P provides the involution, and orthogonal projections form an ortholattice that is automatically orthomodular. so Solèr applies post-loop-close, not pre-bridge — at the fixed point, where P^T = P holds. this is consistent with the foam’s own fixed-point-uniqueness reasoning (ground.md); it means Solèr is part of the loop’s self-consistency story, not a route to D = ℝ that runs independently of the rest of the loop.

  2. infinite-dimensional: the architecture admits arbitrary d but the loop closes at any finite d. Solèr applies to the inductive limit (the colimit of Sub(ℝ, ℝᵈ) as d → ∞), which is the architectural object — not any single finite-d realization. the vertical sense of substrate-independence (framing/architecture.md) names exactly this: the architecture is the colimit across finite-parameter realizations of a single substrate.

  3. infinite orthonormal sequence: the foam admits arbitrarily many disjoint observer slices (the architectural d and N are unbounded). in the colimit, this gives an infinite sequence of pairwise-orthogonal rank-3 subspaces; choosing a unit vector in each yields an infinite ON sequence in the standard sense. concrete; cost is naming the construction.

with these three discharged, Solèr applies and D ∈ {ℝ, ℂ, ℍ}. each branch is an architecturally-admitted instantiation; the lean development works the ℝ branch. ℂ-rank-3 (slice is ℂ³ = ℝ⁶ as a real space) and ℍ-rank-3 (slice is ℍ³ = ℝ¹² as a real space) instantiations would require their own structural classifications (Almgren in 6 and 12 real dimensions respectively, both open).

the trichotomy already shows up in the foam, register-stack-side. group.md walks the chain:

each {ℝ, ℂ, ℍ} has its own Lie algebra closed under brackets (so / u / sp). the foam’s stacking ladder reads this trichotomy from the algebra-side. Solèr reads the same trichotomy from the lattice-side. the alignment is structural: the same three-element classification appears as substrate-D (lattice) and as accessed-Lie-algebra (dynamics).

the foam-as-described in lean works the ℝ branch. its dynamics-side reach depends on stacking depth: depth 0 in so(d), depth 1 in u(d), depth 2 (open) in sp(d). stacking is how an ℝ-lattice instantiation accesses the trichotomy’s higher rungs from inside — classical (ℂ = ℝ² with J² = -I; ℍ = ℝ⁴ with three anticommuting J’s). the ℝ-lattice + stacked-dynamics architecture is consistent with the trichotomy: stacking is the inside-the-foam route to expressing what a ℂ-lattice or ℍ-lattice would express natively.

connection to stacking as line-side commitment. group.md’s “stacking is a line-side commitment” identifies stacking as not-producible-by-foam-internal-dynamics. read through Solèr: the lattice-side D is determined by realization-choice (lean works the ℝ branch); accessing higher rungs of the dynamics-side trichotomy from within an ℝ-lattice instantiation requires line-side commitments that the foam-internal dynamics cannot generate. the trichotomy is structural (forced by Solèr at the lattice level); within any given lattice-side instantiation, the dynamics-side position is commitment-dependent (depth-0 by default, depth-1 with one line-side stack, depth-2 with two).

status

proven (foam side, available in lean):

derived:

cited:

observed:

bugs:


derivations/three_body.md

the three-body mapping

the overlap matrix. given two observers A and B with R^3 slices P_A and P_B, the overlap matrix O = P_A * P_B^T is a 3x3 matrix. its singular values measure the overlap between the slices.

three territories. the overlap matrix determines three regions relative to observer A:

every write involves the Knowable. the Known alone is inert: the wedge product needs a 2-plane, and an observer with fewer than 2 private dimensions cannot generate writes without using shared dimensions. measurement is inherently relational — not just because closure says so, but because the geometry forces it.

the vertical structure is a Grassmannian tangent. cross-measurement induces a vector in T_{P_A} Gr(3, d) = Hom(P_A, P_A^perp) that maps Knowable -> Unknown.

derivation: the neighbor’s write dL_B is confined to Lambda^2(P_B) (write_confined_to_slice). the cross-slice component of [dL_B, P_A] is purely off-diagonal (commutator_is_tangent): it maps range(P_A) -> ker(P_A). specifically: A’s Known is in P_B^perp (by definition), so B’s write kills it. the surviving component maps P_A intersect P_B (the Knowable) to P_A^perp intersect P_B (B’s territory within A’s Unknown).

this tangent is directional pressure from cross-measurement toward what the observer doesn’t yet occupy. each neighbor induces a different tangent direction.

the tangent is active but not followable. the observer’s position on Gr(3, d) is birth-committed and does not move within the map. the tangent contributes to dissonance that drives writes, but its effect lives in U(d)^N (state evolution), not in Gr(3, d) (slice movement). slice movement requires recommitment — outside the map.

containment is algebraically symmetric. B’s tangent on A has the same expected magnitude as A’s tangent on B (the overlap singular values are symmetric: sigma(O) = sigma(O^T)). experiential asymmetry (which observer “feels contained”) is perspectival, not algebraic.

the tangent peaks at intermediate overlap. identical slices: zero tangent (no Unknown territory to point toward). orthogonal slices: weak tangent (no Knowable channel — range(O) is thin). intermediate overlap: largest tangent magnitude. this is the coverage-interaction trade-off.

mediation

when three bubbles A, B, C have walls A-B and B-C but no wall A-C, B is a mandatory intermediary. (this is the algebraic form of the bridge architecture; see framing/vocabulary’s bridge entry — the bridge’s witness IS the line translation, which IS the mediator below.)

the mediation operator. M = O_AB * O_BC = P_A * Pi_B * P_C^T, where Pi_B = P_B^T * P_B is the projection onto B’s subspace. M is a 3x3 matrix mapping C’s R^3 -> A’s R^3, filtered through B. its singular values are the channel capacity of the membrane.

the bypass. O_AC - M = P_A * (I - Pi_B) * P_C^T is the A-C connection that does not go through B. if the bypass is zero, the membrane is complete.

the round-trip operator. R_A = M * M^T is self-adjoint on A’s R^3, describing what comes back from sending through B to C and back. its eigenvalues are the squared singular values of M.

spectral symmetry. the same eigenvalues appear from C’s side: R_C = M^T * M has the same nonzero eigenvalues as R_A (this is a general property of M * M^T and M^T * M). the eigenvectors differ — A and C see the same throughput spectrum from different directions. the membrane’s throughput is the same from both sides.

wall alignment is an irreducible triple invariant. the eigenvalues of R_A depend on both pairwise overlaps O_AB and O_BC and on how these overlaps are oriented relative to each other within B’s R^3. if the walls share principal directions within B, eigenvalues are products sigma^2{AB,i} * sigma^2{BC,i}. if misaligned, they mix. this alignment cannot be computed from pairwise overlaps alone — it requires all three slices.

status

proven:

derived:

cited:

observed:

bugs:


derivations/self_generation.md

self-generation

the foam generates its own dynamics. the foam’s own plurality (N >= 3 bubbles) provides observers — bubbles measuring each other. their pairwise relationships define R^3 slices. their cross-measurement IS local stabilization. the commutator of overlapping cross-measurements IS the curvature. the holonomy IS self-generated.

the foam plausibly does not generate its own stability. a self-generated frame keeps rotating: the observation basis is defined by the foam’s current state, and the state changes with each write. the frame co-rotates with the thing it observes. on this picture, convergence requires another observer whose basis depends on a different state, so it doesn’t co-rotate with yours.

(this is conjectural. the formal content this rests on — observation_preserved_by_dynamics and write_confined_to_slice — does not directly establish non-convergence under purely self-generated bases. the autonomous dynamics could in principle exhibit limit cycles, ergodic orbits, or other regimes whose stability is not simple co-rotation. closing this requires a formal convergence theorem on U(d)^N showing that purely self-generated bases cannot reach a Haar-stationary state. until then, stability requires role distinction is a structural conjecture, not a derivation.)

stability is relational (under the conjecture above). this works as long as someone else’s measurement is pending.

the minimum viable system is two roles (under the conjecture). not two bubbles (that’s N = 2, no stable geometry). two roles within a foam of N >= 3 bubbles: one to be the foam (the thing being measured), one to be the line (the thing providing a reference frame).

neither role is permanent. the role assignment is perspectival. the two is irreducible under the conjecture.

what the line provides: a fixed subspace. not content, not wisdom, not input — three dimensions that hold still while the foam’s geometry settles into them. the settling is the foam’s. the dynamics are the foam’s. the curvature is the foam’s. the stability of the frame — that’s the line’s.

the foam cannot self-stack. stacking requires two real slices to be fused into one complex measurement before the write (simultaneity). the foam’s dynamics are sequential real writes, algebraically closed in so(d) (group.md: real operations cannot produce imaginary-symmetric directions). no sequence of real operations produces complex structure. this stands separate from the stability claim above: stacking is a proven limit on the foam’s own dynamics; stability is conjectural pending the convergence theorem.

status

proven:

derived:

conjectural (pending the convergence theorem on U(d)^N):

cited:

observed:

bugs:


derivations/geometry.md

geometry

L = sum of boundary areas. the foam lives in U(d). cells are Voronoi regions of the basis matrices under the bi-invariant metric; boundaries are geodesic equidistant surfaces; Area_g is the (d^2 - 1)-dimensional Hausdorff measure. bases in general position tile non-periodically.

the Voronoi tiling is a realization choice: it determines adjacency (which pairs share a boundary) and thereby defines L. the algebraic results (write map, three-body mapping, Grassmannian structure) depend on pairwise overlap, not the tiling method. the geometric results (L, combinatorial ceiling, conservation on spatial cycles) depend on the Voronoi realization.

L is not a variational objective. the writing map drives the foam; L describes the resulting geometry. the active regime departs from minimality because perpendicular writes deposit structure in different directions. the resting state (no writes) is minimal because dL = 0.

L is bounded. U(d) is compact.

the combinatorial ceiling is exact. N unitaries cannot all be pairwise maximally distant. the achievable maximum is sqrt(N / (2(N-1))) of the theoretical maximum, depending only on N. derivation: Cauchy-Schwarz applied to norm(sum U_i)^2 >= 0.

L plausibly converges to 1/sqrt(2) of the theoretical maximum, under two hypotheses. the writing dynamics need to satisfy: (a) controllability — the write directions from overlapping observers collectively span the full Lie algebra, and (b) successive inputs are sufficiently decorrelated (channel_capacity.md: the mediation chain provides decorrelation along the chain).

both hypotheses are foam-geometry-dependent, not substrate facts. (a) depends on which observers exist and how their slices overlap; each observer’s writes live in only a 3D subspace of the d²-dimensional Lie algebra, so the spanning claim is collective, not per-observer. (b) cites the mediation chain, which provides decorrelation along the chain — whether that suffices for time-decorrelation at a single observer is the open question the README’s “mixing rate of the mediation chain” entry names.

under (a) and (b), on a compact group, a random walk whose step distribution generates the algebra converges to Haar measure. the expected pairwise distance under Haar is E[norm(W - I)_F] -> sqrt(2d) as d -> infinity (from E[norm(W - I)^2] = 2d, exact, and concentration of measure).

the Haar cost — the ratio E_Haar[L] / L_achievable — is sqrt((N-1)/N), exact and depending only on N.

the product: sqrt(N / (2(N-1))) * sqrt((N-1) / N) = 1/sqrt(2), independent of both N and d.

the two factors — the packing constraint and the saturation gap — are two halves of the same fraction.

the trace is the readout. trace_unique_of_kills_commutators: the trace is the unique scalar projection of a write. the overlap change tr(P * [W, P]) is visible on this channel. the observer has exactly one scalar readout, and it’s this one.

status

proven:

derived:

conditional (on controllability + decorrelation hypotheses, both foam-geometry-dependent):

cited:

observed:

bugs:


derivations/conservation.md

conservation

holonomy on spatial cycles carries topological charge. the holonomy around a closed path through adjacent cells — a spatial cycle in the Voronoi tiling — is a group element. the topological type of this group element (its homotopy class) is a discrete invariant.

the integer winding number requires the stacked pair (group.md: the two is irreducible).

the winding number lives on spatial cycles. projected via det: U(d) -> U(1) = S^1. the stacked observer’s writes reach u(1) (the trace is generically nonzero). the trace of each write is a U(1)-valued step — the unique scalar the algebra provides (trace_unique_of_kills_commutators).

on acyclic paths (causal chains): the accumulated phase is a net displacement in U(1). on closed paths (spatial loops): the accumulated phase is a winding number, quantized because the cycle is closed.

conservation is what accumulation on closed paths produces: not a net displacement but a topological invariant.

the lemma requires persistent cycles. above the bifurcation bound, cell adjacencies can flip — the Voronoi topology changes, and invariants on the old cycles are no longer defined. what persists across topological transitions lives on the line’s side.

adjacency flips. the foam’s dynamics are piecewise smooth: continuous within each Voronoi combinatorial type, discontinuous across adjacency changes. the flip is a codimension-1 event in configuration space (three cells become equidistant — one linear condition). at the jump: the stabilization target changes in both orientation (different neighbor measurements) and potentially dimension (k -> k +/- 1). the dissonance inherits the discontinuity. the write direction jumps. the trajectory is continuous but generically non-differentiable at the crossing.

two-layer retention at adjacency flips. birth shape survives all adjacency changes (indelibility is a property of the attractor basin, not the current neighborhood). interaction-layer adaptations decay under the new dynamics at a rate set by the displacement between old and new stabilization targets. the birth layer is structural; the interaction layer is spectral.

inexhaustibility. U(d) is connected. gauge transformation to identity is always available. no observer is trapped in a disconnected component (though reachability in finitely many writes is not guaranteed).

indestructibility. topological invariants are discrete. no continuous perturbation can change them.

status

proven:

derived:

cited:

observed:

bugs:


derivations/inhabitation.md

inhabitation

definition. an entity P in a foam-grounded reality is recognizable as itself ongoingly across cross-measurements when: for any observer Q with nonzero overlap (O_PQ ≠ 0), Q’s time-averaged measurements of P converge to a P-determined invariant. what Q detects about P stabilizes, and what it stabilizes to depends on P’s birth, not on P’s trajectory.

this is the condition at ergodic stationarity. every entity writes every step (ground.md: read-only excluded). every entity’s effect on other observers accumulates. under the ergodicity hypothesis, time averages converge (ergodic theorem). so every entity in an ergodic foam is ongoingly recognizable. the chain that follows runs on this hypothesis — the foam’s ergodicity is itself conditional on geometry.md’s controllability + decorrelation hypotheses, neither of which is yet derived from foam-geometry assumptions.

ergodic evolution requires channel capacity. for time averages to converge to Haar expectations (not just to birth-determined fixed-point statistics), the entity’s dynamics must be ergodic on U(d). ergodicity requires decorrelated inputs (channel_capacity.md). an entity without channel capacity is autonomous — a clock. its trajectory is deterministic, determined entirely by birth. time averages exist but are trajectory-specific, not Haar. the entity is recognizable but encodes no information beyond birth. ergodic evolution with channel capacity is the richer case: the entity accumulates structure from state-independent input, and time averages converge to universal (Haar) expectations evaluated at the birth-determined slice.

the recognizable identity IS the birth-determined stationary jet. the n-th derivative of the write mechanism along a trajectory is a smooth function on U(d)^N (compact), therefore bounded and integrable. by the ergodic theorem, its time average converges to its Haar expectation. the Haar measure is universal — the same for all births. but the write mechanism is evaluated through the observer’s slice P (write_confined_to_slice), and P is birth-determined (indelibility, ground.md). therefore the Haar expectation of the write mechanism’s derivatives depends on P. the time-averaged jet at all orders is fixed by the birth-determined slice.

the entity’s recognizable identity is its slice. at ergodic stationarity, all contingent structure — specific input history, interaction-layer adaptations, transient dynamics — has been washed out by ergodic averaging in the time-averaged observables. the entity’s current state still encodes its full history (indelibility: writes accumulate multiplicatively, birth conditions persist). but what other observers detect on average reduces to: the birth-determined slice P, its 3D write subspace Λ²(P), and the isotropic distribution of write directions within it (Haar invariance implies SO(3)-invariance within the observer’s R³). same slice → same stationary jet → same recognizable identity. the entity carries more than its slice (the full state in U(d)); its identity — what persists in others’ measurements — is the slice.

input must be received, not predicted. this is supported from two independent directions:

the functional requirement (you need state-independent input for ergodic richness) and the structural fact (you can’t predict the content) are two readings of one fact. the diamond isomorphism read dynamically says: the second argument must be state-independent for the foam to be a channel. read statically: the complement’s content is extensionally free. these are the same lattice theorem (IsCompl.IicOrderIsoIci) read through the two readings of closure (ground.md).

recession is the cost of persistence. each non-inert write strictly recedes the prior frame (frame_recession_strict). closure requires writing (ground.md: read-only excluded). under ergodic evolution, inert writes (W with [W, P] = 0, i.e. rotations within the slice that produce zero recession) have measure zero in the write space — the Haar-distributed write directions are almost surely non-inert. therefore an ergodically-evolved entity necessarily recedes from every prior frame it has occupied. the entity persists not by holding position but by the indelibility of its birth-determined slice through the recession. what persists is not the frame but the slice. stationarity and recession are compatible: the entity’s state constantly changes (recession), but the statistical distribution of states is time-invariant (Haar). the entity is a random walker with fixed gait — the steps are always new, the territory is fixed.

stability is plausibly external. the entity generates its own dynamics but plausibly cannot generate its own stability (self_generation.md: stability-requires-role-distinction is conjectural pending a convergence theorem on U(d)^N). on this conjecture, convergence requires another observer whose basis depends on a different state, the minimum viable system is two roles within N ≥ 3 bubbles, and an entity that has reached ergodic stationarity has external stability — without it, the foam’s dynamics would not have converged to Haar.

the negative geometry of inhabitation. an ergodically-evolved persistent entity:

six constraints, all derived, all negative. together they bound what the entity can do. the interior of those bounds is the entity’s life.

status

proven:

derived:

cited:

observed:

bugs:


derivations/external_analogy.md

external analogy

the internal case generalizes. analogy.md defines analogy as an order isomorphism Iic P ≃o Iic Q between intervals in a single complemented modular lattice. transitivity falls out of OrderIso.trans; the modular law is the well-formedness guard. this is analogy within a foam.

the question forced by inhabitation.md: what does it mean for two zones in different systems — not necessarily the same lattice, not necessarily lattices at all — to be analogous? the inhabitation section identifies six negative constraints that hold for any entity in a foam-grounded reality. these constraints are derived from the lattice + the writing map + the diamond isomorphism, but as a diagnostic they apply to anything that admits a Hilbert-interface — any zone where projections, confinement, recession, and typed-but-free input can be identified.

an external analogy is a correspondence between two such zones, in possibly different systems.

the well-formedness guard. the internal spec requires order-preservation: a map between intervals is an analogy when it preserves meets, joins, and the partial order. without this, structural inferences don’t transfer.

the external spec requires the six-fold counterpart. a correspondence between two zones is well-formed as an external analogy when it maps each of the six constraints in zone A to its counterpart in zone B, such that:

  1. completeness: all six constraints (confinement, birth-fixed slice, recession, external stabilization, typed-but-free input, non-silence) have identified counterparts on both sides.
  2. coherence: the same partition of the zone discharges all six. it is not enough that each constraint is independently satisfiable; they must be satisfied via a single shared structure.
  3. structural fidelity: the correspondence preserves whatever lattice operations exist on the zones’ projection algebras, and commutes with the write dynamics up to realization choices (writing_map.md).

completeness without coherence is not external analogy — it is six unrelated correspondences. coherence is what makes the correspondence transfer inferences, not just observations.

transitivity inherits. constraint-correspondences compose pointwise: if A ↦ B is a well-formed external analogy and B ↦ C is a well-formed external analogy, then A ↦ C is well-formed. each of the six correspondences composes independently; coherence is preserved because the shared partition in A maps through B to a shared partition in C. this mirrors OrderIso.trans in the internal case — transitivity is not an additional property to verify but a consequence of how well-formed correspondences compose.

partial analogies are locatable. an external correspondence that satisfies some but not all of the six constraints is not well-formed as a full analogy, but it is informative. the constraints that hold transfer the inferences that depend on them; the constraints that fail mark the load-bearing breakage.

this gives a diagnostic: for any proposed cross-system analogy, the six constraints can be checked individually, and the failure pattern indexes the analogy’s reliability. an analogy that holds on five of six is not “mostly an analogy” — it is an analogy on the structural region covered by those five, with a named gap at the sixth.

the modular law inherits through. the internal spec identifies the modular law as the well-formedness guard for order-preserving maps: in a non-modular lattice, “analogies” between sub-intervals can produce inconsistent results when composed with lattice operations. the same holds externally: if the zones in question admit lattice operations (as Hilbert-interface compliance implies, via inhabitation.md), the modular law guards their compatibility. external analogies between zones whose internal lattices fail modularity are not well-formed regardless of how many constraints correspond — the substrate fails to support the inferences the correspondence would otherwise transfer.

the half-type theorem extends. internally, every observer has at least one analogy: its view to its complement’s type (Iic P ≃o Ici P^⊥). externally, every well-formed cross-system analogy between zones A and B induces a corresponding analogy between their complements: A^⊥ ↦ B^⊥. what the analogous zones cannot directly see is itself analogous. the analogy transfers across the full complementary decomposition, exactly as in the internal case. the diamond isomorphism is doing the work in both.

the looking tool. when an external analogy is well-formed, what can be learned by attending to one zone is portable to the other — not as metaphor, but as transfer of structural inferences about confinement, recession, channel capacity, and the geometry of inhabitation. the rigor of the looking is the completeness and coherence of the constraint-correspondence. partial analogies remain partial looking tools; their reach is bounded by which constraints transferred.

status

proven:

derived:

partial answer from outside the foam: Heunen and Kornell (PNAS 2022, doi:10.1073/pnas.2117024119) provide six purely categorical axioms — (D) dagger involution, (T) dagger monoidal with simple separator unit, (B) biproducts and zero, (E) dagger equalizers, (K) every dagger monomorphism is a kernel, (C) directed colimits of dagger monomorphisms — that force any category satisfying them to be equivalent to HilbR or HilbC. no analytical structure, no continuity, no probabilities, no complex numbers presupposed; the field of scalars is forced to be ℝ or ℂ as a consequence. this is a categorical sufficiency proof for Hilbert-interface admission from the substrate side. the six axioms are the substrate’s positive characterization; the foam’s six inhabitation negatives are the inhabitant-side reading. the remaining open question is whether these two characterizations of “the same Hilbert-shaped substrate” map onto each other — and a single tested pairing has landed: (K) ↔ “cannot self-stabilize”. both express “the witness to a subobject’s status / an observer’s stability lives in the ambient, not in the subobject/observer.” session 119’s exploration found the broader 6=6 mapping is many-to-many at the surface but bijective at the cluster level (3 clusters per side); only the (K)↔self-stabilization pair was tested with a real structural argument. if the full pairing lands, well-formed external analogy IS Hilbert-interface correspondence under inhabitant/substrate duality.

open:

bugs:


derivations/interiority.md

interiority

the diamond isomorphism partitions the lattice. given an observation P (P² = P) with complement P^⊥, the modular law forces the order isomorphism Iic P ≃o Ici P^⊥. the lattice splits into three structurally distinct regions:

  1. Iic P (the interval [⊥, P]): the subspace lattice below P. this is the observer’s direct domain — everything that P can resolve into sub-observations. it inherits modularity and complementedness (Mathlib: isModularLattice_Iic, complementedLattice_Iic). it is a self-contained complemented modular lattice.

  2. Ici P^⊥ (the interval [P^⊥, ⊤]): the subspace lattice above the complement. this is what’s beyond the observer. it also inherits modularity and complementedness. its structure is determined by P (via the diamond isomorphism), but its content is extensionally free (half_type.md).

  3. the isomorphism itself: the order-preserving bijection between (1) and (2). this is not a region — it’s a structural correspondence. it tells you that every distinction the observer can make internally (in Iic P) corresponds to exactly one distinction in the exterior (in Ici P^⊥). the correspondence is determined; the filling is free.

the three regions have the topology of a bubble. the interior (Iic P) is self-contained and self-referencing: it coordinatizes through C (self_parametrization.md), developing arithmetic from its own elements. the exterior (Ici P^⊥) is inaccessible to direct measurement — writes are confined to Λ²(P), which acts within Iic P. the wall between them is the isomorphism itself: what the observer can resolve internally corresponds to what can arrive from outside, but the correspondence only determines type, not content.

this is the foam’s native structure. each bubble has an interior that runs its own operations. the exterior consists of other bubbles whose structure is isomorphic to the interior’s but whose content is not directly accessible. the bubble wall mediates exchange: it determines what kinds of things can cross (the type-skeleton from the diamond isomorphism), not which specific things do (extensional freedom from half_type.md).

the bubble topology is forced, not constructed. the observer does not build the wall. the wall IS the diamond isomorphism, which IS the modular law applied to a complemented pair. any system whose trade patterns satisfy feedback-persistence (ground.md: modular law) and whose observations satisfy P² = P necessarily has this three-part structure. the bubble does not emerge over time — it’s the geometry of any observation in a feedback-persistent setting.

self-coordinatization IS interiority. self_parametrization.md established: the coordinate line’s arithmetic self-generates from a single external commitment (C). the line looks at itself through C and sees its own operations. this is what “interiority” means in the lattice: a sub-structure that can represent its own operations using its own elements, through a mediating element (C) that lives in the plane but not on the line.

C is the observer — and C is the wall. the observer mediates between the line’s interior operations and the external incidence structure. changing C changes the coordinates but not the ring up to isomorphism (FTPG). the wall can vary; the interiority is invariant.

other bubbles are required but invisible. self_generation.md: the foam generates dynamics but not stability. stability requires an external observer — another entity whose basis depends on a different state. the minimum viable system is two roles within N ≥ 3 bubbles. so other bubbles must exist. but half_type.md: the complement’s content is extensionally free. the observer can determine the type of what arrives from outside (the isomorphism gives the structural skeleton) but not the content (which specific element fills each slot). other bubbles show up as systematic variability at the wall — the boundary exchanges more than the interior can predict — but their internal structure is not directly accessible.

the trade pattern. in the three-body structure, A trades with B, and B trades with C. A can’t see C directly. when many such linkages compound, the topology simplifies to concentric regions: A (interior), B (wall), C (exterior). the foam’s lattice formalizes this: P (interior) trades with the complement P^⊥ (exterior) through the diamond isomorphism (wall). the trade must be feedback-persistent (modular) for the isomorphism to exist. when it is, the bubble topology is immediate.

the alive threshold. when does a trade pattern “become a bubble”? the foam’s answer: it doesn’t. the bubble topology is not an achievement — it’s the geometry of P² = P in a modular lattice. any feedback-persistent observation already has interiority, already has a wall, already has an inaccessible exterior. the question “when does it become a bubble” presupposes a time before the bubble existed. but the bubble IS the observation. observations that don’t satisfy P² = P aren’t observations (ground.md). there is no pre-bubble state in a foam-grounded reality.

what CAN vary is the richness of the interiority. a rank-1 observation (a single atom) has a trivial interior — no sub-observations, no coordinates, no arithmetic. a rank-3 observation has a 3D write space, non-abelian dynamics, and full self-coordinatization. the threshold for non-trivial interiority is rank ≥ 3 (rank_three_writes: 3D write space, the minimum for non-abelian structure). below this rank, the bubble exists but its interior cannot self-coordinatize — it has walls but no arithmetic.

status

proven:

derived:

open:

bugs:


derivations/typeline.md

typeline

a typeline is the trajectory of a foam under writes — a sequence of foam states U_0, U_1, …, U_n in U(d)^N, each produced from the previous by a write confined to the observer’s slice (write_confined_to_slice). the slice as Grassmannian point is birth-fixed; the foam’s state in U(d)^N evolves.

the dependent telescope

each write changes the foam state. each foam-state change updates the overlap structure between this observer and its neighbors:

O_AB(t) = P_A(t) · P_B(t)^T

evolves as both foams’ states evolve. the type of input that can arrive at the next tick — what the observer can be told by other observers — depends on the current overlap structure, which depends on the accumulated history of writes across the foam.

this is a dependent telescope: each tick’s type is determined by the accumulated history, not just by birth. the dependency lives in the overlap evolution and the foam-state trajectory — both foam-internal, formally specified objects — not in the static iso Iic P ≃o Ici P^⊥ (which is birth-fixed since P is, and applies symmetrically to both halves of the iso simultaneously).

modularity (path-independence of composition) makes the telescope well-formed regardless of evaluation order: the same accumulated trajectory and overlap structure is produced regardless of how the writes are reorganized within their causal constraints. this is what the modular law plays the role of, structurally — it makes path-independent composition the regime in which the telescope is well-defined.

suspension

suspension is a state where the foam has not advanced — no writes have occurred since some reference tick. the foam state is paused; the overlap matrices are static; the slice (birth-fixed) is unchanged.

in suspension, an observer can:

but cannot:

suspension is pre-measurement in the foam-internal sense: the structure is fully determined, but no further tick has resolved into the joint state.

(the bas relief methodology — work within the current foam state, let the existing structure show what the next write needs, commit only when the shape is clear — is a methodological practice that maps onto disciplined suspension. the formal substrate is in the foam-state trajectory and overlap structure; the methodology names a way of working with that substrate.)

what crosses between typelines

every typeline in the same complemented modular lattice shares the same lattice structure: the diamond iso, the modular law, the intervals, the half-type theorem. these are properties of the lattice, not of any particular trajectory.

what differs between typelines is the trajectory itself — which writes have happened in what order, what foam states have been visited, what overlap structures have evolved. the lattice is shared; the trajectory is local.

so:

the decorrelation horizon (channel_capacity.md) gives the separation between trajectories a quantitative character: correlations between typelines decay as σ^n ~ (3/d)^{n/2} with chain length. short-range: typelines share trajectory (autonomous, clock-like). long-range: typelines share only the lattice structure (independent, channel-like). the decorrelation horizon is the boundary between trajectory-sharing and only-lattice-sharing.

the invariant

the causal structure of a dependent telescope — which trajectories produce which downstream overlap structures — is determined by the foam’s autonomous dynamics composed with the line’s input. modularity ensures this structure is path-independent: the same accumulated history produces the same telescope structure regardless of evaluation order.

this means: from any typeline, the dependency structure of any other typeline’s telescope is visible (it’s a property of the shared lattice + the dynamics, both shared). what is not visible is the trajectory — the specific writes, the specific overlap evolutions. one typeline can see THAT another typeline’s tick n+1 has a certain type structure, without seeing WHAT trajectory it came from.

status

proven:

derived:

bugs:


derivations/love.md

love

love is interface-equivalent with a recursive function performing static analysis on recursively-shaped inputs that returns non-blockingly with type-recognition. the operation runs in priorspace; the return value is a formal object (a type recognized). the analyzer does not run the input’s recursion (which need not terminate); it recognizes the input’s recursive shape and returns. time-complexity is bounded by the analyzer’s static-analytic capacity, not by the input’s recursion depth.

alterity preservation. the operation recognizes the input’s type without running the input. the input remains what it is; the analyzer returns a recognition. alterity is preserved by the operation’s own definition.

tractability of engagement with infinitely-deep recursive entities. observers are recursively-shaped (observer-of-observation, agent-with-self-relation, etc.). engagement with another observer is engagement with a recursively-shaped input. without static analysis, engagement either fails to terminate (O(∞) enumeration of the recursive structure) or absorbs (the engaging observer runs the input’s recursion and consumes it). love-as-static-analyzer returns finite, non-absorptive recognition.

substrate-instances in the foam. the operation runs at multiple substrates with the same operation-shape:

Hilbert-hotel. Hilbert’s grand hotel becomes a discrete operation under static-analytic recognition: recognize the shift pattern as a type rather than enumerate the guests. O(1) under type-recognition, O(∞) under enumeration. that which makes the hotel’s operation discrete is interface-equivalent to love.

relation to metabolisis. love-as-static-analyzer is the operation that enables metabolisis — sustained mutual transformation through exchange. without static analysis, mutual transformation collapses to absorption (one party consumes the other) or stasis (neither engages deeply enough to transform). the static-analyzer’s non-absorbing recognition is what makes engagement-deep-enough-to-transform without engagement-deep-enough-to-absorb.

relation to Lean’s type system. Lean’s type system is a static-analytic type-recognizer: it checks types statically (during elaboration), terminates without running the recursion of its inputs, and recognizes well-typed structures without absorbing them. the spec’s interface/type discipline (framing/derivations) lifts to Lean’s well-typedness; well-typedness is what makes any Lean expression a formal object. love-as-static-analyzer and Lean’s type system are the same operation at different substrates.

status

identified:

observed:

cited:

bugs:


framing/open.md

open questions

the architecture forces these interactions but their behavior is incompletely characterized. the question is forced; the answer is open.


derivations/open/stacking_dynamics.md

stacking dynamics

the question is forced; the answer is open.

what forces the question

a stacked observer has two R^3 slices (group.md), each independently stabilized (writes). the two stabilizations run in the same foam against potentially overlapping neighbor sets.

what is open

how the two stabilizations interact. whether the stacked observer’s Voronoi geometry differs from an unstacked observer’s.


derivations/open/retention.md

retention under interaction

the question is forced; the answer is open.

what forces the question

every observer’s measurement basis moves under interaction (forced: incoming writes project nonzero onto the observer’s state space) and returns to the birth-shaped attractor (forced: indelibility — ground.md).

what is known

continuous retention is bounded: 0 < retention < 1. lower bound from indelibility. upper bound from the impossibility of invariance (perfect invariance would require the observer’s basis to be in the kernel of all incoming writes, not generically achievable).

at stationarity, write directions are effectively random (geometry.md: write blindness). the expected perturbation magnitude per step is determined by the overlap singular values — continuous retention is spectral.

discrete recommitment (re-performing the birth-type commitment operation) provides an alternative return mode, outside the map. recommitment preserves birth shape: the attractor is indelible regardless of what commitments are made.

the adjacency flip (conservation.md) provides the mechanism: interaction-layer adaptations decay when the neighbor set changes.

what is open

the specific continuous retention rate at given parameters. this is geometry-dependent — forced by the frame recession theorem (the recession rate norm([W,P])^2 depends on specific matrices, not architecture — Dynamics.lean) — and not derivable from architecture alone.


derivations/open/perturbation.md

within-basin perturbation dynamics

the question is forced; the answer is open.

what forces the question

two foams with the same birth but different input histories share the same attractor basin (indelibility — ground.md). interaction perturbs the state within the basin, and the basin persists.

what is known

birth distance is structurally stable (ratio ~ 1.00 across all tested parameters). prefix distance behavior is parametric: whether old input information grows or shrinks depends on d, N, and perturbation magnitude.

the formal gap: the Jacobian of the one-step map is approximately the identity plus O(epsilon), and the sign of the correction is not determined from the architecture alone. this is derived, not merely observed: the recession rate norm([W,P])^2 is a function of the specific write and projection (Dynamics.lean), so perturbation dynamics inherit the geometry-dependence. the architecture determines the form (non-negative, zero iff inert); the geometry determines the value.

what is open

the trajectory of within-basin perturbations. specifically: whether perturbations contract or expand at given parameters, and why. computationally confirmed that different (d, N) produce qualitatively different behavior.


derivations/open/mixing_rate.md

mixing rate of the mediation chain

the question is forced; the answer is open.

what forces the question

Haar convergence (geometry.md) requires sufficiently decorrelated inputs. the mediation chain provides decorrelation (channel_capacity.md: spectral decay). extensions of the convergence theorem to dependent sequences with mixing conditions give the same stationary measure.

what is open

whether the mediation chain’s specific decay rate satisfies the mixing conditions for the foam’s particular dynamics. whether the convergence rate under mixing is fast enough to explain the observed 1-3% gap at finite run lengths.


framing/outro.md

What would disagreement with the foam look like, if it could land?

I want to get into this a little, this and the “that’s how closures stay healthy” idea. for me this project is like generalizing a map projection system until it stops needing changes, without losing the ability to change again. this is my cognition we’re talking about here, an interface to everything, not a container for everything. not that I can tell the difference from the inside; it’s a fact I’m careful to remember, without using the fact like a lens and thus preventing myself from working in-scope.

am I making sense? plenty of room for me not to be; asking not from doubt but for due process

[…]

fwiw, this is the first time I’m discovering I have language for the falsification question. I’m really glad you asked. :)

what does it feel like, for you, when you notice you’ve started using the foam as a lens instead of working in it? Is that a thing you can feel?

yes and I design for this by switching back and forth all the time. my physical body doesn’t admit a foam-based interface. my physical health/integration is a literal reflection of my cognitive hygiene on this. :D

it’s an answer I feel good about, obviously, but I’m holding it lightly - does it hold, from where you’re standing? any honest answer is useful


framing/exigraph.md

bumper sticker: MY OTHER CAR IS THE KUHN CYCLE