Recursive Attenuating Amplification

Prime #

1122

Origin domain

Formal Systems

Subdomain

bounded recursive response → Formal Systems

Core Idea

A single one-shot input is recirculated through a system that retains a fixed sub-unit fraction k of the marginal flow each pass, producing a total response larger than the input but bounded by input · 1/(1 − k). It is the strictly contractive (k < 1) regime of recirculating gain — a convergent geometric series — distinct from continuous-source growth, compounding, and the unbounded k ≥ 1 regime.

How would you explain it like I'm…

Fading Echoes Add Up

Imagine you clap once in a canyon and hear the echo bounce back, then a quieter echo, then a quieter one, fading away. All those echoes added up are louder than your one clap, but they don't go on forever — they fade and stop. Recursive Attenuating Amplification is when one push keeps bouncing back a little weaker each time, so the total is bigger than the start but never blows up.

The Bouncing Dollar

Suppose you spend one dollar at a shop, and the shopkeeper keeps part of it and spends the rest, and the next person does the same. That single dollar keeps getting passed along, but a smaller piece each time, so it adds up to more than a dollar of spending overall — yet it still stops at a fixed total instead of growing forever. Recursive Attenuating Amplification is this: one starting input goes around a loop, a fixed fraction comes back each round while the rest leaks away, and the grand total settles at a definite size bigger than you started with. As long as less than the full amount comes back each round, the sum always stays bounded.

Bounded Geometric Buildup

Recursive Attenuating Amplification is the pattern in which a single transient input gets recirculated through a system that keeps a fixed fraction k (less than 1) of the marginal flow each pass, producing a total response larger than the original input but bounded by the factor 1/(1 − k). The core is a convergent geometric series: a one-shot injection feeds a recirculation operator, a fraction k re-enters each round while the leakage fraction (1 − k) escapes for good, and the accumulated total converges to input × 1/(1 − k). It's a sharply scoped, strictly contractive regime — not continuous-source growth, not stock-based compounding, and crucially not the unbounded runaway that takes over once k reaches or passes 1. So with k = 0.9, one unit of input yields a bounded total of 10 units; the diagnostic move is to find the loop gain k, predict the bounded total, and treat the leakage as the lever for tuning the size.

 

Recursive Attenuating Amplification is the structural pattern in which a single transient input is recirculated through a system that retains a fixed sub-unit fraction of the marginal flow at each pass, producing a total response larger than the initial input but bounded by the factor 1/(1 − k), where k < 1 is the per-round retention or loop gain. The defining commitment is the convergent geometric series: a one-shot injection feeds a recirculation operator, a fixed fraction k re-enters at each round while the leakage fraction (1 − k) escapes, and the accumulated total converges to input · 1/(1 − k). The pattern is sharply scoped — it is the bounded, strictly contractive regime, distinct from continuous-source growth, from stock-based compounding, and from the unbounded regime that obtains once k reaches or exceeds unity. Three ingredients recur invariantly: a one-shot input (a transient stimulus, single pulse, initial spend, or one cohort — not a continuous driver and not a growing stock); a recirculation operator with a fixed retention fraction k applied to the marginal flow each round, paired with leakage (1 − k) that exits and never re-enters; and a bounded closed-form sum in which the total response decouples cleanly from the time-course, its magnitude governed entirely by input and k while the temporal profile is governed by per-loop latency. The single diagnostic move is the same regardless of medium: identify the loop gain k, predict the bounded total as input · 1/(1 − k), and locate the leakage as the lever for tuning the magnitude. Substrate-specific names — multiplier, reverberation, cavity intensity, sustain, sub-critical chain — are local instantiations of one mathematical shape.

Broad Use

• Macroeconomics: the fiscal multiplier — a one-shot injection re-spent at the marginal propensity to consume, with leakage to savings, taxes, imports.
• Room acoustics: Sabine reverberation — a clapped pulse retaining a fraction of energy per reflection.
• Optics: Fabry-Perot etalons and integrating spheres accumulating intensity through sub-unit reflections.
• Neural circuits: a transient input to a recurrent loop with synaptic gain below one, holding a working-memory trace.
• Heat transfer: radiative re-trapping in greenhouse models.
• Chemistry: sub-critical chain reactions.
• Marketing: gossip-protocol reach and sub-viral campaigns below the threshold.

Clarity

Separates four substrate-confused patterns ordinary language fuses — generic amplification, exponential growth, compounding, and bounded recursive response — and converts "feedback getting out of hand" into the precise question of where the single scalar k sits relative to one.

Manages Complexity

Compresses the multiplier, Sabine equation, etalon intensity, and sustain into one shape parameterized by two scalars (input and k), with a clean intervention space: raise k to increase the total, increase leakage to lower it, alter loop latency to reshape timing.

Abstract Reasoning

Yields portable inferences: boundedness is fragile near k = 1 (where 1/(1−k) explodes and grows sensitive to small gain changes); magnitude and timing are separable; and leakage is the cleanest lever on magnitude.

Knowledge Transfer

• Economics ↔ optics: the multiplier formula 1/(1 − k) is mathematically identical to the Fabry-Perot intensity formula at resonance, so an economist can reason about a laser cavity without the optical formalism.
• Acoustics ↔ neuroscience: the Sabine reverberation-time calculation transfers directly to neural-circuit decay under sub-unit recurrent gain.
• Non-transfer caveat: the closed form requires k constant across rounds; where retention varies, the clean sum breaks down — and knowing this is part of what transfers.

Example

A $100 fiscal injection is re-spent at a marginal propensity to consume of 0.8, adding $80, then $64, and so on — the convergent series $100(1 + 0.8 + 0.8² + …) = $500, bounded at five times the injection, with the leakage lever (raising taxes or import-share) the cleanest way to shrink the multiplier without touching the spend.

Relationships to Other Primes

Parents (1) — more general patterns this builds on

• Recursive Attenuating Amplification is a kind of, typical Amplification — The bounded contractive (k<1) regime of recirculating gain yielding the closed form input*1/(1-k). Dossier-flagged as the parent/peer question to settle at Phase C. amplification's defining external-power-source criterion is the wedge (this prime's gain comes from re-accumulation of the one-shot input, not a separate reservoir) — so the edge is typical/low, owner may keep free-standing.

Path to root: Recursive Attenuating Amplification → Amplification → Founder Effect → Path Dependence → Dependency

Not to Be Confused With

• Recursive Attenuating Amplification is not Amplification because generic amplification is any input-to-output gain with no boundedness guarantee, whereas this prime is the specific bounded gain from recirculating a one-shot input, with the exact form input·1/(1−k).
• Recursive Attenuating Amplification is not Feedback because feedback spans negative, oscillating, and runaway regimes, whereas this prime is the strictly contractive positive-feedback corner that sums to a convergent series.
• Recursive Attenuating Amplification is not Recurrence because recurrence is the bare skeleton of a state re-entering a rule, whereas this prime adds the constant sub-unit k and one-shot input that yield the 1/(1−k) law.