Mathematics
$$\int_a^b f'(x)\, dx = f(b) - f(a) \qquad\qquad \frac{d}{dx}\!\left(\int_a^x f(t)\, dt\right) = f(x)$$

The integration on forms concept is of fundamental importance in differential topology, geometry, and physics, and also yields one of the most important examples of cohomology, namely de Rham cohomology, which measures precisely the extent to which the fundamental theorem of calculus fails in higher dimensions and on general manifolds.

Terence Tao, Differential Forms and Integration
Differential Forms
$$\int_{\partial M}\omega=\int_M d\omega, \qquad d^2=0$$

Differential forms turn orientation, boundary, and change of variables into one calculus: the exterior derivative records what a form contributes on the boundary.

Sheaf Cohomology
$$0\to\mathcal F'\to\mathcal F\to\mathcal F''\to0 \quad\Longrightarrow\quad H^q(X,\mathcal F)\to H^q(X,\mathcal F'')\to H^{q+1}(X,\mathcal F')$$

Sheaf cohomology measures the precise obstruction to turning compatible local analytic data into global geometric objects.

Riemann-Roch
$$\ell(D)-\ell(K-D)=\deg(D)+1-g$$

A divisor records the requested zeros and allowed poles; Riemann-Roch turns that data, together with the genus, into an exact dimension count.

Cryptography
$$\operatorname{Adv}^{\mathrm{IND\text{-}CPA}}_{\mathcal{A}}(\Pi) \;:=\; \left|\Pr\!\left[\mathsf{Game}^{\mathrm{IND\text{-}CPA}}_{\Pi,\mathcal{A}}(1^\lambda)=1\right]-\tfrac{1}{2}\right|$$

In modern security definitions, a construction is considered secure if every efficient adversary's advantage in a well-specified experiment is negligible as a function of the security parameter. This viewpoint makes cryptographic claims precise, composable, and testable against explicit threat models.

Provable Security
$$\operatorname{Adv}^{\mathsf{scheme}}_{A}(\lambda)\le q(\lambda)\operatorname{Adv}^{\mathsf{assumption}}_{B}(\lambda)+\varepsilon(\lambda)$$

A proof in cryptography is a reduction: it states which attack game is being ruled out, which assumption is being invoked, and how much quantitative security is lost in the translation.

Coding Theory
$$C_L(D,G)=\{(f(P_1),\ldots,f(P_n)): f\in L(G)\}, \qquad C_\Omega(D,G)=C_L(D,G)^\perp$$

Error-correcting codes become geometric when codewords are evaluations of functions and parity checks are residues of differentials.

Bignum Arithmetic
$$\operatorname{val}_B(a)=\sum_{i=0}^{n-1}a_iB^i,\qquad B=2^{16}$$

A cryptographic bignum primitive is a proof-carrying C program: every word operation must preserve the integer invariant and the leakage boundary.

Elliptic Arithmetic
$$E/\mathbb F_p:\ y^2=x^3+ax+b,\qquad [k]P=P+\cdots+P$$

Elliptic-curve arithmetic is the group-law layer above bignum field arithmetic: words implement residues, residues implement points, and points implement public-key primitives.

Programming
$$\text{Program} = \text{Algorithms} + \text{Data Structures}$$

"Programs must be written for people to read, and only incidentally for machines to execute."

Harold Abelson, Structure and Interpretation of Computer Programs