Quasi-Isometry Invariance of discrete Higher Filling Functions

Here is an explanation of the paper "Quasi-Isometry Invariance of Discrete Higher Filling Functions" by Jannis Weis, translated into everyday language with creative analogies.

The Big Picture: Measuring the "Messiness" of a Group

Imagine you are trying to solve a puzzle. In the world of mathematics, a Group is like a set of rules for moving around a vast, infinite maze. The "Word Problem" is simply asking: "If I follow these instructions, do I end up back where I started?"

For a long time, mathematicians have used a tool called a Dehn Function to measure how hard it is to solve this puzzle.

The Analogy: Imagine you draw a loop on a piece of paper (a path that starts and ends at the same spot). To prove it's a "null-homotopic" loop (meaning it can be shrunk to a point without tearing), you have to fill it in with a shape (like a soap bubble).
The Question: How much "soap" (area) do you need to fill a loop of a certain size?
- If you need a tiny bit of soap, the group is "easy" (like a flat plane).
- If you need a mountain of soap, the group is "hard" (like a complex, twisted knot).

This paper is about a specific, more advanced version of this soap-bubble test. Instead of just 2D loops, the author looks at filling in 3D, 4D, and higher-dimensional "bubbles."

The Problem: Different Rulers, Different Answers

Mathematicians realized that the answer to "how much soap do I need?" depends heavily on how you measure the soap.

The Standard Ruler: You count the total volume of the soap.
The Discrete Ruler: You just count the number of distinct soap bubbles you use, regardless of their size. (If you use 5 bubbles, the cost is 5. If you use 500 tiny bubbles, the cost is 500).

For a long time, mathematicians knew that if you use the "Standard Ruler" (integers), the answer stays the same even if you change the map of the maze slightly (a concept called Quasi-Isometry). But nobody knew if the "Discrete Ruler" (counting bubbles) behaved the same way.

The Conjecture: A group of mathematicians (Bader, Kropholler, and Vankov) guessed that the answer should be the same for the Discrete Ruler too. They thought: "If two mazes look roughly the same from a distance, they should require the same number of bubbles to fill their loops."

The Solution: A New Way to Build Bridges

Jannis Weis proves this conjecture is TRUE.

To do this, he had to invent a new way of thinking. Usually, these problems are solved using geometry (drawing shapes). But Weis decided to solve it using pure algebra (manipulating equations and lists of numbers).

The Creative Metaphor: The "Algebraic LEGO" Set
Imagine you have a giant set of LEGO bricks.

The Old Way: You try to build a castle by physically snapping bricks together on a table (Geometry).
Weis's New Way: He created a set of instructions (an algebraic framework) that tells you how to snap the bricks together without ever touching the table. He proved that even if you only look at the instructions and the list of bricks, you can predict exactly how the castle will hold together.

He showed that you can treat these abstract lists of numbers (chain complexes) exactly like physical shapes. By doing this, he could prove that the "Discrete Ruler" gives the same result for any two mazes that look similar from a distance.

The "Thickening" Trick

One of the coolest tools Weis used is called Thickening.

The Analogy:
Imagine you have a tiny, fragile wire sculpture (a small loop in the maze). You want to fill it in, but the instructions are scattered far away.

The Problem: The instructions for filling the loop might be hidden in a different part of the infinite maze.
The Solution: Weis developed a method to "thicken" the wire sculpture. He takes the loop and expands it slightly to grab all the nearby instructions it needs.
The Result: He proved that no matter how big your loop is, you only need to expand it by a finite amount to find all the necessary pieces to fill it. This guarantees that the "cost" (the number of bubbles) is always a finite number, never infinity.

Why Does This Matter?

It Confirms a Guess: It settles a debate among mathematicians about whether the "Discrete Ruler" is a reliable way to measure groups. It is!
It Works for "Heavy" Groups: It works even for groups that are very complex and don't have simple descriptions (Type $FP_n$ ).
Weighted Filling: The paper also looks at a "Weighted" version of the ruler, where bubbles far away from the center cost more to use. Weis showed that this version is also consistent across similar mazes. This is useful for studying properties like "Rapid Decay" (how fast sound or information fades in a group).

Summary in One Sentence

Jannis Weis invented a new "algebraic LEGO" method to prove that if you measure the complexity of a mathematical maze by simply counting the number of pieces needed to fill its holes, you will get the same answer for any two mazes that look roughly the same, confirming a major guess in the field.

Here is a detailed technical summary of the paper "Quasi-Isometry Invariance of Discrete Higher Filling Functions" by Jannis Weis.

1. Problem Statement and Context

The Core Problem:
The paper addresses the quasi-isometry invariance of homological higher filling functions ( $FV_{n, R, \Gamma}$ ) for groups of type $FP_n(R)$ .

Filling Functions: These functions measure the difficulty of filling $n$ -cycles with $(n+1)$ -chains in a group $\Gamma$ with coefficients in a normed ring $R$ . They generalize the classical Dehn function (which measures the area of filling loops).
The Conjecture: Bader, Kropholler, and Vankov (BKV) conjectured that for any two quasi-isometric groups $G$ and $H$ of type $FP_n(R)$ , their filling functions are equivalent ( $FV_{n, R, G} \approx FV_{n, R, H}$ ).
The Gap: While this was known for integral coefficients ( $R=\mathbb{Z}$ ) and for groups of type $FH_n(R)$ (geometric finiteness) under specific conditions, the conjecture remained open for discrete norms and general groups of type $FP_n(R)$ (algebraic finiteness).
Specific Focus: The paper specifically targets the discrete filling function ( $DFV_{n, R, \Gamma}$ ), where the norm on the ring $R$ is the discrete norm ( $|x|=1$ if $x \neq 0$ ). In this setting, the "size" of a chain is simply the cardinality of its support.

2. Methodology

The author develops a novel algebraic framework to translate geometric arguments from cellular chain complexes into the purely algebraic setting of free $R\Gamma$ -chain complexes.

Key Technical Innovations:

Geometric Structure on Chain Complexes:
- The paper equips free $R\Gamma$ -modules with a "geometric structure" derived from the word metric of the group $\Gamma$ .
- It defines $\Gamma$ -support and $R$ -support for chains.
- It constructs connectivity graphs ( $Gr(U)$ ) for subsets of the basis, where edges represent shared boundary elements. This allows the definition of "connected" chains, analogous to connected subcomplexes in topology.
Algebraic Thickening:
- The author introduces an algebraic analogue of the geometric "thickening" of a subcomplex.
- Basis Collections: Subsets of the basis are treated as generating subcomplexes.
- Thickening Procedure ( $N^{k,j}$ ): An iterative process is defined to expand a set of basis elements to include all elements whose boundaries intersect the current set. This mimics taking the neighborhood of a subcomplex in a simplicial complex.
- Finiteness: The paper proves that for groups of type $FP_n(R)$ , these thickened subcomplexes remain of finite type (finitely generated) and eventually cover the entire resolution (Theorem 3.18).
Weighted Norms:
- The methodology is extended to weighted filling functions ( $wFV$ ), where basis elements are assigned weights based on their word length ($1 + \ell_\Gamma(\gamma)$). This connects the work to the Rapid Decay property and higher Property (T).

3. Key Contributions and Results

The paper establishes several major theorems that resolve the BKV conjecture in the discrete case and extend it to weighted settings.

A. Finiteness of Discrete Filling Functions

Theorem 4.4: For any group $\Gamma$ $Γ$ of type $FP_n(R)$ $F P_{n} (R)$ , the discrete filling function $DFV_{n, R, \Gamma}$ $D F V_{n, R, Γ}$ takes finite values.
- Significance: This was a prerequisite for the invariance conjecture. The proof uses the algebraic thickening procedure to show that any connected cycle of bounded norm is contained in a finite subcomplex, ensuring a finite filling exists.

B. Quasi-Isometry Invariance (Main Result)

Theorem 5.5: Let $G$ $G$ and $H$ $H$ be quasi-isometric groups of type $FP_n(R)$ $F P_{n} (R)$ . Then $DFV_{n, R, G} \approx DFV_{n, R, H}$ $D F V_{n, R, G} \approx D F V_{n, R, H}$ .
- Significance: This confirms the BKV conjecture for discrete norms. It completes the picture of quasi-isometry invariance for all standard coefficient choices (integers, finite fields, and general discrete rings).
Theorem 5.4 (General Criterion): Provides a general criterion: If $G$ and $H$ are quasi-isometric $FP_n(R)$ groups and their filling functions are finite, then they are equivalent. Since Theorem 4.4 guarantees finiteness for discrete norms, Theorem 5.5 follows immediately.

C. Weighted Filling Functions

Theorem 5.9 & 5.10: The invariance results extend to weighted discrete filling functions ( $wDFV$ $w D F V$ ) and weighted integral filling functions ( $wFV_{n, \mathbb{Z}}$ $w F V_{n, Z}$ ).
- This is significant for applications in geometric group theory involving the Rapid Decay property and polynomial cohomology.

D. Cohomological Invariance

Theorem 6.7: The paper provides a new algebraic proof that group cohomology with coefficients in the group ring ( $H^*(G; R\Gamma)$ ) is a quasi-isometry invariant for groups of type $FP(R)$ .
Corollaries: This implies the quasi-isometry invariance of the cohomological dimension ( $cd_R(G)$ ) and the property of being a (Poincaré) duality group.

4. Significance and Impact

Resolution of a Major Conjecture: The paper definitively settles the Bader–Kropholler–Vankov conjecture for the discrete norm case, a long-standing open problem in geometric group theory.
Bridging Geometry and Algebra: The primary contribution is the methodological shift. By replacing geometric cellular arguments with algebraic "thickening" of basis collections, the author demonstrates that free $R\Gamma$ -resolutions behave sufficiently like cellular chain complexes of spaces to support geometric intuition. This technique is likely to be applicable to other problems involving finiteness properties.
Unification of Results: It unifies the understanding of filling functions across different coefficient rings (integers, finite fields, discrete rings) and different norms (standard vs. weighted).
New Proofs for Classical Results: The framework provides streamlined proofs for the finiteness of integral filling functions (recovering results by Fleming, Martínez-Pedroza, etc.) and the quasi-isometry invariance of cohomology (recovering results by Gersten and Li) without requiring the groups to be finitely presented.

Summary of the Proof Strategy

Setup: Define the geometric structure on free chain complexes using word metrics and support graphs.
Finiteness: Prove that for $FP_n(R)$ groups, any cycle of bounded norm can be "thickened" into a finite subcomplex that contains a filling. This proves $DFV$ is finite.
Invariance: Use the quasi-isometry between $G$ and $H$ to construct chain maps between their resolutions.
Control: Use the "thickening" and connectivity lemmas to bound the norms of the images of chains under these maps.
Conclusion: Show that the filling volume in one group can be bounded by the filling volume in the other (up to linear distortion), proving equivalence.

This work significantly advances the understanding of the geometric and algebraic properties of groups, particularly regarding how "filling" complexity behaves under quasi-isometry.