Skip to main content

Local and Global in Math

· 9 min read

Local vs Global seems to be one of the most important philosophies behind math. People in some fields call it "compactness", others don't. In short, it says that the property of an object is related to the property of every smaller subobject.

In this post, I list some results I know, basically for personal notes. But there are way more theories related or inspired by this idea.

Logic

Compactness

Topological compactness is probably the first local-global relation that one learns at university. It is a generalization of a closed interval of R\mathbb{R}. A space is called compact if every open cover has a finite subcover. Beside this, there is a concept called sequential compactness, stating that every sequence has a convergent subsequence. For a metric space, these two conditions are the same. A subset of Euclidean space is compact if and only if it is closed and bounded (Heine-Borel Theorem). The product space of compact spaces is compact (Tychonoff's theorem).

To some degree, first-order logic (FOL) gives a compact space. Hence comes the compactness theorem: a theory has a model iff every finite subset of it has a model. Intuitively, every proof is of finite length, so an inconsistent result (evidence) must be proved using finitely many axioms in the theory. And the completeness theorem shows that every consistent theory has a model. Compactness and downward Löwenheim-Skolem theorem are used to characterize FOL.

Limit ordinals are the union of all ordinals below it, so some properties automatically hold at λ\lambda if it holds for all ordinals below λ\lambda. This helps the transfinite induction.

König's lemma states that every infinite tree of finite width has an infinite branch. Unfortunately this fails at ω1\omega_1 (Aronszajn tree).

Reflection Theorem

The reflection theorem shows that for any cumulative hierarchy VαV_{\alpha}, a formula is true in VV iff it is true in a club of VαV_{\alpha}.

Forcing

It is possible for a (inner) model of set theory to recognize every finite piece of an object, but not understand this object itself.

Forcing injects this not existing object to make desired proposition true.

Geometry

Without surprise, most of the local-global property usually comes from smoothness. A manifold MM is defined to be a locally Rn\mathbb{R}^n topologic space, so a smooth function on MM can be taken as a sum of smooth functions in Rn\mathbb{R}^n.

Residue Theorem

Let CC be a simple closed, positively oriented contour in the complex plane, and ff a function analytic (differentiable) in CC except for some points. Then, the contour integration of ff around CC is 2πi2\pi i times the sum of residues on those points. We can take this as that being analytic is so strong a condition that most information about the function is stored in exceptional points.

Stokes Theorem

The Stokes theorem roughly says "boundary is the inverse operation of differential". For an oriented nn-dimensional manifold MM with boundary M\partial M, and a ωΩn1(M)\omega\in\Omega^{n-1}(M) a n1n-1-form (with compact support), we have

Mω=Mdω\int_{\partial M} \omega = \int_{M} d\omega

Proof

We use the following convention: suppose in the local coordinate x1,,xnx_1, \ldots, x_n, the boundary is given by xn0x_n \geq 0. For the orientation x1xnx_1\wedge \cdots \wedge x_n, we set the induced orientation to be x1xn1- x_1\wedge \cdots \wedge x_{n-1}. Using a partition of unity, express ω=αωα\omega = \sum_{\alpha}\omega_{\alpha}, where each ωα\omega_{\alpha} is within a local coordinate UαU_{\alpha}. It suffices to prove the theorem for ωα\omega_{\alpha}. Suppose

ωα=a1dx2dxna2dx1dxn++(1)n1andx1dxn1\omega_{\alpha} = a_1dx_2\wedge\cdots\wedge dx_n - a_2dx_1\wedge\cdots\wedge dx_n + \cdots + (-1)^{n-1} a_ndx_1\wedge\cdots\wedge dx_{n-1}

Then, we have

dωα=(a1x1++a1x1)dx1dxnd\omega_{\alpha} = \left( \frac{\partial a_1}{\partial x_1} + \cdots + \frac{\partial a_1}{\partial x_1} \right) dx_1\wedge\cdots\wedge dx_{n}

And thus

Mdω=xn0(a1x1++a1x1)dx1dxn=xn0an0dx1dxn1=xn0an(x1,,xn1,0)dx1dxn1=Mω\begin{darray}{rcl} \int_{M} d\omega &=& \int_{x_n\geq 0} \left( \frac{\partial a_1}{\partial x_1} + \cdots + \frac{\partial a_1}{\partial x_1} \right) dx_1\cdots dx_{n} \\ &=& \int_{x_n\geq 0} a_n\mid^{\infty}_{0} dx_1\cdots dx_{n-1} \\ &=& - \int_{x_n\geq 0} a_n(x_1,\ldots, x_{n-1},0) dx_1\cdots dx_{n-1} \\ &=& \int_{\partial M} \omega \end{darray}

Application

The theorem is a generalization of the foundamental theorems of calculus as well as a set of similar formulas in R2\mathbb{R}^2 and R3\mathbb{R}^3.

It can also be used to prove one version of the Brouwer fixed-point theorem: on a closed ball B={xRn:x1}B=\{ x\in\mathbb{R}^n : |x|\leq 1 \}, every smooth endomorphism F:BBF:B\to B has a fixed point.

Proof: suppose ab absurdo FF has no fixed point. Then we can define a smooth map f:BBf:B\mapsto \partial B by letting f(x)f(x) be the point lying on the ray from xx to F(x)F(x). ff is identity on the boundary B=Sn1\partial B = S^{n-1}. Take the standard volume form ω\omega on B\partial B, so Bω=1\int_{\partial B}\omega = 1. Now pullback ω\omega and apply the Stokes theorem

1=Bω=Bfω=Bd(fω)=Bf(dω)=01 = \int_{\partial B}\omega = \int_{\partial B}f^*\omega = \int_{B}d(f^*\omega) = \int_{B}f^*(d\omega) = 0

Contradiction.

Algebra

In algebra, primes are analogue to points, so "local" means to focus on one prime.

Localization

Localization focuses on a selected set of primes of a ring by injecting inverse elements to kill other primes. Specifically, given a multiplicative set SS, S1RS^{-1}R injects s1s^{-1} for all sSs\in S. Usually, SS can be the complement of a prime ideal Rp=(Rp)1RR_{p} = (R-p)^{-1}R. Then, it does something similar to quotient but in a reverse direction: R/pR/p kills all primes below pp and makes pp the minimal prime (00); RpR_{p} kills all primes above pp and makes pp the maximal prime (pp=pRpp_p = pR_p). Both operations can be applied to modules via extension of scalars: M/p=R/pRMM/p = R/p\otimes_R M, Mp=RpRMM_p = R_p\otimes_R M, and both of them are exact functors. But the amazing point is a lot of properties can be recovered from all localizations (called local properties):

  • M=0M=0 if and only if Mp=0M_p = 0 for all (maximal) primes pp.
  • MNM\to N is injective/surjective/bijective if and only if the induced map MpNpM_p\to N_p is injective/surjective/bijective for all (maximal) primes pp.
  • MM is a torsion-free/flat module if and only if all MpM_p are so for (maximal) primes pp.
  • Injectivity and projectivity are not local properties, but preserved after localization.
  • S1(MRN)S^{-1}(M\otimes_R N) is isomorphic to S1MS1RS1NS^{-1}M \otimes_{S^{-1}R} S^{-1}N.
  • If MM is finitely presented, then S1HomR(M,N)S^{-1}\operatorname{Hom}_{R}(M,N) is isomorphic to HomS1R(S1M,S1N)\operatorname{Hom}_{S^{-1}R}(S^{-1}M,S^{-1}N).
    • When RR is noetherian, finitely presented can be replaced by finitely generated.
    • The proof sketch: if MM is free, take a base {m1,,mn}\{m_1,\ldots, m_n \} of MM. For any homomorphism g:S1MS1Ng: S^{-1}M\to S^{-1}N, find the gcd ss of denominators of the images of the base elements, and gg is of form f/sf/s for some f:MNf:M\to N. If MM is not free, take its finite presentation and apply the five lemma.

Ingetral extension

An integral extension of ring is an analogue of algebraic extensions but between rings. In an AA-algebra BB, an element xBx\in B is integral over AA if it is a root of a monic polynomial with coefficients in AA. The ring BB is integral over AA if every element in BB is integral over AA. xx is integral over AA if and only if A[x]A[x] is finite over AA (i.e. finite generated as an AA-module). Thus, an integral extension BB can be considered as a union of finite extensions. If BB is both integral and of finite type over AA (i.e. finite generated as an AA-algebra), then it is finite pver AA.

Like every field extension can be separated into an algebraic part and a transcedental part, an algebra over a field can also be separated into an integral part and an algebraically-indepenedent part. Namely, the Noether's normalization lemma states that for every finitely generated kk-algebra AA, we can find algebraically indepenedent elements y1,,ydy_1,\ldots,y_d s.t. A/k[y1,,yd]A/k[y_1,\ldots,y_d] is integral, where dd is exactly the dimension of AA. This leads to Hilbert's Nullstellensatz: for any ACF kk, the algebraic sets of the affine space Akn\mathbb{A}^n_k are one-one corresponding to radical ideals of ring k[X1,,Xn]k[X_1, \ldots, X_n], and the algebraic varieties are one-one corresponding to prime ideals. That is to say, the affine space is roughly the same thing as the spectrum of polynomial ring, with points being maximal ideals and varieties being prime ideals.

Dedekind domain

The concept of Dedekind domain arose from the research of algebraic integers in number theory. A Dedekind domain is defined to be a noetherian, integrally closed domain of dimension one. A local Dedekind domain is called a DVR, where exactly one prime number pp exists, and every number can be valued by the power of pp in it. Dedekind domain is a global version of DVR with multiple prime numbers.

Hasse-Minkovski Theorem

If a quadratic form is solvable locally at every place (i.e. valuation), then it is solvable in rationals (integers). More specifically, a quadratic form has an integer solution if and only if it has a real solution and a pp-adic solution for every prime pp. Since the integer ring of the pp-adic field is corresponding to the localization of Z\mathbb{Z} at prime pp, pp-adic fields and the real numbers are considered as "local results". The proof follows analyzing the equivalent classes of quadratic forms.

This does not work for cubic forms, such as 3x3+4y3+5z3=03x^3+4y^3+5z^3=0 has no rational solution, but it is solvable in all localizations.

Combinatorics

Euler's Circuit

A graph has an Euler circuit if and only if every node has an even degree. To obtain an Euler circuit, one can simply start DFS from an arbitrary node and backtrack when it fails.

Ulam's Reconstruction Conjecture

This conjecture says an graph can be reconstructed by all vertex-deleting subgraphs, which are obtained by deleting one vertex of the original graph. More specifically, if two graphs with >2>2 vertices have pair-wisely isomorphic vertex-deleting subgraphs, then the two graphs are isomorphic.

References