Pulse Core Lexicon
Constrained Pulse Folding Function
Definition
Constrained Pulse Folding Function is the folded form of the pulse, in which modular arithmetic keeps the amplitude of quadratic recursion bounded while a phase factor preserves its structure.
Quadratic growth is taken modulo a folding boundary, so the output cycles within a fixed range instead of diverging; the topological operator then carries the folded value as a phase around a circle, so the recursive structure is kept rather than discarded. The book calls this nature's solution to the computational divergence problem.
⥂(n) = [(n+1)² mod F(n)] × Ψ⧝, where n is the recursion level, F(n) = floor(√(n² + 1)) the folding boundary, and Ψ⧝ = exp(i × 2 × π × ◊/F(n)) the topological preservation operator, ◊ being (n+1)² mod F(n); all are [∅].
It connects to UniSpheral First Fold Function, Unbounded Recursive Amplification, Folding Mechanism and Topological Containment.
Mathematical Expression
From the book · Chapter 3 · Pulse Radius, The First Fold, and Recursive Constraints
⥂(n) = [(n+1)² mod F(n)] × Ψ⧝ [∅]
Dimensional analysis:
Where (from the book): 1 [∅], n [∅], mod [∅], Ψ⧝ [∅], ◊ [∅], i [∅], π [∅], floor [∅], √ [∅], exp [∅]
Read dimensionally: ⥂(n) = ((n+1)² - F(n)) × Ψ⧝
[∅]
([∅] - [∅]) × [∅] = [∅] × [∅] = [∅]
[∅] = [∅] ✓ Valid PulseCore Verified ✓
Prevents unbounded amplification.
Where:
- ⥂(n) [∅] – folded Pulse function (bounded output)
- n [∅] – recursion level
- (n+1)² [∅] – quadratic amplification term
- mod [∅] – modulo operation
- F(n) [∅] – folding boundary function = floor(√(n² + 1)), which is n for every n ≥ 1: the boundary, not the First Fold Function (n + 1)² mod n, whose value 1 for n ≥ 2 would leave (n+1)² mod 1 = 0
- Ψ⧝ [∅] – topological preservation operator = exp(i×2×π×◊/F(n))
- ◊ [∅] – the result of (n+1)² mod F(n)
- i [∅] – imaginary unit
- π [∅] – pi constant
- floor [∅] – floor function
- √ [∅] – square root function
- exp [∅] – exponential function
- 1 [∅] – unit constant
Technical Details
Category Concept
Chapter Chapter 3
Importance
In the book Not used by this name yet