---
title: Fidelity-Preserving Chain-Contraction Theorem
url: https://www.emergentmind.com/topics/fidelity-preserving-chain-contraction-theorem
type: topic
---

# Fidelity-Preserving Chain-Contraction Theorem

Searching arXiv for the main paper and directly related prior work.
The “Fidelity-Preserving Chain-Contraction Theorem” is an *Editor’s term* for the main result of “Multiplicative error set system sparsification: A simpler proof via chain length contraction” [2605.01508]. It concerns multiplicative sparsification of set systems: given nonnegative weights on a ground set, the objective is to replace them by a sparse weight vector that preserves the weighted measure of every set in the family within a factor of $(1\pm\epsilon)$. The theorem identifies the decisive structural parameter as the chain length of the union-closure of the set system, and it proves—through a contraction argument in the style of Karger’s min-cut contraction—that chain length governs multiplicative sparsifiability up to quasi-polylogarithmic factors [2605.01508].

## 1. Formal setting and structural parameter

The underlying object is a set system $\mathcal S \subseteq 2^{[m]}$ on the ground set $[m]=\{1,2,\dots,m\}$. Its union-closure is
$$
\operatorname{Ucl}(\mathcal S):=\{S_1\cup S_2\cup\cdots\cup S_k : k\ge 1,\ S_i\in\mathcal S \text{ for all } i\}.
$$
The relevant combinatorial complexity measure is the chain length
$$
L(\mathcal S):=\max\{\ell : \exists T_1,\dots,T_\ell\in \operatorname{Ucl}(\mathcal S)\text{ with }T_1\subsetneq T_2\subsetneq \cdots \subsetneq T_\ell\}.
$$
Thus, the theorem is not stated in terms of cardinality of $\mathcal S$, nor directly in terms of the ambient dimension $m$, but in terms of the longest strict inclusion chain inside the union-closure [2605.01508].

The paper also works with the equivalent code-theoretic representation. A set system $\mathcal S$ is encoded by a code $C\subseteq\{0,1\}^m$ consisting of indicator vectors of its sets. In this formulation, a chain of length $\ell$ in $C$ is a pair of injections $a:[\ell]\to[m]$ and $c:[\ell]\to C$ such that
1. for every $i\in[\ell]$, $c(i)_{a(i)}=1$, and  
2. for all $1\le i<j\le \ell$, $c(i)_{a(j)}=0$.

The maximum such $\ell$ is denoted $\operatorname{CL}(C)$. The paper states that $\operatorname{CL}(C)$ agrees with $L(\mathcal S)$ up to the benign replacement of $\mathcal S$ by $\operatorname{Ucl}(\mathcal S)$, that one always has $\operatorname{NRD}(C)\le \operatorname{CL}(C)$, and that the standard counting bound
$$
|C|\le (m+1)^{\operatorname{CL}(C)}
$$
holds [2605.01508].

Multiplicative sparsifiability is defined through weighted measures. For a weight function $w:[m]\to\mathbb R_{\ge 0}$ and a set $T\subseteq[m]$, its weight is
$$
w(T):=\sum_{i\in T} w(i).
$$
A $(1\pm\epsilon)$-sparsifier for $\mathcal S$ is a nonnegative weight vector $\widetilde w$ of small support such that for every $T\in\mathcal S$,
$$
\sum_{i\in T}\widetilde w(i)\in (1\pm\epsilon)\sum_{i\in T}w(i).
$$
In code notation, the requirement is
$$
\langle \widetilde w,c\rangle \in (1\pm\epsilon)\langle w,c\rangle \qquad \forall c\in C.
$$
The entire theorem concerns minimizing $|\operatorname{supp}(\widetilde w)|$ under this simultaneous multiplicative-fidelity constraint [2605.01508].

## 2. Main theorem and its tightness profile

The paper states that it does not explicitly name any theorem “Fidelity-Preserving Chain-Contraction Theorem,” but its Theorem 1.2 / Theorem 4.3 plays precisely that role [2605.01508]. In the notation above, if $\mathcal S\subseteq 2^{[m]}$ has chain length $L:=L(\mathcal S)$ in the union-closure, then for any $w:[m]\to\mathbb R_{\ge 0}$ and any $\epsilon\in(0,1)$ there exists a randomized procedure that returns a $(1\pm\epsilon)$-sparsifier $\widetilde w$ with
$$
|\operatorname{supp}(\widetilde w)| = O\!\left(\frac{L\cdot \log^2(L/\epsilon)\cdot (\log\log(L/\epsilon))^2}{\epsilon^2}\right),
$$
with constant success probability, and the guarantee holds simultaneously for all sets in $\mathcal S$ [2605.01508].

An intermediate dimension-dependent statement, Theorem 4.2, is formulated for arbitrary codes $C\subseteq\{0,1\}^m$:
$$
\text{there exists a } (1\pm\epsilon)\text{ sparsifier of size } 
O\!\left(\frac{\operatorname{CL}(C)\cdot \log^2 m\cdot (\log\log m)^2}{\epsilon^2}\right).
$$
The full theorem then removes the ambient-dimension dependence and replaces $\log m$ by $\log(L/\epsilon)$ through an additional iteration argument [2605.01508].

The paper also emphasizes two lower bounds. First, for every set system $\mathcal S$, there exists a choice of weights $w$ such that any $(1\pm\epsilon)$-sparsifier for any $\epsilon<1/2$ must have support size at least $L(\mathcal S)$; this is cited from Lemma 8.9 in the full version of Brakensiek–Guruswami (STOC 2025). Second, the $1/\epsilon^2$ dependence is optimal in general by the Carlson–Kolla–Srivastava–Trevisan lower bound for cut sketches, even for graph cuts. Accordingly, the paper concludes that the theorem is tight up to the quasi-polylogarithmic factor in $L/\epsilon$ [2605.01508].

A common misunderstanding is to interpret the result as a purely dimension-driven sampling theorem. The paper’s point is the opposite: the dominant structural parameter is chain length, and the final guarantee is dimension-free. This suggests that large ambient dimension is not by itself an obstruction to multiplicative sparsification when the union-closure has short chains.

## 3. Contraction mechanism and proof architecture

The central proof idea is a contraction-based counting argument. For a code $C\subseteq\{0,1\}^m$ and a coordinate $i$ such that some $c\in C$ has $c_i=1$, the contraction step deletes all codewords using coordinate $i$:
$$
C \leftarrow C' := \{c\in C : c_i=0\}.
$$
The paper proves that if some codeword uses coordinate $i$, then
$$
\operatorname{CL}(C') \le \operatorname{CL}(C)-1.
$$
The proof idea is simple: starting from a chain witnessing $\operatorname{CL}(C')$ and any codeword $v\in C$ with $v_i=1$, one extends the chain by placing $(i,v)$ at the end, yielding a chain in $C$ that is one longer [2605.01508].

This local contraction step is embedded in an analytical randomized process called `Contract`. Given $\alpha\in\mathbb Z_{>0}$, while $\operatorname{CL}(C)\ge \alpha$, one chooses $i$ uniformly from
$$
\operatorname{Supp}(C)=\{j:\exists c\in C\text{ with }c_j=1\},
$$
replaces $C$ by $\{c\in C:c_i=0\}$, and after the chain length drops below $\alpha$, returns a uniformly random codeword from the surviving code. The process is not used as a constructive algorithm; it is used to quantify the survival probability of low-weight codewords under repeated contractions [2605.01508].

The paper introduces the density
$$
\Phi(C):=\min_{C'\subseteq C}\frac{|\operatorname{Supp}(C')|}{\operatorname{CL}(C')}.
$$
Using the contraction process, it proves a counting bound: for any $\alpha\in\mathbb Z_{>0}$, the number of codewords in $C$ of Hamming weight at most $\alpha\cdot \Phi(C)$ is at most
$$
(m+1)^\alpha \cdot \binom{\operatorname{CL}(C)}{\alpha}.
$$
The argument tracks a fixed codeword $c$ of weight at most $\alpha\Phi(C)$ through the random contractions. At an intermediate stage with current chain length $k\ge \alpha+1$, the support size is at least $\Phi(C)\cdot k$, so the probability that the next contraction deletes $c$ is at most
$$
\frac{\operatorname{wt}(c)}{\Phi(C)\cdot k}\le \frac{\alpha}{k}.
$$
Therefore $c$ survives from $\operatorname{CL}(C)$ down to $\alpha$ with probability at least
$$
\prod_{k=\alpha+1}^{\operatorname{CL}(C)}\left(1-\frac{\alpha}{k}\right)
= \frac{1}{\binom{\operatorname{CL}(C)}{\alpha}}.
$$
Conditioned on survival, a final uniform choice returns $c$ with probability at least $(m+1)^{-\alpha}$, since the standard chain-length counting bound limits the number of surviving codewords when $\operatorname{CL}\le \alpha$ [2605.01508].

The counting argument is converted into a structural decomposition. The paper proves that for any $d>0$, there exists a set $T\subseteq[m]$ with $|T|\le \operatorname{CL}(C)\cdot d$ such that for every $\alpha\in\mathbb Z_{>0}$, the number of codewords in the restricted code $C|_{\overline T}$ of weight at most $\alpha d$ is at most
$$
(m+1)^\alpha \cdot \binom{\operatorname{CL}(C)}{\alpha}.
$$
This is obtained by iteratively finding subcodes of small density and peeling off their support. The paper further states that if $C'\subseteq C$ has support $T$ and $\operatorname{CL}(C')=\ell$, then with $C''=C|_{\overline T}$ one has
$$
\operatorname{CL}(C'') \le \operatorname{CL}(C)-\ell,
$$
so chain length decreases additively under peeling [2605.01508].

The remainder of the proof combines this decomposition with random sampling. After peeling $T$, the residual code has few low-weight vectors, which allows the use of a Chernoff-type concentration bound due to Fung–Hariharan–Harvey–Panigrahi:
if $X_1,\dots,X_\ell$ are independent, with $X_i=1/p_i$ with probability $p_i$ and $0$ otherwise, and if $p_i\ge p$ for all $i$, then for any $\epsilon\in(0,1)$,
$$
\Pr\!\left[\sum_i X_i \notin (1\pm\epsilon)\cdot \ell\right]
\le 2\exp(-0.38\epsilon^2 \ell p).
$$
The recursive scheme then chooses
$$
\eta \approx \frac{\log m}{(\epsilon/\log\log m)^2},
\qquad
d \approx \sqrt{\frac{m\eta}{\operatorname{CL}(C)}},
\qquad
p \approx \sqrt{\frac{\eta\cdot \operatorname{CL}(C)}{m}},
$$
obtains a per-level multiplicative error $(1\pm \epsilon/(20\log\log m))$ with probability $1-1/\operatorname{poly}(m)$, recurses for $O(\log\log m)$ levels, and composes the errors multiplicatively. This yields the dimension-dependent theorem. A further two-regime iteration over $O(\log^* m)$ rounds replaces the $\log m$ dependence by $\log(L/\epsilon)$ and produces the main dimension-free theorem [2605.01508].

## 4. Position relative to prior work

The result is presented as an improvement over Brakensiek–Guruswami (STOC 2025). According to the paper, their main upper bound for weighted set systems was
$$
|\operatorname{supp}(\widetilde w)| = O\!\left(\frac{\operatorname{CL}(\mathcal S)\cdot \log^6 m}{\epsilon^2}\right),
$$
derived through a more complex argument that first handled an unweighted setting using techniques inspired by recent progress on union-closed sets and then bootstrapped to the weighted case. The newer proof is described as both simpler and sharper: the dependence on $m$ is reduced from $\log^6 m$ to $\log^{2+o(1)}(L/\epsilon)$, and the final statement is dimension-free [2605.01508].

The paper places the contraction argument in a line of ideas originating with Karger’s SODA 1993 contraction algorithm for graph cuts. The analogy is conceptual rather than literal. In Karger’s setting, random contractions preserve a min-cut with controlled probability and lead to counting bounds for small cuts; here, random contractions reduce chain length and lead to counting bounds for low-weight codewords. The paper also situates itself alongside the linear-algebraic code-sparsification framework of Khanna–Putterman–Sudan (SODA 2024), but it stresses that the core contraction and counting argument in the present result is purely combinatorial and does not require linear-algebraic machinery [2605.01508].

A central conceptual comparison is the analogy with VC-dimension. In the additive regime, VC-dimension $d$ characterizes sample complexity: a random sample of size $\Theta(d/\epsilon^2)$ yields additive-error guarantees for all sets simultaneously. In the multiplicative regime studied here, the paper argues that reweighting is indispensable and that chain length plays the role that VC-dimension plays in additive sparsifiability. The upper bound provides sparsifiers of size $\operatorname{polylog}(L/\epsilon)\cdot L/\epsilon^2$, while the lower bound shows that $\Omega(L)$ support may be necessary in the worst case. The stated conclusion is that chain length characterizes multiplicative sparsifiability up to quasi-polylogarithmic factors, mirroring the role of VC-dimension in the additive setting [2605.01508].

One possible misconception is to identify chain length with a minor technical surrogate for some more standard dimension notion. The paper’s formulation suggests the opposite: chain length is the intrinsic parameter singled out by the multiplicative problem, not merely an auxiliary complexity measure.

## 5. Corollaries, examples, and edge cases

An immediate corollary concerns weighted CSP sparsification. For a weighted CSP instance $I$, each assignment $x$ induces the set $S_x$ of satisfied constraints, and the family
$$
\mathcal S := \{S_x : x\in \text{domain}^n\}
$$
becomes the relevant set system. If $L:=L(\mathcal S)$ is the chain length of its union-closure, then for any $\epsilon\in(0,1)$ there exists a $(1\pm\epsilon)$-sparsifier of $I$ retaining
$$
O\!\left(\frac{L\cdot \log^2(L/\epsilon)\cdot (\log\log(L/\epsilon))^2}{\epsilon^2}\right)
$$
constraints. The paper states that this improves prior bounds derived both from the $\log^6 m$ dependence in Brakensiek–Guruswami and from field-size dependent bounds via linear code sparsification, while unifying them under chain length [2605.01508].

Several examples illustrate how the bound behaves.

For graph cuts, let $G=(V,E)$ and let $\mathcal S$ be the family of all cuts, viewed as subsets of $E$. The paper states that $L(\mathcal S)\le |V|$. Consequently, the theorem yields a cut sparsifier with
$$
O\!\left(\frac{|V|\cdot \log^{2+o(1)}(|V|/\epsilon)}{\epsilon^2}\right)
$$
edges, recovering the Benczúr–Karger size up to an extra $\widetilde O(\log)$ factor [2605.01508].

For linear codes $C\subseteq \mathbb F_q^m$ of dimension $n$, if one considers the set system of supports of codewords, then it is known that $\operatorname{CL}=n$. The theorem therefore yields the first field-size independent code sparsifier of size
$$
O\!\left(\frac{n\cdot \log^{2+o(1)}(n/\epsilon)}{\epsilon^2}\right)
$$
[2605.01508].

For laminar families of depth $D$, the paper states that the union-closure remains laminar and has chain length $L\le D$. This gives sparsifiers with
$$
O\!\left(\frac{D\cdot \operatorname{polylog}(D/\epsilon)}{\epsilon^2}\right)
$$
support [2605.01508].

For intervals on a line, the longest chain in the union-closure equals $m$, exemplified by the family $\{[i,m]\}_{i=1}^m$. The worst-case guarantee is therefore
$$
O\!\left(\frac{m\cdot \operatorname{polylog}(m/\epsilon)}{\epsilon^2}\right),
$$
although the paper notes that interval families of bounded depth admit correspondingly better bounds [2605.01508].

The lower-bound constructions from Brakensiek–Guruswami furnish the opposite edge case: there exist set systems and weights for which any $(1\pm\epsilon)$-sparsifier must have support size at least $L(\mathcal S)$. This demonstrates that chain length is not merely sufficient but also necessary as a first-order parameter [2605.01508].

## 6. Nonconstructivity, parameterization, and open directions

The paper is explicit that the proof is nonconstructive in two senses. First, the method depends on the chain length $L(\mathcal S)$ or $\operatorname{CL}(C)$, and no efficient algorithm is known for computing chain length in general. Second, the contraction algorithm is analytical rather than implementational: the actual sparsifier is obtained through random sampling guided by the decomposition, not by literal execution of the contraction process [2605.01508].

This clarification addresses an important potential misconception. No actual contraction step is used to produce the final sparse representation, so no contraction step can “break fidelity.” Instead, contractions serve to prove a counting theorem for dangerous low-weight vectors. Fidelity is then enforced by sampling-and-reweighting together with the concentration inequality and a union bound [2605.01508].

The paper records explicit parameter choices for the recursive construction. It uses
$$
\eta \approx 1000\cdot \frac{\log m}{(\epsilon/(20\log\log m))^2},
\qquad
d \approx \sqrt{\frac{m\eta}{\operatorname{CL}}},
$$
and in the dimension-free stage iterates the dimension-dependent sparsifier with progressively smaller $m$ until $m$ becomes quasipolynomial in $L/\epsilon$, after which it switches to a final pass whose dependence is logarithmic in $L/\epsilon$ [2605.01508]. Each sampling step succeeds with probability $1-1/\operatorname{poly}(m)$; a union bound over $O(\log\log m)$ levels preserves constant success probability, and standard amplification by repetition reduces failure to $\delta$ at an extra $O(\log(1/\delta))$ factor in time without changing the asymptotic support size [2605.01508].

The paper also identifies several open problems. Its principal conjecture is the linear-size bound
$$
O\!\left(\frac{L(\mathcal S)}{\epsilon^2}\right),
$$
stated as Conjecture 5.1. Even proving such a bound for linear codes is described as a major advance. Additional open directions include deterministic constructions, efficient approximations to chain length sufficient for near-optimal sparsification, and extensions of the contraction viewpoint toward a spectral analogue for general set systems, in the spirit of PSD or hypergraph sparsification and analogous to BSS’09 for graphs [2605.01508].

Taken together, these points define the theorem’s significance. It provides a contraction-based characterization of multiplicative sparsifiability in terms of chain length, improves and clarifies the STOC 2025 result of Brakensiek–Guruswami, and establishes a structural analogy between chain length in the multiplicative regime and VC-dimension in the additive regime. The contraction analysis itself is purely combinatorial, but its consequences extend to weighted CSP sparsification, code sparsification, and other union-closed set-system settings [2605.01508].

Source: https://www.emergentmind.com/topics/fidelity-preserving-chain-contraction-theorem