Fuglede-type Estimates: A Quantitative Overview
- Fuglede-type estimates are a family of quantitative inequalities derived from the Fuglede–Kadison determinant, norm conditions, and perturbation arguments in operator theory.
- They extend classical results by including asymptotic approximation techniques, exact determinant evaluations, and Schatten-norm inequalities to address various nonnormal settings.
- These estimates provide practical tools for analyzing robustness in finite compressions, spectral invariants, and geometric stability in both analytic and combinatorial contexts.
Searching arXiv for the cited papers and closely related work on Fuglede-type estimates. “Fuglede-type estimates” designates a family of quantitative statements rather than a single theorem. In current usage, the phrase covers at least four distinct lineages: approximation and lower-bound results for the Fuglede–Kadison determinant in finite von Neumann algebra settings; exact determinant computations connected with Lehmer’s problem and -torsion; norm inequalities of Fuglede–Putnam type for nonnormal operators, often after Aluthge transform; and geometric stability inequalities modeled on Fuglede’s second-order analysis of perturbations of the ball. A separate but related lineage attached to Fuglede’s name concerns the spectral-set/tiling conjecture in finite vector spaces, where the relevant estimates are Fourier-analytic and combinatorial rather than determinant-theoretic (Li, 2010, Aribi, 2022, Mai et al., 2024, Moslehian et al., 2011, Prunier, 2023, Fallon et al., 2019).
1. Terminological scope and basic invariants
The determinant-theoretic core is the Fuglede–Kadison determinant. For a countable discrete group , with group von Neumann algebra and tracial state
an invertible has
In a general tracial -probability space , the corresponding notation in free-probabilistic contexts is
A second invariant appearing in recent work is the capacity of a positive linear map ,
0
which is positive exactly when 1 is rank non-decreasing (Li, 2010, Mai et al., 2024).
In operator theory, the phrase “Fuglede-type” refers instead to extensions or quantitative refinements of the classical Fuglede–Putnam implication. If 2 and 3, then
4
and 5 has the FP-property when
6
The relevant transformed object is the Aluthge transform
7
This is analytically unrelated to the determinant line, although both are described as “Fuglede-type” in the literature (Moslehian et al., 2011).
The geometric literature uses the phrase in yet another sense. For perturbations 8 of the unit-volume ball, one studies lower bounds for energies such as 9 or 0, with the inequality structure modeled on second-order isoperimetric expansions. By contrast, the finite-field Fuglede conjecture concerns whether a set is spectral if and only if it tiles by translation; there the basic estimates are Fourier zeros, equidistribution on parallel hyperplanes, and incidence bounds on affine lines and planes (Prunier, 2023, Fallon et al., 2019).
| Lineage | Central object | Representative estimate |
|---|---|---|
| Fuglede–Kadison approximation | finite compressions 1 | normalized 2 converges to 3 |
| Free-group determinant theory | 4 | exact FK determinants and upper bounds for Lehmer’s constants |
| Free probability and capacity | 5 | 6 |
| Fuglede–Putnam theory | 7, 8 | Schatten-norm lower bounds for 9 |
| Convex-shape stability | 0, 1 | quadratic control by 2 |
| Finite-field Fuglede conjecture | 3 | plane/line concentration bounds exclude intermediate spectral sizes |
2. Approximation of finite compressions and amenable-group entropy
For countable amenable 4, Li proved a finite-compression approximation theorem for 5 that is the prototypical determinant-theoretic Fuglede-type estimate (Li, 2010). If 6 is a Følner sequence, 7 is the orthogonal projection, and
8
then 9 need not be invertible. The theorem therefore allows controlled perturbations. Precisely, if 0 is invertible in 1, then for every 2 and every operator-norm bound 3, there exists 4 such that whenever 5 is large and
6
one has
7
Thus the normalized finite-dimensional determinant is asymptotically rigid under small-rank perturbation, provided uniform norm and inverse-norm bounds are retained.
The proof has four standard components in this circle of ideas. First, one reduces to the positive case and then returns to the general case by polar-decomposition and adjoint arguments. Second, Lück’s trace approximation theorem is applied to polynomials 8, giving
9
after which polynomial approximation of 0 transfers the limit to the determinant. Third, noninvertibility of 1 is “corralled” into a subspace of rank 2, and a perturbation on that subspace produces an invertible 3. Fourth, a rank estimate combined with Weyl-type inequalities shows that the determinant error is negligible after division by 4.
The theorem subsumes classical one- and multi-variable Mahler-measure regimes. For 5, a Laurent polynomial 6 with no zeros on the unit circle is invertible in 7, and 8 is the classical Mahler measure; the compressions are Toeplitz matrices and recover Szegő’s strong limit theorem. For 9, a torus-zero-free Laurent polynomial gives the higher-dimensional Mahler measure and multi-Toeplitz compressions.
The same determinant approximation is the analytic side of Li’s entropy identity. For the algebraic action on
0
the main dynamical theorem is
1
The normalized determinants 2 simultaneously approximate the Fuglede–Kadison determinant and the exponential growth rate of 3-separated orbit sets. Possible directions of further generalization explicitly indicated in this work are replacing amenable 4 by sofic groups, extending to other traces such as crossed products or groupoid von Neumann algebras, and allowing more general perturbations with subtler rank-versus-norm trade-offs.
3. Exact determinant formulas over free groups and Lehmer-type bounds
A second determinant lineage replaces asymptotic approximation by exact evaluation. Ben Aribi studied Fuglede–Kadison determinants over non-cyclic free groups and connected them to Lück’s Lehmer constants (Aribi, 2022). For a bounded 5-equivariant operator 6 on 7,
8
and if 9 is positive and injective this simplifies to 0.
The key exact computation concerns free generators 1 of 2. The paper proves
3
More generally, the analysis treats operators of the form
4
by relating 5 to trace generating series and to random walks on Cayley graphs. The decisive combinatorial input is closed-path counting on the 6-regular tree, following techniques of Bartholdi and Dasbach–Lalin. The resulting integral evaluation uses explicit algebraic generating functions and elementary antiderivatives involving 7 and logarithms.
These exact formulas feed directly into Lehmer-type questions. The paper recalls the four constants
8
defined as infima of 9 over different classes of integer-matrix operators. Since free groups satisfy the Strong Atiyah conjecture, the exact 0 computation yields
1
By subgroup induction, any torsion-free group containing a copy of 2 satisfies
3
Because 4, the paper concludes that 5 cannot serve as a universal lower gap for such groups.
The same paper also imports 6-torsion. For a finite-volume hyperbolic 7-manifold 8,
9
and a Dehn-surgery gluing formula gives
0
for the induced epimorphism 1. In favorable CW-presentations, 2 is itself a single Fuglede–Kadison determinant of a 3 operator over 4. Hence the Lehmer constants of 5 are bounded above by 6, and for small-volume fillings of the Whitehead link this upper bound is strictly below 7.
4. Matrix-valued semicircular elements, capacity, and universal lower bounds
Recent free-probabilistic work gives a closed-form Fuglede–Kadison determinant formula in terms of capacity (Mai et al., 2024). In a tracial 8-probability space 9, a matrix-valued semicircular element is
00
where 01 are fixed and 02 are freely independent standard semicircular elements. Its covariance map is
03
The central theorem is
04
equivalently
05
The proof splits into an indecomposable case and a general rank-non-decreasing case. If 06 is indecomposable, Gurvits’s operator-scaling theorem gives a unique minimizer 07, 08, for the capacity problem; scaling 09 makes the covariance doubly stochastic, and in that normalization the operator-valued free-probability analysis shows that 10 has the standard semicircle law on 11, hence determinant 12. In the general case, one perturbs
13
by a depolarizing channel, proves the formula for 14, and then lets 15 using semi-continuity of 16 and an approximate minimizer for 17.
The same paper sharpens a capacity lower bound for integer data. When
18
and 19 is rank non-decreasing, Garg–Gurvits–Oliveira–Widgerson had shown 20. Mai and Speicher improve this to the dimension-independent estimate
21
The argument embeds the associated linear pencil into
22
uses the Determinantal Conjecture as proved for free groups by Elek–Szabó to obtain 23, and then combines a conjugation argument with the AM–GM bound 24.
Several consequences are immediate. First,
25
so 26 is invertible as an unbounded operator if and only if 27 is rank non-decreasing; this recovers analytically the noncommutative Edmonds problem. Second, for integer data and invertible 28,
29
a universal lower bound independent of 30 and of the entries of the 31. Third, if 32 has spectrum in 33, then for every 34,
35
so a positive lower bound on 36 yields uniform control of spectral mass near zero. This suggests a precise infinite-dimensional analogue of the principle that an integer matrix with determinant at least 37 cannot have too many very small eigenvalues.
5. Fuglede–Putnam-type inequalities and the Aluthge transform
In operator theory, “Fuglede-type” refers to consequences of the Fuglede–Putnam implication beyond the normal setting (Moslehian et al., 2011). Let
38
be polar decompositions on Hilbert spaces 39, and let 40 be the Aluthge transform. The classical theorem asserts that if 41 and 42 are normal, then
43
Moslehian and Nabavi Sales study how this property behaves under Aluthge transform. If 44 and 45 are invertible and 46 has the FP-property, then 47 also has the FP-property. Conversely, if 48 are invertible, the spectra of 49 and 50 are contained in some open semicircle, and 51 has the FP-property, then 52 has the FP-property. They also prove the commutant relations
53
and, when 54 is invertible,
55
The mechanism is functional calculus on 56 and 57, together with the intertwining relations produced by the FP-property.
The quantitative estimate is a Schatten-norm inequality. If
58
then for any 59,
60
The proof proceeds by first obtaining a single-operator estimate under the commutation condition 61, then embedding the pair into the block operators
62
and finally reading off the relevant block inequality.
This line should not be conflated with Fuglede–Kadison determinant estimates. The common feature is the extension of a Fuglede-origin theorem to nonnormal or perturbed settings, but the objects, techniques, and conclusions are different: one concerns trace-log invariants in von Neumann algebras, the other commutant structure and Schatten-norm control for bounded operators.
6. Geometric stability and finite-field analogues
The geometric literature uses “Fuglede-type” for second-order stability inequalities around the ball under convexity constraints (Prunier, 2023). For the capacity functional, let 63 be the unit-volume ball and write a small radial perturbation as
64
with 65, 66, and barycenter at 67. Then there exist 68 and 69 such that for 70 and 71,
72
with equality only when 73. Equivalently, with 74,
75
The crucial weak IT estimate is
76
while perimeter contributes the classical second-order expansion
77
with
78
The proof strategy combines a radial homeomorphism 79, the capacitary test function 80, and sharp isoperimetric control of perimeter.
For the first Dirichlet eigenvalue, the same paper studies
81
among convex unit-volume sets. It identifies the exact threshold
82
for local minimality of the ball. If 83, then there exists 84 such that every convex 85 with 86 and 87 satisfies
88
with equality only for 89. If 90, there are smooth convex perturbations 91 with 92. The second-order expansion is
93
where
94
The sharp result relies on a smooth second-order analysis, then on a selection principle and a 95-regularity theorem for convex quasi-minimizers.
A distinct but often conflated Fuglede lineage concerns spectral sets and translational tiling in 96 (Fallon et al., 2019). A set 97 is spectral if the exponentials 98 form an orthogonal basis of 99, and it tiles by translation if
00
For odd 01, spectrality forces either 02 or 03, and the central Fourier lemma states that for 04,
05
if and only if 06 is equidistributed on the 07 parallel planes orthogonal to 08. From this one obtains the concentration bounds
09
and analogous bounds for the spectrum 10. Using these bounds together with case-specific combinatorics, the paper proves that for 11, a subset 12 is spectral if and only if it tiles 13 by translation, and it gives an alternate proof for 14.
Taken together, these examples show that “Fuglede-type estimates” can mean asymptotic determinant approximation, exact determinant evaluation, Schatten-norm coercivity, quadratic shape stability, or Fourier-combinatorial obstruction, depending on which Fuglede-origin problem is under discussion. The shared feature is not a single formal template but a recurring strategy: translate a structural property—entropy, rank non-decrease, commutation, local minimality, or spectrality—into a quantitative inequality that is stable under perturbation.