📐 Reynolds Transport Theorem
Continuous Formulation for Moving Consolidation Boundaries
RESEARCH - Advanced Mathematics⚠️ Advanced Mathematical Content
This document presents the continuous Reynolds Transport Theorem using fluid mechanics notation (\(\int_{\Omega(t)} \rho \, dV\), \(\partial \Omega(t)\), \(\mathbf{v} \cdot \mathbf{n}\)). This is intended for mathematicians and physicists, not accounting practitioners.
If you're an accountant: Skip this page and go directly to Multi-Entity Continuity, which presents the discrete accounting version without PDE notation.
📚 What This Document Provides
The continuous Reynolds Transport Theorem (Reynolds, 1903; Truesdell & Toupin, 1960) describes how quantities change in a control volume whose boundary moves over time. The classical formulation is:
In accounting terms:
- \(\Omega(t)\): Consolidation perimeter (set of entities at time \(t\))
- \(\rho\): Equity "density" per entity
- \(\mathbf{v} \cdot \mathbf{n}\): Entities crossing boundary (M&A events)
- First integral: Internal equity generation (comprehensive income)
- Second integral: Boundary flux (acquisitions add, disposals remove)
🔗 How This Relates to the Discrete Framework
The accounting framework uses a discrete analog of Reynolds Transport:
Where:
- \(S_t\): Sources (analogous to \(\int \frac{\partial \rho}{\partial t} dV\))
- \(R_t\): Boundary flux (analogous to \(\int \rho \mathbf{v} \cdot \mathbf{n} dA\))
The connection is a discrete-continuous analogy (graph theory ↔ differential geometry), not a literal coordinate transformation or rigorous limit theorem. The discrete accounting formulation is inspired by RTT structure but is not derived from continuum mechanics via graph limits.
Mathematical Rigor Note: A formal discrete→continuous correspondence would require establishing graph limit theory (Lovász & Szegedy 2006, Borgs et al. 2008) or discrete exterior calculus (Desbrun et al. 2005). This is pedagogical analogy, not proven reduction. See DISCRETE_RTT_THEOREM.md for the standalone discrete formulation.
📚 Graph Limit Theory - Required for Rigorous Derivation
To rigorously derive the discrete accounting equation from the continuous RTT would require proving that accounting graphs converge to a smooth manifold Ω(t) in an appropriate topology. Relevant frameworks include:
- Lovász, L., & Szegedy, B. (2006). "Limits of Dense Graph Sequences." Journal of Combinatorial Theory B, 96(6), 933-957. doi:10.1016/j.jctb.2006.05.002
- Borgs, C., Chayes, J., Lovász, L., Sós, V. T., & Vesztergombi, K. (2008). "Convergent Sequences of Dense Graphs I: Subgraph Frequencies, Metric Properties and Testing." Advances in Mathematics, 219(6), 1801-1851.
- Desbrun, M., Hirani, A. N., Leok, M., & Marsden, J. E. (2005). "Discrete Exterior Calculus." arXiv:math/0508341. (Differential forms on discrete structures)
- Friedli, S., & Velenik, Y. (2017). Statistical Mechanics of Lattice Systems: A Concrete Mathematical Introduction. Cambridge University Press. (Measure theory on discrete spaces)
Current status: The discrete accounting formulation stands on its own merits (proven correct via Kirchhoff's Law and incidence matrix algebra). The continuous RTT provides intuition and pedagogical value for readers with physics/engineering backgrounds but is not mathematically necessary for the discrete results.
📄 Full Technical Proof
The complete continuous formulation with classical derivation, healthcare application, and discrete mapping is available in the markdown version:
Contents: Classical RTT derivation, Leibniz rule, material derivative, boundary velocity, healthcare episode example, references to Reynolds (1903) and Truesdell & Toupin (1960).