An inverse system of topological spaces over a directed set $I$ consists of spaces $X_i$ and continuous maps $f_{ij}:X_j\to X_i$ for $i\le j$, with $f_{ii}=1$ and $f_{ik}=f_{ij}{f}_{jk}$. Its inverse limit is a space $X$ with compatible continuous projections ${\pi }_i$ such that every compatible family of continuous maps $u_i:Y\to X_i$ factors uniquely through a continuous map $u:Y\to X$. To construct it, takewith the subspace topology inherited from the product topology. The map $u(y)=(u_i(y))$ has values in $X$ and is continuous by the definition of the product topology; its coordinates force uniqueness. If $X^{\prime }$ is another inverse limit, the two universal properties give continuous maps $X\to X^{\prime }$ and $X^{\prime }\to X$ whose composites have all the same projections as the identity. Uniqueness makes these composites the identity. The inverse limit exists and is unique up to a unique projection-preserving homeomorphism. An arbitrary inverse limit may be empty; nonemptiness requires additional hypotheses.

Use the usual Hausdorff convention for a topological group. An inverse limit of finite discrete groups is a closed subgroup of their product: each compatibility condition is closed because the finite factors are Hausdorff spaces. The Tychonoff theorem gives compactness, and distinct tuples are separated by a clopen coordinate cylinder, so the limit is totally disconnected. Coordinatewise multiplication and inversion are continuous, giving a profinite group.

Conversely, let $G$ be a compact Hausdorff space and a totally disconnected topological group. We use the standard topological fact that a compact Hausdorff space that is totally disconnected has a basis of clopen sets. Given an identity neighbourhood, choose a clopen identity neighbourhood $U$ inside it. Compactness of $U$ and continuity of multiplication give a symmetric identity neighbourhood $V$ with $VU\subseteq U$: cover $U$ by finitely many neighbourhoods on which multiplication by a sufficiently small identity neighbourhood stays inside $U$, then intersect those identity neighbourhoods. Symmetry gives $vU=U$ for $v\in V$. Consequently $H=\{g:gU=U\}$ is a subgroup containing $V$, hence an open subgroup, and $H\subseteq U$ since $1\in U$. Its open cosets cover the compact group, so there are finitely many. The normal core $N={\bigcap }_{g\in G}gH{g}^{-1}$ is a finite intersection of open subgroups, hence an open normal subgroup contained in $U$. Thus the open normal subgroups form an identity-neighbourhood basis and have trivial intersection.

The canonical group homomorphism $G\to {\underleftarrow{\lim }}_{N}G/N$ is continuous and injective. For a compatible tuple of quotient elements, its inverse-image cosets in $G$ are closed and have the finite intersection property: a finite family is refined by the quotient for the intersection of its normal subgroups. Compactness gives an element in all those cosets, proving surjectivity. A continuous bijection from a compact space to a Hausdorff space is a homeomorphism. The compact totally disconnected and inverse-limit definitions of a profinite group agree.

Index the finite nonempty sets $\mathcal{P}(N)$ by open normal subgroups, with the transition from $M$ to $N$ when $M\subseteq N$ given by image under $G/M\to G/N$. Images of Sylow subgroups under surjections of finite groups are Sylow subgroups. These transitions are surjective: if $S\le G/N$ is a Sylow subgroup, choose a Sylow subgroup in its full inverse image in $G/M$. It maps onto $S$, and its order has the full $p$-part of $|G/M|$, so it is a Sylow subgroup of $G/M$ too. The transitions respect composition, giving an inverse system of finite sets.

Its inverse limit is nonempty. Indeed, finitely many compatibility conditions can be satisfied by choosing one Sylow subgroup in a quotient refining all the involved quotients and taking its images; compactness of the product of the finite sets then gives a compatible family $(P_N{)}_N$. DefineThis is a closed subgroup of $G$. Its image in $G/N$ is exactly $P_N$: for a prescribed $s\in P_N$, each finite collection of conditions defining $P$ together with ${\pi }_N(g)=s$ is satisfiable in a common refining quotient, because the transitions on the chosen Sylow subgroups are surjective. The finite intersection property again supplies $g\in P$. Hence $P\cong {\underleftarrow{\lim }}_N{P}_N$ is a pro-p group and $PN/N=P_N$ for every $N$.

Finally, if a pro-p subgroup $Q$ contains $P$, its image in every finite quotient is a p-group containing the Sylow subgroup $P_N$, so that image equals $P_N$. Thus every $q\in Q$ belongs to every ${\pi }_N^{-1}(P_N)$, whence $Q\subseteq P$. The constructed $P$ is a maximal pro-p subgroup.

Linkage disequilibrium means that alleles at different genetic loci are associated in population haplotypes. For two biallelic loci,The first quantity measures departure from independent allele frequencies; the second is the squared allelic correlation. Standardized linkage disequilibrium $D^{\prime }$ instead compares $D$ to its possible range at the given frequencies. High $|D^{\prime }|$ can coexist with low $r^2$, so it need not make one genetic marker a good predictor of another. Genetic linkage is a different notion: it describes within-family transmission and the recombination fraction.

The chromosome-21 study of Patil and colleagues, Science 2001 found consecutive single-nucleotide polymorphisms organized into regions with comparatively few common haplotypes; typically three haplotypes accounted for over 80% of the sampled chromosomes within a block. Such haplotype blocks can be represented efficiently by tag SNPs. Strong association within blocks and weaker association across boundaries give a useful description, though block boundaries depend on allele frequencies, population history, sampling and the operational definition of a block. They do not divide chromosomes into regions where genetic recombination is respectively impossible and certain.

The ancestry explanation uses an ancestral recombination graph. Going backwards, ancestral lineages coalesce, while a genetic recombination event splits one lineage's ancestral material into contributions from two parents. At a fixed genomic position, retaining only its ancestry gives a phylogenetic tree with the appropriate coalescent law. Nearby positions often retain much of the same tree; mutations on shared branches then produce correlated allele states. Breakpoints can change the local tree, weakening that shared history.

Under a simple random-mating two-locus model, linkage-disequilibrium decay under recombination gives $D_{t+1}=(1-r)D_t$. Actual populations also undergo genetic drift, population bottlenecks, mutation and migration, which can create or preserve association. Recombination rates themselves vary along chromosomes: McVean and colleagues, Science 2004 inferred strong local variation from sequence data. These observations motivate an ancestry model with spatially varying recombination, rather than treating physical distance as the only determinant of linkage disequilibrium.

For fine mapping, a typed genetic marker can show genetic association because it is correlated with a nearby causal genetic variant. Linkage-disequilibrium marker tagging makes a sparse first-stage scan possible, but several variants in one block can produce nearly indistinguishable association patterns. Historical recombination and diverse local genealogies can narrow the interval when denser genotyping is available.

An ancestral recombination graph turns that intuition into a likelihood calculation. One can place a proposed disease-origin event on a local ancestral branch and integrate over possible graphs, mutation histories and unobserved haplotypes. The local phylogenetic tree then relates disease-bearing chromosomes and predicts which markers should remain associated. In a Bayesian inference, uncertainty in ancestry, mutation location and demographic parameters enters the posterior distribution rather than being replaced by one guessed tree. Whole-graph inference is computationally demanding, and approximate or pairwise methods often supply practical estimates.

The useful distinction is between finding an associated region and identifying its causal variant. Strong linkage disequilibrium improves marker coverage but can limit resolution inside the associated region. Population stratification, ascertainment, rare variants and misspecified population history can also mislead an association analysis. Combining fine mapping with independent biological evidence is therefore stronger than interpreting an association peak as proof of causation.