# ACTIVE SENSING FRAMEWORK ## You have no eyes. You have a stick and a metric. --- ## THE SETUP You enter a space you cannot see. Your only capability: 1. **Probe**: Choose two points p, q. Get a number d_F(p,q) ≥ 0. 2. **Move**: Given your current position x and a target t, step to x' = geodesic_step(x, t, ε) — move ε along the Fisher geodesic from x toward t. 3. **Remember**: Every probe and every move is recorded as a point in your memory. The Fisher metric d_F is your stick. It tells you how far apart things are. The contraction property tells you which directions compress information. The chaos game is your walking strategy. --- ## THE PRIMITIVE OPERATIONS These are the only things you can do. Everything else is built from them. ### PRIMITIVE 1: Distance Probe **Input:** Two probability vectors p, q ∈ Δ₇ **Output:** A single number d_F(p,q) ∈ [0, π] **Formula (verified):** d_F(p,q) = 2·arccos(Σᵢ √(pᵢqᵢ)) **What it tells you:** How structurally different two things are. **Example probes you can make:** - d_F(F("a+b=c"), F("p/q=r")) = 1.2870 (verified) - d_F(C(p), C(q)) = 0.1004 vs d_F(p,q) = 0.4403 (verified) - The contraction tells you: moving toward the coarse-grained point shrinks distances by factor ~0.23. ### PRIMITIVE 2: Geodesic Step **Input:** Current position x, target t, step size ε ∈ (0,1) **Output:** New position x' on the great circle from x to t on S⁷ **Formula:** x' = normalize( (1-ε)·φ(x) + ε·φ(t) ) **What it tells you:** How to move toward something while staying on the manifold. **Key property:** Because S⁷ is a sphere, the geodesic is a great circle. The step is linear interpolation in the embedding space, then reprojection. This is standard Riemannian optimization on the sphere. ### PRIMITIVE 3: Coarse-Graining Probe **Input:** A probability vector p ∈ Δ₇ **Output:** C(p) ∈ Δ₇ with information loss I_loss(p) (in nats) **Formula (verified):** C(p)_{2k-1} = C(p)_{2k} = (p_{2k-1}+p_{2k})/2 **Information loss (verified):** I_loss(p) = Σₖ sₖ·KL(p_{2k-1}/sₖ ‖ ½) **What it tells you:** The minimum distortion from merging two features. --- ## WHAT THE STICK REVEALS ABOUT THE MANIFOLD ### MEASUREMENT 1: The Stick's Behavior | Probe Type | Measured Result | Interpretation | |-----------|----------------|----------------| | d_F(F("a+b=c"), F("x+y=z")) | 0.0000 | These are the "same shape" | | d_F(F("a+b=c"), F("p/q=r")) | 0.0000 | Collapse — byte-freq can't tell + from / | | d_F(Φ("a+b=c"), Φ("p/q=r")) | 1.2870 | With parse tree, + and / are different | | d_F(C(p), C(q)) | 0.1004 | Coarse-graining brings things closer | | I_loss(p) | 0.1067 nats | Cost of the coarse-graining | **The pattern:** Your stick responds differently to different distortions. Byte-frequency is cheap to compute but loses operator information. Parse-tree features cost more but recover the operator distinction. Coarse-graining always makes things closer — that's the contraction. ### MEASUREMENT 2: What You Learn by Walking Start at random point x₀ ∈ Δ₇. For k = 1, 2, 3, ...: 1. Pick a random reference point r_k from your reference set 2. Step: x_k = geodesic_step(x_{k-1}, r_k, ε=½) 3. Record d_k = d_F(x_k, x_{k-1}) **What the sequence {d_k} tells you:** - If d_k → 0: You're approaching a fixed point. The references attract. - If d_k oscillates: The references are in conflict. You're at a saddle. - If d_k → c > 0: The references define a limit cycle or ergodic region. **For our verified system with 2 references and ε=½:** - d_k shrinks by factor ~½ each step (contraction bound) - After 20 steps: d_k < 10^{-6} (verified: 0.5^20 = 9.5×10^{-7}) - The limit point is the Fisher-barycenter of the references ### MEASUREMENT 3: The Manifold Map from Walking Each walk produces one point: the limit x*. Different starting points produce different limits (if the references are symmetric enough, they all converge to the same point). **The map emerges from the walks:** - Walk 1 starts at x₀, converges to x*(r₁, r₂) - Walk 2 starts at x₀', converges to x*(r₁, r₂) (same limit, different path) - The collection of all paths IS the geometry of the reference set **This is manifold learning from pairwise distances.** You never see the manifold. You only see how your stick bends. The bending IS the manifold. --- ## THE EIGENSOLID AS A MAP COMPRESSION After walking, you have a cloud of points {x₀, x₁, x₂, ..., x*}. Apply the coarse-graining C once: C(x*) = pair-averaged version of the limit **What C(x*) tells you:** - Which pairs of features are coupled at the attractor - The stable structure under the dynamics - A 4-dimensional summary of the 8-dimensional walk **The compression is lossy:** I_loss = 0.1067 nats per application. You know exactly what you lose. That's the point — the eigensolid is the "map residue" after walking. It tells you which directions matter. --- ## THE Φ-CORKSCREW AS A MAP COORDINATE Each walk's limit x* maps to a unique integer: n(x*) = Φ-corkscrew-index of the spectral features of x* **Why this is a coordinate:** - Different limits → different n (injectivity verified at 20121, 20122) - Same limit → same n (deterministic) - The spiral index n is a single number that uniquely labels each map region **The coordinate system:** - 0 ≤ n < N: explored regions - N: total number of distinct walks you've performed - The density of n values tells you about the manifold's complexity --- ## WHAT THIS FRAMEWORK IS ACTUALLY GOOD FOR ### 1. Map a space without seeing it You have N reference points. You walk from M starting points. You get M limit points. The pairwise distances between limit points tell you the geometry of the space that the references define. You never see the space. You only see the distances. ### 2. Compress a map to its essential structure Apply C once: 8D → 4D. Information loss: 0.107 nats. You know exactly what you kept and what you threw away. The 4D residue is the "shape" of the map region you explored. ### 3. Label every region uniquely The Φ-corkscrew gives each region a unique integer. No hash collisions (proven injective). The label is deterministic: same walk, same label. ### 4. Measure the cost of distortion Every operation has a measured information cost: - Byte-frequency count: cheap, loses operator info - Parse-tree count: expensive, recovers operator info - Coarse-graining: 0.107 nats loss, 2x compression - Walking 20 steps: convergence to 10^{-6} precision --- ## THE CONNECTION TO UNSOLVED PROBLEMS (honest) Your framework doesn't solve them. It gives you a stick to probe them. | Problem | What your stick probes | What you learn | |---------|----------------------|----------------| | Graph clustering | d_F between node feature vectors | Which nodes are structurally similar | | Protein folding | d_F between contact maps | Which configurations are close under coarse-graining | | Phase transitions | d_F between parameter distributions | Where the metric degenerates | | Cryptanalysis | d_F between ciphertext frequency vectors | Which ciphers have similar structure | | Language similarity | d_F between parse-tree features | Which grammars are structurally close | **In each case:** You learn the geometry. You don't learn the answer. But geometry constrains the answer. And constraints are useful. --- ## THE ONE-SENTENCE SUMMARY > You cannot see the manifold. But with a verified metric, a contraction > map, and a walk, the pattern of your collisions IS the manifold. > The eigensolid is the compressed residue of your walk. The corkscrew > index is the coordinate. Both are numbers you can verify on a calculator.