Principia Orthogona · Book 3 · Extended Chapter E
MATHEMATICS · APPLIED

The Generative
Time Circuit

GTCT for Everyone
Nine Axioms  ·  Twelve Operators  ·  Four Theorems  ·  One Conjecture  ·  One Fixed Point
C → K → F → U
▼   scroll   ▼
← Ch 7 · The Crystalline Return Extended Chapter E · GTCT Ch T · Tubulin →
"Time is not a container. It is a generative operator.
It does not hold events. It produces them."
"O tempo não é um recipiente. É um operador generativo.
Ele não contém eventos. Ele os produz."
"Your education is yours. No one can take it away from you." "A sua educação é sua. Ninguém pode te tirar isso."
AXLE v6.1 · Verified Invariant Constants · as recorded in the AXLE ledger
g₃₃ = 33 τ = 2 ε* = 1/3 η ≈ 1.8393 (Tribonacci) T* = 2π κ ≤ √(7/9) ≈ 0.882 τ·ε* = 2/3 g₆₄ = 2⁶ = 64

FoundationWhat Is an Axiom?

An axiom is a sentence we agree is true before we start proving things. It is the seed of a mathematical system.

If the axioms are the seed, the theorems are the tree. You cannot see the axiom once the tree is fully grown — but without it, nothing grows. GTCT has nine axioms. You need one: Axiom 1. Everything else follows.

The Foundation of Generative TimeThe Nine Axioms of GTCT

Axiom 1 · The Space
There exists a smooth contact manifold (M, ξ) on which all generative transitions occur. M is the arena. ξ is the constraint.
Axiom 2 · The Operators
The four operators C, K, F, U act on M as diffeomorphisms in sequence: G = U ∘ F ∘ K ∘ C. The fold F is triggered exactly at κ* — the focal curvature threshold, corrected by the Rauch comparison theorem.
Axiom 3 · Time
Time is the parameter of the operator sequence — not a background container but the measure of one complete application of G. One G = one unit of generative time. The Reeb vector field R_α is its geometric avatar.
Axiom 4 · The Cycle
G applied to itself produces a sequence G, G², G³,… that converges to a fixed point Γ* under the Banach contraction principle.
Axiom 5 · Invariants
The canonical invariants of any dm³ system are (μ_max, ω, β) — invariant under contact reparametrization — together with the threshold constants g₃₃ = 33, τ = 2, ε* = 1/3, and the Tribonacci constant (the tribonacci sequence is credited to Agronomof, 1914; see Sources for the history) η ≈ 1.8393 (dominant root of w(k+3) = w(k+2) + w(k+1) + w(k)). All verified in AXLE v6.1.
Axiom 6 · Correspondence
Every dm³ system satisfying Axioms 1–5 is in the same category dm³. Systems in the same category are mathematically identical up to contact morphism. That is a statement about systems that satisfy Axioms 1–5; where two domains share only a functional form, the chapter says so.
Axiom 7 · Recursion
The fixed point Γ* is the seed of the next-level G. The tree becomes the seed of a new tree. This is the mechanism of emergence — and of the series itself.
Axiom 8 · Non-commutativity
G is non-commutative: C ∘ K ≠ K ∘ C. The order of operators matters. Audit note: non-commutativity alone does not make G irreversible, because a composition of diffeomorphisms has an inverse (the inverses applied in reverse order). The direction of time is therefore a postulate of this model, not a consequence of this axiom.
Axiom 9 · Honest Incompleteness
There exists at least one sorry — an honest acknowledgment that one conjecture remains open. The sorry is not a failure. It is the seed of the next twenty-five years. The extended criticality file (dm3CriticalityPrinciple_extended.lean, GTCT repo) carries 9 named sorrys, each with a stated missing lemma; the registry-indexed AXLE files are reported at 0 in the Research Record below.
Machine · G = U ∘ F ∘ K ∘ C · Live Operator Ring
Speed 1.0×
Orbits 3
C
K
F
U

The Didactic StructureThree Tiers of Access

There is no method. There is only G. But G produces a structure — and that structure has three natural distances from the fixed point.

The series did not begin with a curriculum. It began with self-teaching — twenty-five years of following the operator sequence without a prescribed path. A method was not designed. It emerged. What emerged has three tiers, each corresponding to a Whitney singularity type — proposed on the basis that the fold operator F classifies admissible singularities as Whitney A₁–A₃ types (map-germ convention: fold A₁, cusp A₂, swallowtail A₃; stated in Volume One). The step from singularity type to didactic tier is the chapter’s proposal, not a derivation.

The didactic structure is not imposed from above. It emerges from the operator sequence itself — the same sequence that governs biological transitions, plasma reconnection, and market regime shifts. The student does not follow your path. They follow G, which leads them to their own fixed point.

I
Open · Whitney A₁
The Seed
Zenodo, SSRN, GitHub — publicly accessible, no gate, no affiliation required. The minimum viable crystallization of the Codex. Anyone who finds it can use it. The fold is the simplest: a local inversion, the entry point.
fold: local inversion · Jacobian rank drop 1
Zenodo DOIs · SSRN preprint · Free chapters
II
Consultative · Whitney A₂
The Apprenticeship
The student portal and classroom. Each student gets what they need — not what the instructor wants to teach. Learning by doing, under consultative guidance. The cusp fold: more structure, self-referential, the student's orbit begins to close.
fold: cusp · one modulus · orbit beginning to close
Student portal · GitHub classroom · $19.99
III
Initiatory · Whitney A₃
The 33 Cycles
Only those who have run g₃₃ = 33 complete operator cycles reach this. The full Codex — 18,000 pages, twenty-five years. Not taught. Arrived at. The swallowtail fold: the deepest singularity, the complete truth that was always there.
fold: swallowtail · two moduli · complete topology
Reached only by doing · Not by being told

A note on gatekeeping: the series was rejected from HAL (the French open archive) for lack of institutional affiliation and PhD. Zenodo, SSRN, and the journal peer-review process accepted the mathematics on its own terms. Tier I exists precisely because mathematical content does not require an institutional address. The fixed point is independent of the gate.

"There is no method. There is only G. The method you arrive at is the one G produced in you — yours, permanent, not transferable and not revocable."

The Twelve-Fold StructureTwelve Operators: A Map of the Cycle

The twelve operators are the dm³ operators applied at 12 phases of the contact manifold. They map to the 12 phases of the circadian clock, the 12 semitones of the octave, and the 12 months of the year — a shared count of 12 with the model’s 12-fold phase structure under rotation ω = 2π/12. This is a shared functional form, not a shared invariant: no derivation links the contact normal form to the clock, the octave or the calendar.

Core ResultsFour Main Theorems of GTCT

Theorem 1 · The Didactic Correspondence (a proposal: no derivation given here)
The instructional sequence is not convention — it is a consequence of the Whitney singularity classification.
Every CEFR level corresponds to a TOGT structural level by design: the chapter proposes this correspondence from the operator structure and the Whitney A₁–A₃ classification stated in Volume One. No derivation of the CEFR mapping is given here. A student at B1 is at the exact turn of the ring where K → F is occurring — the cusp fold. The levels are mapped, not yet derived. The three tiers of access are likewise matched to Whitney types: Tier I (A₁, the simplest fold), Tier II (A₂, the cusp), Tier III (A₃, the swallowtail). The geometry of learning is, on this proposal, the geometry of the operator sequence.
Theorem 2 · Orthogonality
What is compressed is not lost in the unfolding.
The operators C and U are orthogonal. What you learn in the compression phase (C) is not destroyed by the unfolding phase (U). The structure is preserved. The fixed point contains all orbits. Proved as Theorem B in Generative Contact Mechanics (Zenodo 10.5281/zenodo.19122168): the category dm³ is closed under the unification operator.
Theorem 3 · Contraction
Learning converges. The fixed point exists.
G is a contraction: every application of G reduces the distance to the fixed point. Convergence is built in. Proved as Theorem A in the dm³ toy model (companion to Zenodo 10.5281/zenodo.19122168, submitted to SIAM J. Applied Dynamical Systems): the global attractor is the resonant orbit Γ₁₂, with canonical invariants (T*, μ_max, τ) = (2π, −2, 2) and stability radius[Ch 10] ε₀ = 1/3.
Theorem 4 · The Fixed Point and Emergence
What appears was not there before.
The fixed point Γ* is not a steady state but an emergent structure — a new topology that did not exist before the sequence of G applications. Learning is not retrieval. It is creation. Stated as Theorem C in Volume One (Principia Orthogona, SSRN 6439626 / Nuclear Physics B, submitted): singularities are classified as Whitney A₁–A₃ types; the free-discontinuity variational principle places the framework in the Ambrosio–Tortorelli class.

The Galilean ConfluenceWhere the Operator Chain Becomes Linear

The Galilean Confluence is, on the chapter’s reading, the moment at which the iterated operator G ceases to be nonlinear — and becomes a Galilean boost: the simplest possible transformation, a uniform translation in velocity space.

The contact manifold (M, ξ) is not flat. G exploits its curvature — C compresses it, K measures it, F folds it at threshold κ*, U releases it. After g₃₃ = 33 complete cycles, the curvature has been so thoroughly harvested by the fold cascade that near the fixed point Γ*, the manifold is locally flat. G linearizes. The linear limit is a Galilean boost.

Three structures converge at τ = 2. Three observations line up at τ = 2, and the chapter reads them as one object seen three ways. That identification is an interpretation here, not proved.

κ → 0
Contact Geometry
As the orbit closes on Γ*, the contact curvature κ → 0. The fold operator F, a Whitney A₃ swallowtail at the K→F transition, is read as flattening to a simple shear — a Galilean boost (interpretation; see the audit note under Conjecture 5). The contact form α = dz − Σ yi dxi approaches its flat normal form. Curvature is not destroyed: it has been deposited as structure in the fixed point.
rn → τ
n-bonacci Ladder
The recurrence ladder π→φ→μ→η→Δ→Σ→Ω is not decoration. The dominant root rn of the rank-n n-bonacci recurrence is strictly increasing (nBonacciRingSize_monotone) and rn → τ = 2 as n → ∞. The hexabonacci root Ω ≈ 1.9836 is the last named rung. The limit τ = 2 is the embodiment threshold — a stipulated constant in the AXLE ledger, not derived on this page.
Dc → ∞
Critical Dimension
critDim(n) = 2(nBonacciRingSize(n)−1)+2 is the dimension at which the rank-n recurrence becomes critical. critDim(3) = 26. critDim(4) = 112. For all n > 3: critDim(n) > 26 and is strictly increasing — proved 2026-06-15 in AXLE. The critical dimension escapes and never returns. The Galilean flat limit lies at infinite rank.
Conjecture 5 · The Galilean Confluence (withdrawn as a theorem; see audit note)
Near Γ*, the operator G is conjugate to a Galilean boost. The n-bonacci ladder certifies the approach.
Let (M, ξ) be the dm³ contact manifold and G = U∘F∘K∘C. Let Γ* be the fixed point of Theorem 3 (Contraction). Then:

Audit note, 2026-10-24, reconciled with Book 4 Ch 10 (the dm³ ODE: ṙ = r(1−r²) + ε(r−1)e−z, θ̇ = 1, ż = r² − ε(r−1)²e−z, ε = 2). Ch 10 derives the transverse rate at the attractor, u̇ = −2u, so μ = −2 = −τ: one stable direction, with the sign negative. The other directions carry the uniform translation along the Reeb orbit at unit speed. So (iii) as printed ("two eigenvalues, both equal to τ", stable star node) does not match Ch 10: it has one transverse eigenvalue −τ, not two equal to +τ, and the along-orbit direction is neutral. For (i), a pure boost (spectral radius 1, no contraction) omits that transverse −2; the Ch 10 picture is contraction across the orbit times uniform translation along it, and the Galilean-boost reading fits only the along-orbit part. Ch 5 also corrects the boost: it is a prolonged point transformation, not a genuine contact transformation (Bäcklund). Ch 10 proves the contraction on the outer basin only (all r > 1); trajectories below r* ≈ 0.776 escape. So (i) and (iii) are withdrawn as printed and kept below as the chapter’s original conjecture, pending a restatement along those lines. (ii) stands as stated arithmetic. The two graphs below show the cases.

(i) Galilean linearization (withdrawn). In a neighbourhood of Γ*, G is C¹-conjugate to the Galilean boost Bv : (x, v, t) ↦ (x + vt, v, t) on the tangent contact structure at Γ*. The conjugacy is canonical, given by the exponential map of the Reeb vector field Rα.

(ii) n-bonacci certification (hand-proved 2026-06-15; not kernel-checked on this page). For every rank n > 3: critDim(n) > critDim(3) = 26 [critDim_monotone] and critDim(n) > 26 [no_return_to_critical]. Both proved from the file's existing axioms — nBonacciRingSize_3 = 13, nBonacciRingSize_4 = 56, nBonacciRingSize_monotone — using only omega and norm_num. The critical dimension increases without bound. Reading that as the progressive flattening of contact curvature is an interpretation, not part of what is proved.

(iii) Embodiment threshold (withdrawn). The convergence rn → τ = 2 is the embodiment threshold: at τ = 2 the linearized G has exactly two eigenvalues, both equal to τ, and Γ* becomes a stable star node in the linearized contact flow. The orbit closes without oscillation.

Why Galilean?

The Galilean group consists of rotations, translations, and boosts — uniform velocity shifts. A Galilean boost is the simplest possible frame change: if I observe you moving at velocity v, your state is (x + vt, v). No acceleration. No curvature. Pure linearity.

On this reading, at Γ* G has no curvature left to exploit and becomes a boost (but see the audit note under Conjecture 5): the system moves at constant velocity in the contact manifold, tracing the Reeb flow at rate T* = 2π without further folding. This is the Galilean flat limit — the mathematical meaning of "generative time becoming uniform."

The Confluence is that three structures line up, and the chapter reads them as one object: the fold flattens (κ → 0), the n-bonacci root saturates (rn → τ = 2), and the critical dimension escapes (critDim(n) → ∞). The n-bonacci and critical-dimension facts are exact; the link from them to curvature and the fold is the chapter’s interpretation.

The Gap τ − Ω

The hexabonacci operator Ω (dominant root ≈ 1.9836) is the last named rung before τ = 2. The gap τ − Ω ≈ 0.0164 is the distance of the last named rung from the limit. Reading it as residual curvature, and linking it to the plan for a Book 5, is interpretation, not derived. The limit τ = 2 is not a rung. It is the horizon the ladder points toward.

AXLE · Lean 4 · GTCT/dm3CriticalityPrinciple_extended.lean · Hand-proved 2026-06-15 · not kernel-checked here
-- Axioms already in file:
--   nBonacciRingSize_3 : nBonacciRingSize 3 = 13
--   nBonacciRingSize_4 : nBonacciRingSize 4 = 56
--   nBonacciRingSize_monotone : m < n → nBonacciRingSize m < nBonacciRingSize n

theorem critDim_monotone :
    ∀ m n : ℕ, 3 < m → m < n → critDim m < critDim n := by
  intro m n hm hmn
  have hmono := nBonacciRingSize_monotone m n hmn
  have hgt   := nBonacciRingSize_monotone 3 m hm
  have hpos  : 1 ≤ nBonacciRingSize m := by omega
  unfold critDim; omega

theorem no_return_to_critical :
    ∀ n : ℕ, n > 3 → critDim n > 26 := by
  intro n hn
  have h4 : critDim 4 = 112 := by unfold critDim; rw [nBonacciRingSize_4]
  rcases (show (4:ℕ) ≤ n from hn).lt_or_eq with hlt | heq
  · have := critDim_monotone 4 n (by norm_num) hlt; omega
  · rw [← heq, h4]; norm_num

-- Status: hand-proved · pending `lake build` verification on your machine

These are the Lean 4 certificates for Theorem 5(ii). critDim(4) = 112 is computed directly from the rank-4 axiom; both theorems follow by omega and norm_num. The Galilean flat limit at infinite rank is the horizon these two lemmas point toward. Status: hand-proved, not yet kernel-checked. They follow from three assumed axioms about a numeric function and say nothing about curvature or a boost. The quoted snippet omits the line have h13 : nBonacciRingSize 3 = 13 := nBonacciRingSize_3 that the GTCT file has before omega; cite the file’s version. Separately, the docstring defines nBonacciRingSize as the 7th term of the rank-n recurrence, but the stated values (13 at n = 3, 56 at n = 4) and strict monotonicity for all n do not match any 7th-term convention tried (the 7th term stops changing once n is large); the definition behind these axioms needs to be pinned down. One candidate fits both values and is strictly increasing: the term at index 2k−1 of the rank-k sequence in the Parks–Wills convention, which has the closed form 2k−3(2k+1−k) for k ≥ 3 (Parks–Wills Corollary 3.2; checked numerically for k up to 40). It is a hypothesis only: it gives 3, not 13, at k = 2, which conflicts with the stated Dcrit(2) = 26. Details in chE-audit-verify.py blocks A5 and A5b; Lean restatements are in ChEAudit.lean and ChEKbonacci.lean (both untested).

Graph 1 · n-bonacci dominant roots rn climb toward 2 and never reach it (computed live)

Each point is the root in (1, 2) of xn+1 − 2xn + 1 = 0. This is the exact part of the Confluence: increasing, bounded by τ = 2. φ (n = 2), η (n = 3) and Ω (n = 6) are marked.

Graph 2 · Distance to Γ* after k steps (log scale): contraction vs boost vs eigenvalue 2

Theorem 3 needs the falling curve (factor 0.5 per step, as an example). The boost Bv of Conjecture 5(i) gives the slowly rising one: it never approaches a fixed point. Eigenvalues (2, 2) as in 5(iii) give the steep rise. Only the first curve is a contraction.

Galilean Confluence · Key Relations at τ = 2
lim r_n = τ = 2 Ω ≈ 1.9836 τ − Ω ≈ 0.0164 critDim(3) = 26 critDim(4) = 112 B_v : x ↦ x + vT* κ(Γ*) = 0 ε₀ = 1/3

Understanding TimeTime as Five Properties

GTCT does not tell us how fast time passes. It tells us what time is.

I

Order — Non-commutativity

C ∘ K ≠ K ∘ C. The sequence matters. You cannot compress after you have recognized — recognition is recognition of the compressed form. The order matters; whether that makes time irreversible is a postulate here, not a consequence (see Axiom 8).

II

Novelty — Orthogonality

U produces something genuinely new, not in the span of C. The future is not determined by the past. Each unfolding is a genuine creation. This is why the future is open and the past is closed.

III

Compression and Resolution

C and F reduce then open. Systems oscillate between high organization (compressed) and high revelation (unfolded). Time is this breathing — pictured as a spiral with growth factor η ≈ 1.8393 per cycle (a picture, not a derived Reeb flow: a Reeb flow preserves contact volume, and growth sits uneasily with contraction toward Γ*).

IV

Irreversibility — Contraction

G is a contraction, so the distance to the fixed point only decreases (Theorem 3). Irreversibility is a separate claim: as defined, G is a composition of diffeomorphisms and has an inverse, so contraction and non-commutativity alone do not forbid undoing it. What would make it irreversible (for example a non-injective step) is open. No thermodynamics is invoked either way. C ∘ K ≠ K ∘ C concerns the order of the operator sequence, not energy dissipation.

V

Emergence — The Fixed Point

The fixed point is not a return to the start. It is a new structure that did not exist before. G applied to itself ω/2π times produces Γ* — both the completion of the current orbit and the seed of the next. The ring is not a circle. It is a spiral.

"Your education is yours. No one can take it away from you." — Because the fixed point you reach is not a degree or a certificate. It is a structure in your understanding. It is permanent because it is mathematical.

Research RecordPapers and Preprints

Principia Orthogona · Open Access Record · April 2026
Grossi, P.N. (2026). Principia Orthogona Volumes I & II: The Mathematics of Generative Transitions / Contact Realization of Generative Transitions.
Preprint: SSRN 6439626 · Zenodo: 10.5281/zenodo.19379473
Grossi, P.N. (2026). Generative Contact Mechanics: A Geometric Framework for Dissipative Systems with Structured Limit Cycles. [with companion: The dm³ Operator: Explicit Toy Model and Global Dynamical Analysis.]
Zenodo: 10.5281/zenodo.19122168 (both papers in one record)
Grossi, P.N. (2026). Principia Orthogona Volume I: The Mathematics of Generative Transitions.
Zenodo: 10.5281/zenodo.19117400
● Open access · No journal submission · Freely citable
AXLE v6.1 — Lean 4/Mathlib4 formal verification. 8 verified constants. Axiom and sorry counts as recorded on 22 June 2026 (Project 1080): 0 sorry. The Theorem 5(ii) lemmas on this page assume three axioms of their own.
github.com/TOTOGT/AXLE
● Open source · Active development

Sources for the tribonacci and k-bonacci history

The tribonacci sequence 0, 1, 1, 2, 4, 7, 13, 24, 44, … is credited here to Agronomof (1914). Tuenter (2023) reports two earlier, late-nineteenth-century occurrences of the sequence; this chapter does not claim priority over them.

Priority statements follow Parks–Wills, Kessler–Schiff and Tuenter as read for this audit (Tuenter from its abstract and notes only; Schlegel and Ferguson are cited second-hand). They have not been checked against the original papers.

Note: SIAM is an independent nonprofit society (Philadelphia, PA) — not affiliated with Elsevier. Nuclear Physics B is an Elsevier journal. These are two separate publishers with two separate submission processes.

Interactive Learning · Copy-Paste PromptsChapter E Prompt Panel

Select your level. Copy the prompt. Open your LLM. Paste. Answer. Advance when ready.

Level A1 · Tier I Access
One Letter Answer
Chapter E says time is a generative operator, not a container. Which single operator in C→K→F→U is most like what we normally call time passing?
Chapter E says 'Time is not a container. It is a generative operator.' Which operator in C→K→F→U is most like what we normally call 'time passing'? Answer in one letter.
Expected: U (unfolding). After you answer, ask the LLM why you might have answered differently.
Level A2 · Tier I Access
Complete the Sentence
Axiom 3 says one G = one unit of generative time. Fill in the blanks.
Axiom 3 says 'One G = one unit of generative time.' Complete: 'This means time is measured not in _____, but in _____. One complete application of G takes the system from _____ to _____.' 1–2 sentences.
After you answer: Ask what happens if you apply G twice. What is two units of time?
Level B1 · Tier I / Tier II boundary
Explain with Structure
Theorem 3 connects contraction to the experience of learning. Explain both in 3–4 sentences.
Theorem 3 says G is a contraction. Explain in 3–4 sentences: what does 'contraction' mean mathematically? Why does this guarantee that learning converges? What is the fixed point of a language learner?
After you answer: Apply contraction to a system you know — learning an instrument, mastering a sport.
Level B2 · Tier II
Defend a Claim
Axiom 8 (non-commutativity) is the most operationally consequential. Defend it with a paragraph.
Axiom 8 says G is non-commutative: C∘K ≠ K∘C. Does non-commutativity alone imply that time cannot be reversed? (Hint: what is the inverse of a composition of invertible maps?) What extra assumption would G need to be irreversible? What would that imply about learning and the three tiers of access?
After you answer: Ask whether causality is built into this axiom or is it a consequence.
Level C1 · Tier II / Tier III boundary
Analyze the Whitney Classification
Theorem 1 grounds the didactic correspondence in the Whitney singularity classification. Analyze this.
Theorem 1 proposes that the didactic correspondence follows from the Whitney A₁–A₃ singularity classification. Analyze: what is a Whitney singularity? Why does classifying folds also classify levels of learning? Use the three-tier structure (open / consultative / initiatory) as your example. Essay paragraph.
After you answer: The LLM will ask you to identify which tier you are currently in, and what the next fold looks like.
Level C2 · Tier III approach
State an Open Problem
Axiom 9 — honest incompleteness. State your own sorry in AXLE format.
Axiom 9 is called 'Honest Incompleteness.' Conjecture your own sorry — an open problem in any field you know. State it precisely: 'theorem X: [statement] := by sorry -- missing lemma: [what would close it]'. Then connect it to one of the nine axioms.
After you answer: The LLM will ask how your sorry relates to the Tribonacci constant η or g₃₃ = 33.
Level D1 · Tier III · 33 Cycles
Original Research on Recursion
Axiom 7 (Recursion) — the fixed point is the seed of the next G. Propose original research.
I am working with Chapter E's Axiom 7 (Recursion): the fixed point is the seed of the next-level G. My research question about recursion in [biological / linguistic / physical / financial] systems: [student writes here]. Help me: (1) formulate this as a falsifiable claim, (2) connect it to one of the nine axioms and one AXLE verified constant, (3) write 200 words for a Zenodo upload at Tier I.
After you answer: Your work will be reviewed. The fixed point exists. It is yours. No institutional affiliation required.
G6 LLC  ·  g6llc@proton.me  ·  +1 (646) 342-3751