The Library .

be a probability space, and let

(\Omega, \mathcal{F}, P)

\{A_n\}_{n=1}^\infty

be a sequence of events. \\ First Borel-Cantelli Lemma: If

\sum_{n=1}^\infty P(A_n) < \infty

. \\ Second Borel-Cantelli Lemma: If the events

P(\limsup_{n\to\infty} A_n) = 0

\{A_n\}_{n=1}^\infty

are independent and

\sum_{n=1}^\infty P(A_n) = \infty

P(\limsup_{n\to\infty} A_n) = 1

Master the Borel-Cantelli Lemma 2, a cornerstone of advanced probability. Understand why independence and divergent sums lead to almost certain infinite occurrences.

Proof: Borel-Cantelli Lemma 2 (Independence, Divergent Sum)

be a probability space and let

(\Omega, \mathcal{F}, P)

\{A_n\}_{n=1}^{\infty}

be a sequence of independent events in

\mathcal{F}

. If the sum of their probabilities diverges, then the probability that infinitely many of these events occur is 1. That is, if

\sum_{n=1}^{\infty} P(A_n) = \infty

then

P\left(\limsup_{n \to \infty} A_n\right) = 1

Explore Full Advanced Probability THEORY Module →

Advanced Stochastic Processes

55 Institutional Proofs

Master solving Geometric Brownian Motion SDEs. Unveil the log-normal distribution with rigorous intuition, Ito's Lemma, and real-world implications.

Solving the SDE: Unveiling the Log-Normal Distribution for Geometric Brownian Motion

Given a stochastic process

S_t

evolving under the Geometric Brownian Motion (GBM) Stochastic Differential Equation:

dS_t = \mu S_t dt + \sigma S_t dW_t

with initial condition

S_0 > 0

, drift parameter

\mu \in \mathbb{R}

, volatility parameter

\sigma > 0

being a standard Wiener process, the unique strong solution at time

W_t

t

is:

S_t = S_0 \exp\left( \left(\mu - \frac{1}{2}\sigma^2\right)t + \sigma W_t \right)

Furthermore,

S_t

follows a Log-Normal distribution, implying that

\log(S_t)

is Normally distributed with mean

E[\log(S_t)] = \log(S_0) + \left(\mu - \frac{1}{2}\sigma^2\right)t

and variance

\text{Var}[\log(S_t)] = \sigma^2 t

. Thus,

S_t \sim \text{LogNormal}\left(\log(S_0) + \left(\mu - \frac{1}{2}\sigma^2\right)t, \sigma^2 t\right)

Unravel Ito's Lemma, the core of stochastic calculus. Explore its rigorous statement, cinematic intuition, and crucial distinctions from classical calculus for BSc students.

Ito's Lemma: The Cornerstone of Stochastic Calculus

be an It\ô process of the form

X_t

dX_t = \mu(t, X_t) dt + \sigma(t, X_t) dW_t

is a standard Brownian motion and

W_t

\mu(t, x)

are suitable functions ensuring the existence of

\sigma(t, x)

X_t

be a twice continuously differentiable function with respect to

f(t, x)

x

(i.e.,

f \in C^{2,1}(\mathbb{R}^+ \times \mathbb{R})

), and once continuously differentiable with respect to

t

. Then

Y_t = f(t, X_t)

is also an It\ô process, and its differential is given by:

\begin{aligned} df(t, X_t) = &\left( \frac{\partial f}{\partial t}(t, X_t) + \mu(t, X_t) \frac{\partial f}{\partial x}(t, X_t) + \frac{1}{2} \sigma(t, X_t)^2 \frac{\partial^2 f}{\partial x^2}(t, X_t) \right) dt \\ &+ \sigma(t, X_t) \frac{\partial f}{\partial x}(t, X_t) dW_t \end{aligned}

Explore Full Advanced Stochastic Processes Module →

Algebra

1 Institutional Proofs

Explore Galois Theory's profound connection between field extensions and group symmetries. Master the Fundamental Theorem and its applications to polynomial solvability.

Galois Theory

be a finite Galois extension. Then there is a one-to-one inclusion-reversing correspondence between the set of intermediate fields

E/F

K

(i.e.,

F \subseteq K \subseteq E

) and the set of subgroups

H

of the Galois group

\text{Gal}(E/F)

. This correspondence is given by the maps:

\left\{ \begin{aligned} \phi: \{ K \mid F \subseteq K \subseteq E \} &\to \{ H \mid H \le \text{Gal}(E/F) \} \\ K &\mapsto \text{Gal}(E/K) \end{aligned} \right.

and its inverse:

\left\{ \begin{aligned} \psi: \{ H \mid H \le \text{Gal}(E/F) \} &\to \{ K \mid F \subseteq K \subseteq E \} \\ H &\mapsto E^H = \{ \alpha \in E \mid \sigma(\alpha) = \alpha \text{ for all } \sigma \in H \} \end{aligned} \right.

Furthermore, for any intermediate field

K

and its corresponding subgroup

H = \text{Gal}(E/K)

: \begin{aligned} [K:F] &= [\text{Gal}(E/F) : H] \\ [E:K] &= |H| \end{aligned} An intermediate field

K

is a normal extension of

F

if and only if its corresponding subgroup

H = \text{Gal}(E/K)

is a normal subgroup of

\text{Gal}(E/F)

. In this case,

\text{Gal}(K/F)

is isomorphic to the quotient group

\text{Gal}(E/F) / H

Explore Full Algebra Module →

Analytical Mechanics

3 Institutional Proofs

Explore Lagrangian Mechanics: the elegant, variational approach to classical physics. Master its principles and equations for BSc Mathematics students.

Lagrangian Mechanics

The principle of least action states that the path

\gamma

taken by a physical system between two points in configuration space

q_a

is the one for which the action integral

q_b

in a given time interval

[t_a, t_b]

S

is stationary. For a system with generalized coordinates

q_i

and generalized velocities

\dot{q}_i

, with Lagrangian

L(q_i, \dot{q}_i, t) = T - V

is the kinetic energy and

T

V

is the potential energy, the Euler-Lagrange equations are given by:

\begin{aligned} \frac{\partial L}{\partial q_i} - \frac{d}{dt}\left(\frac{\partial L}{\partial \dot{q}_i}\right) &= 0 \quad \text{for } i = 1, \dots, n \end{aligned}

Hamiltonian Mechanics: Hamiltonian is the Geometry of Conservation. Advanced Analytical Mechanics visual proof at NICEFA.

Hamiltonian Mechanics

Explore Full Analytical Mechanics Module →

H = T + V

Applied Statistics

58 Institutional Proofs

Proof of Chebyshev's Inequality — Intermediate Applied Statistics proof with visual geometric intuition and formal theorem statement. Free at NICEFA.

Proof of Chebyshev's Inequality

be a random variable with finite expected value

X

\mu = E[X]

and finite non-zero variance

\sigma^2 = Var(X) = E[(X-\mu)^2]

. For any

k > 0

, Chebyshev's Inequality states that the probability that

X

deviates from its mean by more than

k

standard deviations is at most

1/k^2

:

P(|X - \mu| \ge k\sigma) \le \frac{1}{k^2}

Exploring the cinematic intuition of Derivation of the Mean and Variance of the Binomial Distribution.

Derivation of the Mean and Variance of the Binomial Distribution

be a discrete random variable following a Binomial distribution, denoted as

X

X \sim B(n, p)

n \in \mathbb{N}

. The Probability Mass Function is given by

p \in [0, 1]

P(X=k) = \binom{n}{k} p^k (1-p)^{n-k}

for

k = 0, 1, \dots, n

. The expected value and variance are:

E[X] = np, \quad \text{Var}(X) = np(1-p)

Explore Full Applied Statistics Module →

Biometry

5 Institutional Proofs

Predator-Prey: Lotka-Volterra is the Pulse of Nature. Intermediate Biometry visual proof at NICEFA.

Predator-Prey

dx/dt = ax - bxy

SIR Epidemic Model: SIR is the Geometry of Contagion. Intermediate Biometry visual proof at NICEFA.

SIR Epidemic Model

Explore Full Biometry Module →

dS/dt = -bSI

Calculus

23 Institutional Proofs

The Definition of a Limit: Imagine yourself as a master marksman, aiming for a critical target: the value

The Definition of a Limit

L

. Foundational Calculus visual proof at NICEFA.

For a function

f: A \to \mathbb{R}

, we say that the limit of

A \subseteq \mathbb{R}

, and a point

c

that is a limit point of

A

f(x)

as

x

approaches

c

is

L

, denoted by

\lim_{x \to c} f(x) = L

, if for every

\varepsilon > 0

, there exists a

\delta > 0

such that if

0 < |x - c| < \delta

|f(x) - L| < \varepsilon

Master the Power Rule, a fundamental calculus tool. Learn to calculate slopes of tangent lines and instantaneous rates of change for polynomial functions.

The Power Rule & Slope

f: D \to \mathbb{R}

be a function defined by

f(x) = x^n

for some real number

n

). Then, the derivative of

D

is the domain of

f

(e.g.,

D = \mathbb{R}

for integer

n \ge 0

;

D = \mathbb{R}\\setminus\\{0\\}

for integer

n < 0

;

D = [0, \infty)

for non-integer

n > 0

f

with respect to

x

, denoted

f'(x)

or

\frac{dy}{dx}

, is given by:

\frac{d}{dx} \left( x^n \right) = nx^{n-1}

This derivative,

f'(x)

, precisely quantifies the instantaneous rate of change of

f(x)

at any given

x

, and geometrically represents the slope of the tangent line to the graph of

y = f(x)

at the point

(x, f(x))

Explore Full Calculus Module →

Chaos Theory

2 Institutional Proofs

The Butterfly Effect: Picture a digital city, meticulously rendered, where every simulated raindrop, every gu... Advanced Chaos Theory visual proof at NICEFA.

The Butterfly Effect

be a metric space, and let

(X, d)

f: X \to X

be a continuous map representing a discrete-time dynamical system. The system exhibits Sensitive Dependence on Initial Conditions (often referred to as the Butterfly Effect) if there exists a positive Lyapunov exponent

\lambda > 0

such that for a typical initial condition

x_0 \in X

and for any infinitesimally small perturbation

\delta x_0

(where

d(x_0, x_0 + \delta x_0)

is very small), the distance between the evolved trajectories

f^n(x_0)

grows approximately exponentially with the number of iterations

f^n(x_0 + \delta x_0)

n

as:

d(f^n(x_0), f^n(x_0 + \delta x_0)) \approx d(x_0, x_0 + \delta x_0) e^{\lambda n}

This approximation holds for sufficiently small

d(x_0, x_0 + \delta x_0)

and for a range of

n

before the trajectories become decorrelated or constrained by the phase space.

Fractals & Self-Similarity: Fractals are the Geometry of Nature. Advanced Chaos Theory visual proof at NICEFA.

Fractals & Self-Similarity

Explore Full Chaos Theory Module →

D = logN/logS

Complex Variables

1 Institutional Proofs

Residue Theorem: Residue Theorem is the Ultimate Shortcut. Intermediate Complex Variables visual proof at NICEFA.

Residue Theorem

Explore Full Complex Variables Module →

\oint = 2\pi i \sum Res

Computational Fluid Dynamics

1 Institutional Proofs

Computational Fluid Dynamics: CFD is the Geometry of Turbulence. Advanced Computational Fluid Dynamics visual proof at NICEFA.

Computational Fluid Dynamics

Explore Full Computational Fluid Dynamics Module →

Navier-Stokes solvers

Control Theory

1 Institutional Proofs

PID Control: PID is the Geometry of Stability. Intermediate Control Theory visual proof at NICEFA.

PID Control

Explore Full Control Theory Module →

u = P + I + D

Differential Equations

5 Institutional Proofs

The Heat Equation: Heat Equation is Average-Seeking Flow. Advanced Differential Equations visual proof at NICEFA.

The Heat Equation

u_t = a del^2 u

The Wave Equation: Wave Equation is the Math of Vibration. Advanced Differential Equations visual proof at NICEFA.

The Wave Equation

Explore Full Differential Equations Module →

u_tt = c^2 del^2 u

Differential Geometry

2 Institutional Proofs

Gauss-Bonnet: Gauss-Bonnet is the Great Unifier. Advanced Differential Geometry visual proof at NICEFA.

Gauss-Bonnet

\iint K + \oint k = 2\pi\chi

General Relativity: General Relativity is the Geometry of Gravity. Advanced Differential Geometry visual proof at NICEFA.

General Relativity

Explore Full Differential Geometry Module →

G = 8\pi T

Discrete Mathematics

5 Institutional Proofs

Master the Pigeonhole Principle: a fundamental theorem in discrete mathematics. Explore its rigorous statement, intuitive applications, and common pitfalls for BSc Math & Stats students.

Pigeonhole Principle

containers (pigeonholes). If a function

S

be a set of

n

items (pigeons) and

T

be a set of

m

f: S \to T

maps each item to a container, then if

n > m

, there exists at least one container

t \in T

such that

|f^{-1}(t)| \ge 2

. More generally, if

n

items are distributed among

m

containers, there exists at least one container

t \in T

such that the number of items mapped to it is at least

\left\lceil \frac{n}{m} \right\rceil

\text{Number of items in at least one container} \ge \left\lceil \frac{n}{m} \right\rceil

Graph Connectivity: Graph Theory is the Mathematics of Relationships. Foundational Discrete Mathematics visual proof at NICEFA.

Graph Connectivity

Explore Full Discrete Mathematics Module →

G = (V, E)

Financial Mathematics

2 Institutional Proofs

Black-Scholes: Black-Scholes is the Geometry of Risk-Neutral Pricing. Advanced Financial Mathematics visual proof at NICEFA.

Black-Scholes

C = SN(d1) - KeN(d2)

Early Exercise & Stopping: American Options are the Geometry of Choice. Advanced Financial Mathematics visual proof at NICEFA.

Early Exercise & Stopping

Explore Full Financial Mathematics Module →

V = max(Exercise, Wait)

Fluid Mechanics

2 Institutional Proofs

Unravel Bernoulli's Law in Fluid Mechanics. Explore its rigorous derivation, cinematic intuition, and crucial applications for BSc Mathematics and Statistics students.

Bernoulli's Law

For an incompressible, inviscid fluid in steady, irrotational flow along a streamline, the sum of its static pressure, dynamic pressure, and hydrostatic pressure remains constant. This is expressed as:

P + \frac{1}{2} \rho v^2 + \rho gh = \text{constant}

is the static pressure of the fluid,

P

\rho

is the fluid density,

v

is the fluid velocity,

g

is the acceleration due to gravity, and

h

is the elevation above a reference datum.

Explore Vorticity Dynamics: the mathematical heart of fluid rotation. Understand vortex stretching, baroclinic generation, and viscous effects in fluid flows. Essential for BSc Math & Stats.

Vorticity Dynamics

be the vorticity vector for a fluid flow

\boldsymbol{\omega} = \nabla \times \mathbf{u}

\mathbf{u}(\mathbf{x}, t)

. The dynamics of

\boldsymbol{\omega}

are governed by the Vorticity Equation, which, for a general compressible, viscous fluid with density

\rho

, pressure

p

, and viscous stress tensor

\boldsymbol{\tau}

, states:

\begin{aligned} \frac{D\boldsymbol{\omega}}{Dt} &= (\boldsymbol{\omega} \cdot \nabla) \mathbf{u} && \text{(Vortex Stretching and Tilting)} \\ &+ \frac{1}{\rho^2} \nabla\rho \times \nabla p && \text{(Baroclinic Torque)} \\ &+ \nabla \times \left(\frac{1}{\rho} \nabla \cdot \boldsymbol{\tau}\right) && \text{(Viscous Diffusion and Generation)} \end{aligned}

is the material derivative. In the case of an incompressible, inviscid fluid with conservative body forces, the equation simplifies to

\frac{D}{Dt} = \frac{\partial}{\partial t} + \mathbf{u} \cdot \nabla

\frac{D\boldsymbol{\omega}}{Dt} = (\boldsymbol{\omega} \cdot \nabla) \mathbf{u}

Explore Full Fluid Mechanics Module →

Fundamentals of Optimization

27 Institutional Proofs

Exploring the cinematic intuition of Weierstrass Extreme Value Theorem: Guaranteeing Existence of Optima.

Weierstrass Extreme Value Theorem: Guaranteeing Existence of Optima

be a real-valued continuous function defined on a compact set

f

K

in

\mathbb{R}^n

. Then

f

attains both a global maximum and a global minimum on

K

. That is, there exist points

\mathbf{c}

\mathbf{d}

in

K

such that for all

\mathbf{x}

in

K

f(\mathbf{c}) \geq f(\mathbf{x}) \quad \text{and} \quad f(\mathbf{d}) \leq f(\mathbf{x})

Exploring the cinematic intuition of Local Optima are Global Optima for Convex Functions.

Local Optima are Global Optima for Convex Functions

be a convex function defined on a convex set

f: S \to \mathbb{R}

S \subseteq \mathbb{R}^n

. If

x^* \in S

is a local minimum of

f

Explore Full Fundamentals of Optimization Module →

x^*

is a global minimum of

f

. That is, for all

x \in S

:

f(x^*) \leq f(x)

Game Theory

2 Institutional Proofs

Nash Equilibrium: Nash Equilibrium is Strategic Deadlock. Intermediate Game Theory visual proof at NICEFA.

Nash Equilibrium

f(s*) \ge f(s)

Shapley Value: Shapley Value is the Math of Deserved Gain. Advanced Game Theory visual proof at NICEFA.

Shapley Value

Explore Full Game Theory Module →

\phi_i = \sum perms

General Linear Models

26 Institutional Proofs

Master the matrix formulation of the General Linear Model,

The Matrix Formulation of the General Linear Model: Y = Xβ + ϵ and its Fundamental Assumptions

Y = X\beta + \epsilon

, and its fundamental assumptions. Rigorous yet intuitive content for BSc Math/Stats students.

The General Linear Model (GLM) posits a linear relationship between a dependent variable

\mathbf{Y}

and a set of independent variables

\mathbf{X}

through a vector of unknown coefficients

\boldsymbol{\beta}

, corrupted by an additive error term

\boldsymbol{\epsilon}

. Formally, for

n

observations and

p

regressors (including an intercept):

\begin{aligned} \mathbf{Y} &= \mathbf{X}\boldsymbol{\beta} + \boldsymbol{\epsilon} \\ \text{where } \mathbf{Y} \in \mathbb{R}^{n \times 1} \text{ is the vector of responses,} \\ \mathbf{X} \in \mathbb{R}^{n \times p} \text{ is the design matrix,} \\ \boldsymbol{\beta} \in \mathbb{R}^{p \times 1} \text{ is the vector of unknown coefficients,} \\ \boldsymbol{\epsilon} \in \mathbb{R}^{n \times 1} \text{ is the vector of random errors.} \end{aligned}

The fundamental assumptions governing the GLM for valid inference are: \begin{enumerate} \item \textbf{Linearity in Parameters:} The model is linear in

\boldsymbol{\beta}

. \item \textbf{Full Rank Design Matrix:} The design matrix

E[\mathbf{Y} | \mathbf{X}] = \mathbf{X}\boldsymbol{\beta}

\mathbf{X}

has full column rank, i.e.,

\text{rank}(\mathbf{X}) = p

. This ensures that

\mathbf{X}^T\mathbf{X}

is invertible. \item \textbf{Exogeneity of Errors (Zero Conditional Mean):}

E[\boldsymbol{\epsilon} | \mathbf{X}] = \mathbf{0}_n

. This implies that errors are uncorrelated with regressors and have zero mean. \item \textbf{Homoscedasticity and No Autocorrelation (Spherical Errors):}

\text{Var}(\boldsymbol{\epsilon} | \mathbf{X}) = E[\boldsymbol{\epsilon}\boldsymbol{\epsilon}^T | \mathbf{X}] = \sigma^2 \mathbf{I}_n

is a finite positive scalar. \item \textbf{(Optional) Normality of Errors:}

\sigma^2

\boldsymbol{\epsilon} | \mathbf{X} \sim N(\mathbf{0}_n, \sigma^2 \mathbf{I}_n)

. This assumption is often added for exact finite-sample inference, particularly hypothesis testing and confidence interval construction. \end{enumerate}

Master the OLS estimator derivation:

Derivation of the Ordinary Least Squares (OLS) Estimator: β̂ = (X'X)⁻¹X'Y

\hat{\beta} = (X'X)^{-1}X'Y

. Explore the geometric orthogonality, matrix calculus, and Gauss-Markov foundations.

Consider the linear model

Y = X\beta + \epsilon

is the design matrix of full column rank, and

Y \in \mathbb{R}^{n \times 1}

is the response vector,

X \in \mathbb{R}^{n \times p}

\epsilon \sim (0, \sigma^2 I_n)

. The OLS estimator

\hat{\beta}

minimizes the residual sum of squares function

S(\beta) = (Y - X\beta)'(Y - X\beta)

. The unique solution is given by:

\begin{aligned} \hat{\beta} = (X'X)^{-1}X'Y \end{aligned}

Explore Full General Linear Models Module →

Group Theory

2 Institutional Proofs

Groups & Symmetry: Group Theory is the Language of Symmetry. Intermediate Group Theory visual proof at NICEFA.

Groups & Symmetry

G x G \to G

Lagrange's Theorem: Lagrange's is the Tiling of Groups. Intermediate Group Theory visual proof at NICEFA.

Lagrange's Theorem

Explore Full Group Theory Module →

|H| divides |G|

Information Technology

17 Institutional Proofs

Master the rigorous mathematical underpinnings and practical applications of sorting algorithms. Explore efficiency, stability, and complexity analysis for optimal data organization.

Sorting Algorithms

elements, a sorting algorithm

Given an input sequence

A = (a_1, a_2, \dots, a_n)

of

n

S

transforms

A

into an output sequence

A' = (a'_1, a'_2, \dots, a'_n)

such that two fundamental properties are satisfied:

\begin{aligned} \text{1. Order Property:}& \quad a'_i \le a'_{i+1} \quad \text{for all } 1 \le i < n, \\ \text{2. Permutation Property:}& \quad \text{The multiset } \{a'_1, a'_2, \dots, a'_n\} \text{ is identical to the multiset } \{a_1, a_2, \dots, a_n\}. \end{aligned}

Furthermore, for comparison-based sorting algorithms, the information-theoretic lower bound for the number of comparisons in the worst case is

\Omega(n \log n)

Binary Search Trees: BSTs are the Geometry of Decisions. Foundational Information Technology visual proof at NICEFA.

Binary Search Trees

Explore Full Information Technology Module →

h = log n

Linear Mathematics

8 Institutional Proofs

Rank-Nullity Theorem — Intermediate Linear Mathematics proof with visual geometric intuition and formal theorem statement. Free at NICEFA.

Rank-Nullity Theorem

V

be vector spaces, and let

W

T: V \to W

be a linear transformation. Then, the dimension of the domain

V

is equal to the sum of the dimension of the image (rank) of

T

and the dimension of the kernel (nullity) of

T

. Mathematically:

\dim(V) = \text{rank}(T) + \text{nullity}(T)

Orthogonal Projections: Orthogonal Projection is the Geometry of the Shadow. Foundational Linear Mathematics visual proof at NICEFA.

Orthogonal Projections

Explore Full Linear Mathematics Module →

proj_V(x)

Linear and Integer Programming

29 Institutional Proofs

Exploring the cinematic intuition of The Convexity of the Feasible Region of a Linear Program.

The Convexity of the Feasible Region of a Linear Program

be the feasible region of a Linear Program (LP) defined by a system of linear inequalities and equalities, specifically

S

S = \{ \mathbf{x} \in \mathbb{R}^n \mid A\mathbf{x} \le \mathbf{b}, \mathbf{x} \ge \mathbf{0} \}

A

is an

m \times n

matrix,

\mathbf{x} \in \mathbb{R}^n

is a convex set. This means that if any two points

\mathbf{b} \in \mathbb{R}^m

. The feasible region

S

\mathbf{x}_1

, then every point on the line segment connecting them also belongs to

\mathbf{x}_2

belong to

S

S

. Formally, for any

\mathbf{x}_1 \in S

\mathbf{x}_2 \in S

, and any scalar

\lambda \in [0, 1]

, the convex combination

\mathbf{x}_\lambda = \lambda \mathbf{x}_1 + (1 - \lambda) \mathbf{x}_2

must also satisfy

\mathbf{x}_\lambda \in S

Exploring the cinematic intuition of The Fundamental Theorem of Linear Programming: Existence of an Optimal Extreme Point Solution.

The Fundamental Theorem of Linear Programming: Existence of an Optimal Extreme Point Solution

Consider a linear programming problem (LP) seeking to optimize an objective function \

f(x) = c^T x \

for \

x \\in \\mathbb{R}^n \

subject to a set of linear constraints, forming a feasible region \

S \

. The set \

S \

is assumed to be a non-empty, convex polyhedron in \

\\mathbb{R}^n \

. The Fundamental Theorem of Linear Programming states: \

\begin{aligned} \\text{If an optimal solution exists for the LP over } S \\text{, then at least one optimal solution is an extreme point (vertex) of } S \\text{.} \\end{aligned}

Explore Full Linear and Integer Programming Module →

Mathematical Discourse

6 Institutional Proofs

Mathematical Induction: Induction is Proof by Dominoes. Foundational Mathematical Discourse visual proof at NICEFA.

Mathematical Induction

P(k) \implies P(k+1)

Proof by Contradiction: Contradiction is Logical Elimination. Foundational Mathematical Discourse visual proof at NICEFA.

Proof by Contradiction

\neg P \implies Absurdity

Explore Full Mathematical Discourse Module →

Number Theory

5 Institutional Proofs

Distribution of Primes: Prime Number Theorem. Intermediate Number Theory visual proof at NICEFA.

Distribution of Primes

\pi(x) \sim x/log x

Modular Arithmetic: Modular Arithmetic is Circular Logic. Foundational Number Theory visual proof at NICEFA.

Modular Arithmetic

Explore Full Number Theory Module →

a \equiv b mod n

Numerical Analysis

5 Institutional Proofs

Newton-Raphson: Newton-Raphson is the Linear Hunter. Intermediate Numerical Analysis visual proof at NICEFA.

Newton-Raphson

x - f/f'

Runge-Kutta (RK4): RK4 is the Standard Ruler for ODEs. Advanced Numerical Analysis visual proof at NICEFA.

Runge-Kutta (RK4)

Explore Full Numerical Analysis Module →

y + h/6(sum k)

Operations Research

4 Institutional Proofs

Mastering the Simplex algorithm through a geometric journey across the vertices of a high-dimensional feasible region.

The Simplex Algorithm: A Visual Intuition

max cTx

Master Dynamic Programming: A rigorous dive into Bellman's Principle, state transitions, and optimal control for BSc Mathematics and Statistics students.

Dynamic Programming

Given a system evolving through

N

stages, let

s_k

be the state at stage

k

be the decision made at stage

x_k

k

be the immediate cost incurred at stage

f_k(s_k, x_k)

k

be the state transition function such that

T_k(s_k, x_k)

s_{k+1} = T_k(s_k, x_k)

. The optimal value function

V_k(s_k)

, representing the minimum total cost from stage

k

to

N

starting from state

s_k

, is governed by **Bellman's Principle of Optimality** and is given by the recursive relation:

\begin{aligned} V_k(s_k) &= \min_{x_k \in X_k(s_k)} \{ f_k(s_k, x_k) + V_{k+1}(T_k(s_k, x_k)) \} \\ \text{for } k &= N, N-1, \dots, 1 \end{aligned}

with the terminal condition

V_{N+1}(s_{N+1}) = 0

(or some other specified cost for the final state).

Explore Full Operations Research Module →

Probability Theory

11 Institutional Proofs

Master the Kolmogorov Axioms: the rigorous foundation of probability theory. Explore non-negativity, unit measure, and countable additivity with cinematic insight.

Kolmogorov Axioms

The Kolmogorov Axioms define a probability measure

P

on a probability space

(\Omega, \mathcal{F}, P)

is the probability measure itself.

\Omega

is the sample space,

\mathcal{F}

is a

\sigma

-algebra of events, and

P

:

\mathcal{F}

\to

[0, 1]

\begin{aligned} &\text{Axiom 1 (Non-negativity): } && P(A) \ge 0 \quad \text{for all } A \in \mathcal{F} \\ &\text{Axiom 2 (Unit Measure): } && P(\Omega) = 1 \\ &\text{Axiom 3 (Countable Additivity): } && \text{If } \{A_i\}_{i=1}^\infty \text{ is a sequence of disjoint events in } \mathcal{F}, \text{ then} \\ & && P\left(\bigcup_{i=1}^\infty A_i\right) = \sum_{i=1}^\infty P(A_i) \end{aligned}

Random Variables & PDF: A Random Variable is a Translator. Foundational Probability Theory visual proof at NICEFA.

Random Variables & PDF

Explore Full Probability Theory Module →

X: S \to R

Quantum Information

1 Institutional Proofs

Qubits & Superposition: A Qubit is a Vector in Complex Space. Advanced Quantum Information visual proof at NICEFA.

Qubits & Superposition

|\psi\rangle = a|0\rangle + b|1\rangle

Explore Full Quantum Information Module →

Real Analysis

7 Institutional Proofs

Completeness Axiom: Completeness is the Soul of reals. Intermediate Real Analysis visual proof at NICEFA.

Completeness Axiom

\sup(S) \in R

Cauchy Sequences: Cauchy is clustering convergence. Intermediate Real Analysis visual proof at NICEFA.

Cauchy Sequences

Explore Full Real Analysis Module →

|a_n - a_m| < \epsilon

Risk Theory

25 Institutional Proofs

Uncover the Elementary Renewal Theorem's proof and its profound implications for long-term event frequencies in stochastic processes. Essential for risk theory.

The Renewal's Immutable Law: Proof of the Elementary Renewal Theorem

be a renewal process where the inter-arrival times

\{N(t) : t \ge 0\}

X_1, X_2, \dots

are independent and identically distributed (i.i.d.) positive random variables with a finite mean

E[X_1] = \mu < \infty

. Then, the expected number of renewals per unit time converges to the inverse of the mean inter-arrival time as

t

approaches infinity:

\lim_{t \to \infty} \frac{E[N(t)]}{t} = \frac{1}{\mu}

Derive the Poisson Process from Renewal Theory. Explore how exponential inter-arrival times lead to this fundamental random process. Master cinematic intuition, core logic, and common pitfalls for BSc Math students.

The Genesis of Randomness: Deriving the Poisson Process from Renewal Theory

be a sequence of independent and identically distributed (i.i.d.) positive random variables representing the inter-arrival times between successive events. Let

\{X_i\}_{i=1}^\infty

S_0 = 0

-th event. A renewal process

S_n = \sum_{i=1}^n X_i

for

n \ge 1

denote the time of the

n

\{N(t) : t \ge 0\}

is defined as the counting process for these events, specifically,

N(t) = \sup\{ n \ge 0 : S_n \le t \}

, which counts the number of events that have occurred up to time

t

. If the inter-arrival times

X_i

are exponentially distributed with rate parameter

\lambda > 0

, i.e., their probability density function is

f(x) = \lambda e^{-\lambda x}

for

x \ge 0

, then the renewal process

\{N(t) : t \ge 0\}

is a Poisson process with rate

\lambda

. Specifically, for any

t > 0

and any non-negative integer

k

, the probability of observing exactly

k

events in the interval

(0, t]

is given by the Poisson probability mass function:

P(N(t) = k) = \frac{e^{-\lambda t} (\lambda t)^k}{k!}

Furthermore, the process exhibits independent and stationary increments, where for any

0 \le t_1 < t_2 < \dots < t_m

, the random variables

N(t_1), N(t_2) - N(t_1), \dots, N(t_m) - N(t_{m-1})

are independent Poisson random variables with respective means

\lambda t_1, \lambda (t_2 - t_1), \dots, \lambda (t_m - t_{m-1})

Explore Full Risk Theory Module →

Statistical Inference I

36 Institutional Proofs

Exploring the cinematic intuition of Classifying Statistics: Descriptive vs. Inferential.

Classifying Statistics: Descriptive vs. Inferential

\mathcal{D}

be a finite dataset of

n

observations,

\mathcal{D} = \{x_1, \ldots, x_n\}

denote the underlying population from which

\mathcal{P}

\mathcal{D}

is either a complete census or a sample. The classification of statistical methods hinges on their primary objective concerning

\mathcal{D}

:\n\n1. **Descriptive Statistics**: Involves methods that organize, summarize, and present the features of

\mathcal{P}

\mathcal{D}

itself. The objective is to characterize the observed data without making generalizations beyond it. For example, the sample mean

\bar{x}

for dataset

\mathcal{D}

is given by:\n

\bar{x} = \frac{1}{n} \sum_{i=1}^{n} x_i

\n\n2. **Inferential Statistics**: Involves methods that use data from a sample

\mathcal{D}_{\text{sample}} \subseteq \mathcal{P}

to draw conclusions or make predictions about the characteristics of the larger population

\mathcal{P}

from which the sample was drawn. The objective is to generalize from the sample to the population, often quantifying uncertainty. For example, using

\bar{x}

as an estimator for the population mean

\mu

involves an inferential step:\n

\hat{\mu} = \bar{x}

Exploring the cinematic intuition of Scales of Measurement: From Nominal to Ratio.

Scales of Measurement: From Nominal to Ratio

be a set of observations. A scale of measurement defines an operation

X

\oplus

and a set of functions

\mathcal{F}

that map

X

to a numerical set

\mathbb{N}

, such that the properties of

\oplus

satisfy specific invariance criteria. The four primary scales (Nominal, Ordinal, Interval, Ratio) are characterized by the set of permissible transformations

\mathcal{F}

\mathcal{T}

that preserve the structure of the data. Specifically, for a transformation

f: \mathbb{N} \to \mathbb{N}

, we have: - **Nominal:**

f

is any permutation of the numbers.

\mathcal{T} = \{ \text{permutations} \}

. - **Ordinal:**

f

is strictly increasing.

\mathcal{T} = \{ \text{strictly increasing functions} \}

. - **Interval:**

f

is strictly increasing and linear (i.e., of the form

f(x) = ax + b

with

a > 0

).

\mathcal{T} = \{ \text{affine transformations with } a>0 \}

. - **Ratio:**

f

is strictly increasing and multiplicative (i.e., of the form

f(x) = ax

with

a > 0

).

\mathcal{T} = \{ \text{scaling transformations with } a>0 \}

Explore Full Statistical Inference I Module →

Stochastic Calculus

3 Institutional Proofs

Explore Ito's Lemma in stochastic calculus with rigorous proofs and cinematic intuition for BSc Math/Stats students.

Ito's Lemma

be a stochastic process adapted to a filtration

X_t

\mathcal{F}_t

such that

dX_t = \mu(t, X_t) dt + \sigma(t, X_t) dW_t

is a standard Brownian motion and

W_t

\mu, \sigma

are suitable functions. If

Y_t = f(t, X_t)

is a twice continuously differentiable function with respect to

f(t, x)

x

and once continuously differentiable with respect to

t

satisfies the stochastic differential equation:

Y_t

\begin{aligned} dY_t &= \frac{\partial f}{\partial t}(t, X_t) dt + \frac{\partial f}{\partial x}(t, X_t) dX_t + \frac{1}{2} \frac{\partial^2 f}{\partial x^2}(t, X_t) (dX_t)^2 \\ &= \left( \frac{\partial f}{\partial t} + \mu \frac{\partial f}{\partial x} + \frac{1}{2} \sigma^2 \frac{\partial^2 f}{\partial x^2} \right) dt + \sigma \frac{\partial f}{\partial x} dW_t \end{aligned}

Martingales: Martingale is the definition of a Fair Game. Intermediate Stochastic Calculus visual proof at NICEFA.

Martingales

Explore Full Stochastic Calculus Module →

E[X|F] = X

Stochastic Differential equations

2 Institutional Proofs

Explore optimal forest harvesting using Stochastic Differential Equations. Master the HJB equation for maximizing expected discounted timber profits under uncertainty.

Forest Harvesting

be the volume of forest biomass at time

X_t

t

, evolving according to the Stochastic Differential Equation (SDE):\n

dX_t = (g(X_t) - h_t)dt + \sigma(X_t)dW_t

\nwhere

g(X_t)

is the natural forest growth function,

h_t \ge 0

is the instantaneous harvesting rate (control variable),

\sigma(X_t)

is the diffusion coefficient (representing environmental stochasticity), and

dW_t

is a standard Wiener process. Let

r > 0

be the discount rate and

R(h_t)

be the instantaneous profit function from harvesting. The objective is to find an optimal harvesting policy

h_t^*

that maximizes the expected discounted total profit:\n

J(x) = \sup_{h} E\left[ \int_0^{\infty} e^{-rt} R(h_t) dt \mid X_0 = x \right]

\nIf

V(x)

is a twice continuously differentiable value function representing the maximum expected present value of future profits given current forest stock

x

, satisfying appropriate boundary conditions, then

V(x)

must satisfy the Hamilton-Jacobi-Bellman (HJB) equation:\n

\begin{aligned} rV(x) &= \max_{h \ge 0} \left\{ R(h) + (g(x) - h)V'(x) + \frac{1}{2}\sigma^2(x)V''(x) \right\} \end{aligned}

\nThe optimal harvesting rate

h^*(x)

is determined by the argument maximizing the right-hand side of the HJB equation for each state

x

Master the Max Profit Stop theorem in Stochastic DE. Rigorously derive optimal stopping boundaries using value-matching and smooth-pasting conditions.

Max Profit Stop

be a time-homogeneous It\^o diffusion process on

\{X_t\}_{t \ge 0}

\mathbb{R}

with infinitesimal generator

\mathcal{L}

defined as

\mathcal{L}f(x) = \mu(x)f'(x) + \frac{1}{2}\sigma^2(x)f''(x)

be a continuous, differentiable payoff function representing the profit realized upon stopping. We seek to find an

G(x)

\mathcal{F}_t

-adapted stopping time

\tau^*

that maximizes the expected discounted payoff

E[e^{-r\tau}G(X_{\tau})]

is a constant discount rate. The optimal stopping time

r > 0

\tau^*

is characterized by an optimal stopping boundary

b^*

such that:

\tau^* = \inf \{ t \ge 0 : X_t \ge b^* \}

The value function

V(x) = \sup_{\tau \ge 0} E[e^{-r\tau}G(X_{\tau}) | X_0=x]

is the smallest

C^1

superharmonic function that majorizes

G(x)

. It satisfies the following conditions: 1.

V(x)

is

C^2

in the continuation region

\mathcal{C} = (-\infty, b^*)

. 2. In the continuation region

C^1

across the boundary

b^*

\mathcal{C}

solves the Hamilton-Jacobi-Bellman (HJB) equation:

V(x)

\mathcal{L}V(x) - rV(x) = 0

3. At the optimal stopping boundary

b^*

satisfies the **Value-Matching** and **Smooth-Pasting** conditions:

V(x)

\begin{aligned} V(b^*) &= G(b^*) \quad &\text{(Value-Matching)} \\ V'(b^*) &= G'(b^*) \quad &\text{(Smooth-Pasting)} \end{aligned}

4. For

x \in [b^*, \infty)

, which is the stopping region

\mathcal{S}

V(x) = G(x)

Explore Full Stochastic Differential equations Module →

Time Series Analysis

26 Institutional Proofs

Explore the rigorous proof that autocovariance for weakly stationary processes depends only on lag, understanding its deep implications for time series analysis.

Proof that Autocovariance Depends Only on Lag for Weakly Stationary Processes

is defined as weakly stationary (or covariance stationary) if it satisfies the following three conditions for all

A stochastic process

\{X_t\}_{t \in \mathbb{Z}}

t, s \in \mathbb{Z}

: 1. The mean function is constant:

E[X_t] = \mu

for some finite constant

\mu

. 2. The variance function is constant and finite:

Var[X_t] = E[(X_t - \mu)^2] = \sigma^2

for some finite constant

\sigma^2 > 0

. 3. The autocovariance function

\gamma_X(t, s) = Cov[X_t, X_s]

depends only on the time difference (lag)

h = t-s

, and not on

t

individually. Thus, for a weakly stationary process, the autocovariance function can be written as:

s

\begin{aligned} \gamma_X(t, s) &= E[ (X_t - E[X_t])(X_s - E[X_s]) ] \\ &= E[ (X_t - \mu)(X_s - \mu) ] \\ &= \gamma_X(t-s) \end{aligned}

This shows that the autocovariance of a weakly stationary process is a function solely of the lag

h = t-s

Derive the Autocorrelation Function (ACF) for white noise. Understand its theoretical properties and intuitive meaning in Time Series Analysis.

Derivation of the Autocorrelation Function (ACF) for a White Noise Process

be a discrete-time white noise process, defined by

\{X_t\}_{t \in \mathbb{Z}}

E[X_t] = \mu

for all

t \in \mathbb{Z}

\text{Var}(X_t) = \sigma^2 > 0

for all

t \in \mathbb{Z}

. The autocorrelation function (ACF) of

\text{Cov}(X_t, X_s) = 0

for all

t \neq s

X_t

, denoted by

\rho_X(k)

, is formally defined as:

\rho_X(k) = \frac{\text{Cov}(X_t, X_{t-k})}{\sqrt{\text{Var}(X_t)\text{Var}(X_{t-k})}}

for any integer lag

k

. For a white noise process, this simplifies to:

\rho_X(k) = \begin{cases} 1 & \text{if } k=0 \\ 0 & \text{if } k \neq 0 \end{cases}

Explore Full Time Series Analysis Module →

Topology

4 Institutional Proofs

Compactness: Compactness is Finite Logic for Infinite Sets. Advanced Topology visual proof at NICEFA.

Compactness

C \subset X \text{ is compact } \iff \forall \mathcal{U}, \exists \mathcal{V} \subset \mathcal{U}, |\mathcal{V}| < \infty

Homeomorphisms: Topology is Rubber-Sheet Geometry. Advanced Topology visual proof at NICEFA.

Homeomorphisms

Explore Full Topology Module →

f: X \to Y

Vector Calculus

4 Institutional Proofs

Stokes' Theorem: Stokes' is the Boundary-Interior bridge for rotation. Intermediate Vector Calculus visual proof at NICEFA.

Stokes' Theorem

\oint = \iint curl

Divergence Theorem: Divergence Theorem is the Conservation of Source. Intermediate Vector Calculus visual proof at NICEFA.

Divergence Theorem