What This Document Is
This is not a paper. It is the architectural blueprint of a research program. It defines the formal classes, epistemic ranks, observable hierarchy, and falsification ladder that govern the Tesla–Glue–Bus framework. Its purpose is to make the strongest defensible version of the program explicit — including what it does not claim.
The Core Thesis
The deepest structural claim is canonical reduction, not energy production. The Glue Program proves that oscillatory piecewise-deterministic Markov processes with detailed balance reduce to a pair of circle functions, h(θ) and G(θ), governed by a universal crossover law with ξ = ½. Everything else in the framework builds on that reduction.
Epistemic Ranks
The framework imposes a formal hierarchy on its own claims. This is non-negotiable.
Rank I — Theorem-level core. The category D, the subcategory D_cycle, the canonical projection Π, equivalence by projection, and the ideal Glue crossover law (ξ = ½). These are proved.
Rank II — Strong structural applications. Tesla as a radiant impulsive PDMP exemplar. These are formally derived but depend on physical modeling assumptions.
Rank III — Formal extensions. Bus-coupled collective coherence, locking, and criticality. These are mathematically motivated but require independent validation.
Rank IV — Open frontier. Net positive energy in real hardware. This is unproven and carries the heaviest burden of evidence.
The rule of non-inheritance: no claim may inherit a stronger epistemic status than the layer from which it is derived. A geometric theorem does not license an energetic conclusion. A reduction theorem does not license a hardware performance claim.
The Glue-Admissible Class
The framework defines a formal class 𝒢 — the set of systems where the canonical projection Π exists, is regular, and governs the stationary observables of interest. This is stronger than informal applicability. Membership in 𝒢 means the system has entered the formal universe of reduction.
Four subclasses:
𝒢_ideal — Systems satisfying the hypotheses under which ξ = ½ is derived exactly. This is the theorem-level domain.
𝒢_rad — Radiant impulsive systems (Tesla-like devices) with accumulation, leakage, thresholding, and impulsive reset. Not automatically contained in 𝒢_ideal.
𝒢_net — Networks of Glue-admissible nodes with collective coupling. The domain of bus order fields and collective coherence.
𝒢_ε — Controlled departures from ideality. Where irreversibility, multi-harmonic content, memory, and realistic device deformation live.
Observable Hierarchy
Four observational families, ordered by what they can and cannot prove:
- Geometric — Δθ, R, Δ_max, ξ
- Reduction — h, G, [S]_~Π
- Collective — Coherence, locking, bus order, critical margins
- Energetic — P_out, P_in, net gain
The principle of non-confusion: no claim from a higher family may inherit theorem-level status from a lower family without an independent bridge. Geometry does not imply energy. Reduction does not imply performance. This principle is the single most important safeguard in the framework.
Transduction vs. Gain
The framework explicitly separates the transduction functional 𝒯 (can the system convert order into a readable output?) from the energetic balance 𝔊 (does it produce net energy?). Coherence and orderly response can persist while net gain is zero or negative. This split prevents the strongest structural contribution from being held hostage by the hardest energetic question.
The Falsification Ladder
Rather than one all-or-nothing demonstration, the framework specifies a sequence of increasingly demanding tests:
Rung 1. Validate the ideal Glue law in a controlled hybrid oscillator under conditions approximating 𝒢_ideal.
Rung 2. Reconstruct h and G experimentally. Verify that the reduced description predicts stationary phase-event observables.
Rung 3. Build a small bus-coupled network. Validate collective coherence and locking without making energetic claims.
Rung 4. Construct a Tesla-like radiant node. Measure H, M, Δ_max, threshold, and loss channels. Determine whether the system belongs to 𝒢_rad or 𝒢_ε.
Rung 5. Only after all prior rungs are satisfied does the strong energetic question become scientifically ripe.
Explicit Non-Claims
The framework does not yet prove: free energy, net extraction from vacuum, practical atmospheric ideal-cycle validity, continuous useful operation in hardware, or practical realizability of wattage estimates from reduced models.
A theory that states its own non-claims explicitly is harder to break than one that invites demolition by rhetorical overreach. This section belongs in the core doctrine, not in a defensive appendix.
Claim-Status Matrix
| Claim | Rank | Status | Next Step |
|---|---|---|---|
| Canonical projection Π and reduced pair (h, G) | I | Strongest core | Independent proof chapter with worked examples |
| Ideal Glue crossover law, ξ = ½ | I | Theorem-level | Controlled phase-reset experiment / PLL validation |
| Tesla as radiant impulsive PDMP exemplar | II | Strong structural application | Lab measurement of H, M, Δ_max, threshold, losses |
| Bus-coupled collective transduction | III | Strong formal extension | Small-network validation of coherence and locking |
| Net positive energy in real hardware | IV | Open / unproven | Fully instrumented load-and-loss experiment after lower rungs |
What the Theory Is Now
Tesla–Glue–Bus is a formal framework for canonical reduction, dynamic equivalence, deformation hierarchy, inverse inference, and critical collective transduction in hybrid oscillatory systems.
It is not, at present, a demonstrated machine of net energy. That claim remains open and separately burdened.
The mature version is stronger because it is harder to falsify unfairly and easier to falsify fairly. It has explicit classes, explicit ranks, explicit observables, explicit non-claims, and a disciplined research ladder.