math-skill 2.0.1 → 2.1.0

package/skills/transformation/original-texts.en.md

@@ -0,0 +1,204 @@
+# Mathematical Sources and Classic Texts
+
+## Fourier Transform (1822)
+
+> "Any periodic function can be expressed as an infinite series of sine and cosine functions."
+
+Fourier series: f(x) = a₀/2 + Σ[aₙcos(nx) + bₙsin(nx)]
+
+Fourier transform: F(ω) = ∫f(t)e^(-iωt)dt
+
+**Core idea**: A complex signal in the time domain may be simple in the frequency domain. The power of the transform lies in changing the representation of the problem.
+
+**The magic of the transform**:
+- Convolution in the time domain = multiplication in the frequency domain
+- Differentiation in the time domain = multiplication (by iω) in the frequency domain
+- This allows differential equations to be converted into algebraic equations
+
+**Source**: Joseph Fourier, *Théorie analytique de la chaleur* (1822) — originally developed for heat conduction problems, its influence extends far beyond thermodynamics.
+
+## Fast Fourier Transform — Cooley-Tukey Algorithm (1965)
+
+> O(n log n) vs O(n²): Fourier transform went from theoretical tool to engineering reality.
+
+**Core idea**: Exploiting a divide-and-conquer strategy, the complexity of the discrete Fourier transform (DFT) is reduced from O(n²) to O(n log n). For n = 10⁶ data points, this yields a speedup of approximately 10⁶/log(10⁶) ≈ 50,000×.
+
+**Historical background**: Cooley & Tukey (1965) popularized the FFT, although the same idea can be traced back to Gauss (1805). It is widely regarded as the most important numerical algorithm of the 20th century.
+
+**Applications**: Signal processing, image compression (JPEG), spectral analysis, large-integer multiplication, numerical solution of partial differential equations.
+
+## Laplace Transform (1780s)
+
+> L{f(t)} = ∫₀^∞ f(t)e^(-st)dt
+
+**Core idea**: Convert differential equations into algebraic equations, solve them, and then apply the inverse transform to recover the solution. Compared with the Fourier transform, the Laplace transform can handle functions that do not converge (by introducing the convergence factor e^(-st)).
+
+**Source**: Laplace developed this transform in the 1780s for probability theory; it was later systematically applied to circuit analysis by Heaviside.
+
+## Wavelet Transform — Morlet (1980s), Daubechies (1988)
+
+> Fourier tells you "what frequencies exist"; wavelets also tell you "when they exist."
+
+**Core idea**: The Fourier transform has frequency resolution but no time resolution; the wavelet transform achieves time-frequency localization through scalable and translatable basis functions.
+
+**History**: Morlet (1982) introduced the continuous wavelet transform in seismic signal analysis; Daubechies (1988) constructed compactly supported orthogonal wavelet bases, making the discrete wavelet transform a practical reality.
+
+**Mathematical significance**: Wavelet bases are not a single family of trigonometric functions but are generated from a single mother wavelet ψ through scaling and translation: ψ_{a,b}(t) = |a|^(-1/2) ψ((t-b)/a). Multiresolution analysis (MRA) provides the unifying mathematical framework.
+
+## Legendre Transform
+
+> The duality transform in convex analysis: describes a convex function by its slopes instead of its values.
+
+f*(p) = sup_x [px - f(x)]
+
+**Core idea**: For a convex function, "function values" and "derivatives (slopes)" carry the same information — they are dual descriptions. This is a central instance of **duality** in mathematics.
+
+**Dual roles in physics**:
+- **Thermodynamics**: Entropy S ↔ Free energy F (dual via temperature T); Internal energy ↔ Gibbs energy
+- **Mechanics**: Lagrangian L(v,q) ↔ Hamiltonian H(p,q) (dual via v ↔ p)
+- **Optimization**: Primal problem ↔ Dual problem (Lagrangian duality)
+
+**Source**: Legendre (1787) introduced it in the context of minimal surface problems; it has since become a cornerstone of convex analysis and the calculus of variations.
+
+## Generating Functions — Euler (1748), Laplace
+
+> Encode a sequence as coefficients of a power series; convolution becomes multiplication.
+
+G(x) = Σ aₙxⁿ
+
+**Core idea**: An infinite sequence {a₀, a₁, a₂, ...} is compressed into a single function G(x). Recurrence relations of the sequence become differential equations of the function; the convolution of two sequences becomes the product of two functions.
+
+**Classical applications**:
+- **Combinatorial counting**: Euler used generating functions to solve the integer partition problem
+- **Probability theory**: Moment generating function M(t) = E[e^(tX)], characteristic function φ(t) = E[e^(itX)]
+- **Number theory**: The Riemann ζ function is essentially the generating function of the prime distribution
+- **Solving recurrences**: Fibonacci recurrence → generating function → closed-form solution
+
+**Source**: Euler, *Introductio in analysin infinitorum* (1748); Laplace made systematic use of generating functions in probability theory.
+
+## Conformal Mapping — Riemann Mapping Theorem (1851)
+
+> Any simply connected domain can be conformally mapped onto the unit disk.
+
+**Core idea**: Conformal mappings preserve angles and local shapes but may distort sizes and global shapes. Under a complex analytic function f(z), infinitesimal circles remain circles, merely scaled and rotated.
+
+**Mathematical foundation**: The Riemann mapping theorem (1851) — one of the most profound results in complex analysis — guarantees the existence of such a mapping.
+
+**Applications**:
+- **2D boundary value problems**: Map a complex boundary region to a simple region (disk / half-plane), solve there, and map back
+- **Fluid mechanics**: Classical solution method for potential flow problems
+- **Aerodynamics**: Airfoil design (Joukowski transform z → z + 1/z)
+- **Electrostatics**: Potential computation in complex geometries
+
+## Z-Transform — Discrete Counterpart of Laplace
+
+> X(z) = Σ x[n]z^(-n) — the Laplace transform for the sampled world.
+
+**Core idea**: The Laplace transform handles continuous-time signals s = σ + iω; the Z-transform handles discrete-time signals z = re^(iω). The two are related by setting z = e^(sT).
+
+**Central role in digital signal processing**:
+- System stability analysis: the unit circle |z| = 1 corresponds to the frequency axis; poles inside the circle = stable
+- Digital filter design: transfer functions of FIR / IIR filters are expressed directly in terms of the Z-transform
+- Difference equations → algebraic equations (exactly analogous to how the Laplace transform converts differential equations → algebraic equations)
+
+**History**: Introduced in 1947 by Hurewicz et al. in the context of sampled-data control systems; the name "Z-transform" was coined by Ragazzini & Zadeh (1952).
+
+## Plancherel Theorem / Parseval's Theorem — Transforms Preserve Information
+
+> ∫|f(t)|²dt = ∫|F(ω)|²dω — energy is conserved between time domain and frequency domain.
+
+**Core idea**: A good transform does not lose information — the total energy (the square of the L² norm) is exactly the same before and after the transform. This means the transform is an **isometry**.
+
+**Parseval's theorem** (1799): Fourier series form — Σ|aₙ|² + Σ|bₙ|² = (1/π)∫|f(x)|²dx
+
+**Plancherel theorem** (1910): Fourier transform form — ∫|f|² = ∫|F|², establishing the unitarity of the transform on L² space.
+
+**Philosophical implication**: Invertible transforms guarantee conservation of information — we can freely switch perspectives without losing anything. This is the mathematical foundation of "reversibility" in the theory of transforms.
+
+## Mellin Transform — Scaling Analysis
+
+> M{f}(s) = ∫₀^∞ f(t)t^(s-1)dt — the Fourier transform under scaling changes.
+
+**Core idea**: Substituting t = e^(-x), the Mellin transform becomes a Fourier transform. It is naturally dual to the **scaling** operation — scaling f(at) merely multiplies by a^(-s) in the Mellin domain.
+
+**Key applications**:
+- **Analytic number theory**: The Mellin transform representation of the Riemann ζ function is the bridge to the prime counting function
+- **Asymptotic analysis**: Mellin transform techniques can extract asymptotic expansions of functions (leading term + correction terms)
+- **Fractals and self-similarity**: Self-similar functions have particularly simple representations in Mellin space
+
+**Source**: Hjalmar Mellin (1904) developed it systematically; earlier roots can be traced to Euler's work on the ζ function.
+
+## Radon Transform (1917) — Mathematical Basis of CT Scanning
+
+> Integrate a function along lines to get "projections"; inverse transform reconstructs the original from projections.
+
+R{f}(θ, s) = ∫ f(x·nθ + tnθ⊥)dt (line integral along direction θ)
+
+**Core idea**: Projections of an object in all directions contain sufficient information to completely reconstruct the object. This is the mathematical foundation of **tomography**.
+
+**History and applications**:
+- **Radon** (1917): A pure mathematics paper proving the existence and uniqueness of the inverse transform
+- **Cormack** (1963-64): Independently rediscovered the result and applied it to medical imaging
+- **Hounsfield** (1971): Invented the CT scanner; Cormack and Hounsfield shared the 1979 Nobel Prize in Medicine
+- **Seismology**: Velocity reconstruction from reflection seismic data
+
+## Coordinate Transformation
+
+**Polar coordinates**: (x, y) → (r, θ), suited to problems with rotational symmetry
+**Spherical coordinates**: (x, y, z) → (r, θ, φ), suited to problems with spherical symmetry
+**Fourier space**: Time signal → frequency representation
+
+**Core idea**: Choosing the right coordinate system can turn a complex problem into a simple one.
+
+## Diagonalization (Linear Algebra)
+
+> For a diagonalizable matrix A, there exists an invertible matrix P such that P⁻¹AP = D (a diagonal matrix).
+
+**Core idea**: In the eigenvector basis, a linear transformation becomes as simple as possible — each coordinate direction is scaled independently.
+
+## Jordan Normal Form — Non-Diagonalizable Matrices
+
+> What if a matrix cannot be diagonalized? Jordan form is the closest thing to diagonal.
+
+A = PJP⁻¹, J = diag(J₁, J₂, ...), Jₖ = λₖI + Nₖ (λₖ is an eigenvalue, Nₖ is a nilpotent matrix)
+
+**Core idea**: When a matrix does not have enough independent eigenvectors (geometric multiplicity < algebraic multiplicity), Jordan blocks introduce "approximate eigenvectors" — chains of generalized eigenvectors. The nilpotent part Nₖ allows the behavior of iterates Aⁿ to be computed exactly.
+
+**Source**: Camille Jordan (1870), *Traité des substitutions et des équations algébriques*.
+
+**Applications**: Solutions of linear ODE systems (especially with repeated roots), computation of the matrix exponential e^(At), explicit solutions of linear recurrences.
+
+## Eigenvalue Theory & Spectral Theory — Mathematical Heart of Transformation
+
+> Eigenvalues are the "DNA" of a transformation — they determine its essential behavior.
+
+Av = λv
+
+**Spectral theorem** (Hilbert, 1909-1912): Self-adjoint operators have real spectra and can be spectrally decomposed — "diagonalization" in continuous dimensions.
+
+**Core ideas**:
+- **Finite dimensions**: The eigenvalues of a matrix determine stability (|λ|<1 implies convergence), oscillatory behavior (imaginary part of λ), and growth rate (real part of λ)
+- **Infinite dimensions**: Spectral theory generalizes eigenvalues to self-adjoint operators on Hilbert spaces; in quantum mechanics, observables = self-adjoint operators, and their spectra = possible measurement outcomes
+- **Stability analysis**: The stability of any dynamical system reduces to the location of its spectrum
+
+**Key theorems**:
+- **Gershgorin circle theorem** (1931): Geometric localization of eigenvalues
+- **Courant-Fischer min-max theorem**: Variational characterization of eigenvalues
+- **Weyl inequalities**: Continuity of the spectrum under matrix perturbations
+
+## Philosophical Implications of Transforms
+
+> "Look at a problem from a different angle, and it may already be solved."
+
+The deeper meaning of the transform idea:
+- **Relativity of representation**: The same object has different appearances under different representations
+- **Invariance under transformation**: Some properties remain unchanged under transformation (this is symmetry)
+- **Choice of representation**: A good representation simplifies the problem; a poor one complicates it
+- **Reversibility**: Ideally, a transform loses no information — we can freely switch perspectives (the guarantee of the Plancherel theorem)
+
+## "Transforms" in Everyday Life
+
+- **Time-scale transform**: Current difficulties may be negligible when viewed on a 10-year timescale
+- **Perspective transform**: Seeing a problem from the other person's point of view (essentially a coordinate transformation)
+- **Scale transform**: Macro and micro perspectives may reveal different patterns (the intuition behind the Mellin transform)
+- **Domain transform**: A problem that is unsolvable in one domain may have a ready-made solution in another (Fourier: differential → algebraic; Legendre: mechanics → dual mechanics)