Averages of sub-additive functions through non-F lner sequences

summary

The gist

The paper studies averages of sub-additive functions through non-Følner sequences to generalize classical results on sequence entropy for countable amenable groups.

In short

The paper studies averages of sub-additive functions using non-Følner sequences to extend classical results on sequence entropy for countable amenable groups. It proves that every choice of a non-Følner sequence overestimates topological and measure-theoretic entropy by a factor related to the Følnerness constant C(F).

Key concepts

Non-Følner Sequence
This is a specific type of sequence used in the study. A Følner sequence has special properties, but this paper examines sequences that do not possess these properties. They are crucial because they allow the generalization of entropy results beyond classical conditions.
Følnerness Constant C(F)
This constant measures how far a sequence is from being a Følner sequence. If C(F) equals 1, the sequence is Følner. If it's greater than 1, it indicates that the sequence overestimates entropy by that factor.
Sequence Entropy
This concept generalizes classical entropy to sequences of functions or sets. The paper shows how to compute this for topological and measure-theoretic systems, linking them to the group's structure through specific sequence averages.

Terminology used across episodes

This episode discusses

The paper

Averages of sub-additive functions through non-F lner sequences · Read on arXiv

Universit Paris Cit, Paris, France

We study the quantity ϕ inΦ n to infinityϕ(F n)/F n, where F= (F n) n in N is a sequence of finite subsets of a countable amenable group, and Φ is a collection of subadditive functions. Under mild conditions on Φ we prove that the aforementioned quantity equals the supremum over ϕ inΦ of the limit of ϕ(F)/F as F becomes more and more invariant, multiplied by a ``Følnerness'' constant C(F) in[1, infinity]. We have C(F)=1 if and only if F is Følner. A corollary of this result is that every choice of a non-Følner sequence overestimates topological and measure-theoretic entropy by the multiplicative factor C(F) (in the positive entropy case). We obtain a generalization of classical results of Goodman, Krug, and Newton, on the so-called proportionality principle for sequence entropy, and their extension by Gao, Huang, and Zhu to countable amenable groups.

Transcript

Introduction to the show: ident: Mathematics. The day in mathematics: new theorems, new proofs, and what they open.

Ada: I'm Ada.

Emmy: And I'm Emmy, here with Kolya.

Ada: We're looking at the paper: "Averages of sub-additive functions through non-F lner sequences".

Emmy: Here's the gist of the paper. The paper studies averages of sub-additive functions through non-Følner sequences to generalize classical results on sequence entropy for countable amenable groups.

Ada: This work is significant because it removes technical conditions from previous generalizations and proves that every choice of a non-Følner sequence overestimates topological and measure-theoretic entropy by a multiplicative factor related to the "Følnerness" constant C(F).

Emmy: Interpretation of the Følnerness Constant The constant C(F) is defined as sup E⋐G lim sup n→∞ EFn/Fn, and Remark 1.2 states that C(F) equals 1 if and only if F is Følner.

Ada: The paper notes that C(F) can be interpreted as a “Følnerness” constant.

Paper summary: Ada: So to summarize this paper, "Averages of sub-additive functions through non-Følner sequences," the core thesis is that they study averages of sub-additive functions using sequences that are not necessarily Følner.

Emmy: The main claim is that under mild conditions on those functions, they prove that this quantity equals the supremum over those same functions of the limit of the average as you make the set more and more invariant, multiplied by a Følnerness constant C(F).

Kolya: And what makes it matter is this constant C(F), which is one if and only if the sequence is Følner, meaning it measures exactly how far you are from being well-behaved.

Ada: Exactly. The real significance comes from a corollary of this result, which states that every choice of a non-Følner sequence overestimates topological and measure-theoretic entropy by that multiplicative factor C(F) in the positive entropy case.

Emmy: It means if you pick any sequence that isn't Følner, the estimated entropy is inflated by this constant C(F).

Kolya: So for a practical application, what does that tell us about how we estimate complexity in these systems? Is it just an error bound?

Ada: It’s more than just an error bound; it’s a quantified statement about the inherent bias when you use a non-Følner sequence to measure entropy.

Emmy: They're generalizing results from Goodman, Krug, and Newton on the proportionality principle for sequence entropy, and extending that by Gao, Huang, and Zhu to countable amenable groups.

Kolya: So they are taking established ideas about how sequences behave in these settings and putting them into a new framework that handles non-Følner cases more generally.

Conclusion: Ada: Thinking about the title, "Averages of sub-additive functions through non-Følner sequences," it sounds very technical and dense, but the paper’s aim is to make that concept accessible by connecting it to more familiar ideas like sub-additive functions.

Emmy: The authors are tackling a deep topic in dynamical systems—sequence entropy—and they manage to connect it cleanly to the structure of countable amenable groups.

Kolya: The implication for us, as listeners, is that we can use non-Følner sequences and still get meaningful bounds on complexity because this error is explicitly tied to the Følnerness constant C(F).

Ada: So in simple terms, it means if you're working with these groups and you pick a sequence that isn't Følner, you can use the paper’s formula to know exactly how much your estimate will be inflated by C(F).

Emmy: It gives us a precise tool to measure that deviation from the ideal Følner behavior in terms of entropy.

Kolya: It seems like this work provides a clear path forward for generalizing these classical results without getting bogged down in overly specific technical prerequisites that held up earlier attempts.

More episodes

← Home