WorksMathematics
Least-Atom Extremizers for Resampling Noise
Abstract
A single least-mass atom determines the extremal behavior of resampling noise on a finite probability space. A fixed-moment comparison gives the sharp generalized Samorodnitsky inequality for every through one scalar curve, and identifies all nonconstant scalar extremizers. The same principle determines every -to- resampling norm for , resolving a conjecture of Cao, Fan, Han, Qiu, and Wang. The sharp hypercontractive parameter increases strictly with the least atom. The uniform-binary phase diagram is explicit, and product equality cases are classified for every nonuniform reference law and for the uniform binary law.
Introduction
Background and the source problem
Resampling is a basic model of noise on a finite probability space . With probability an observation is kept, and with probability it is replaced by an independent sample from . Its averaging operator is
The question is how much a function can remain concentrated after this averaging. Two familiar measurements are its logarithmic moments and the ratio of its output -norm to its input -norm. For example, a density concentrated on a very rare outcome may retain a large norm even after substantial resampling. It is less clear whether spreading the high values over several outcomes can be more effective.
On a product space, noise and partial observation give two ways to average a function. Product resampling acts independently in each coordinate. Partial observation retains a random set of coordinates and averages over the rest. The generalized Samorodnitsky inequality compares them:
Here is nonzero and nonnegative on , the measure is , and each coordinate is retained in independently with probability . The sharp inclusion parameter is the smallest for which this holds in every dimension. Determining it quantifies the information that survives noise in terms of information available from a partial observation.
Samorodnitsky proved this comparison on the uniform Boolean cube for [2 Thm. 1.1], and obtained the sharp parameter for integer [9 Thm. 1.1]. Abawonse, Hązła, and O’Donnell extended the sharp result to finite product probability spaces and real [1 Thms. 1 and 19]. Their nonconstant scalar extremizers are normalized indicators of least-mass atoms. Section 1.4 of the full version explicitly leaves untreated and explains why this indicator description should not persist throughout that range. Numbering in [1] below refers to its full arXiv version.
Question 1.1 (The direction in [1 Sec. 1.4]). For a finite probability space, what is the sharp generalized Samorodnitsky inequality when , and which scalar functions replace the least-atom indicators from the range ?
A related question concerns hypercontractivity: for given , how much noise is necessary to ensure for every ? Write for the largest admissible , and for the two-point law . Wolff’s two-value reduction [12 Thm. 3.1] gives, in our order of exponents,
It leaves a comparison among the two-point masses. Cao, Fan, Han, Qiu, and Wang determine the biased two-point constants and prove equality for conjugate exponents [13 Thm. 1.6 and Cor. 1.7]. They pose the following conjecture immediately after Figure 3 on page 8.
Conjecture 1.2 ([13 Sec. 1.2, p. 8]). If is a finite probability law with least atom , then for every .
Contribution
Both questions are governed by a comparison that keeps the mean and one convex moment fixed. Under a monotonicity condition on the ratio of two second derivatives, the other moment is largest when the high value lies on a single least atom (Theorem 3.1). This identifies the mass as well as the number of levels. For a least atom , the resulting mean-one family is
It interpolates between a constant and the normalized indicator of . The terms soft and hard refer respectively to and . The key comparison moves a high level onto a smaller mass while preserving the mean and the input moment; the noisy output moment then increases. Thus the least atom is selected before any optimization of the contrast. The main consequences are as follows.
(i) For $1 < q < 2$, the entire output -moment profile at a fixed input -moment is attained by (2). Consequently the sharp parameter in (1) is a maximum over the single interval , depending on only through $m
({xref}Theorems 4.3 and 5.1`). Every nonconstant scalar extremizer belongs to this family.
(ii) For every and every , the full operator norm of equals that on (Theorem 6.1). This proves Conjecture 1.2, and the sharp noise parameter is strictly increasing in (Corollary 6.2).
(iii) For every nonuniform , all product equality cases in (1) factor into scalar equality cases and constants (Theorem 5.3). For arbitrary , scalar extremizers are soft near , provided , and hard near . In the latter regime all product equality cases also factor (Theorems 7.4 and 7.5).
(iv) For the uniform binary law, Theorem 8.1 determines all scalar phases, with thresholds and , and classifies product equality throughout .
No choice among subset masses remains. The unresolved scalar question for general is the maximizing contrast , including its uniqueness and transition curve. Product equality for a uniform alphabet with at least three symbols is not classified here outside the hard regime.
Lagrange multipliers and a one-sided boundary variation reduce a constrained maximizer to two levels. The comparison of their masses has a strictly negative covariance as its derivative. This supplies the least-atom conclusion without requiring a phase analysis. For hypercontractivity it applies directly when the input exponent is at most two; self-adjoint duality covers the remaining exponents.
Related work and scope
The sharp Samorodnitsky parameter is the fixed-reference Rényi contraction coefficient of the resampling channel. This interpretation already appears for in [1 Thm. 3 and Rem. 20], whose Theorem 12 gives the scalar-to-product passage. Vandenbroucque, Esposito, and Gastpar extend that passage to arbitrary product channels [10 Thm. 10(a)]. The tensorization proof below is included to make the equality discussion self-contained. The scalar contribution is the fixed-moment comparison and its least-atom equality statement for .
At the KL endpoint, Gu and Polyanskiy already give the sharp coefficient and a one-variable description for the uniform Potts channel [7 Thm. 4 and Props. 17–18]. Positivity of KL extremizers for strictly positive reversible kernels follows more generally from [11 Lem. 31], and continuity in the Rényi order at one is known for arbitrary finite channels [10 Cor. 1]. The least-atom comparison extends the scalar entropy formula to nonuniform reference laws.
For hypercontractivity, the two-value method and the reduction to a range of two-point masses are due to Wolff [12 Thm. 3.1]. The extra comparison here selects its smallest mass and identifies the norm even outside the hypercontractive region. The operator is precisely ; the result makes no assertion about a different Fourier multiplier on a general cyclic group. The two-point constant is classical; see [12 Eq. (2.1)].
A fixed reference law must be distinguished from optimization over both laws in a divergence ratio. The binary-input reductions of Ordentlich and Polyanskiy [6 Thms. 1–2], and their Rényi counterparts [5 Thm. 1] and [10 Thm. 6], concern the latter problem. A two-valued density relative to a prescribed can still have full support on an arbitrarily large alphabet. General contraction theory is surveyed in [4]; related Rényi bounds appear in [3, 5, 10], and constrained-input divergence bounds motivated by privacy amplification in [8].
The threshold already occurs in the binary Rényi analysis of Song et al. [14 Lem. 2]. The Riccati representation and negative second derivative used below also appear in trureturing’s paper-level analysis of Cachin Rényi information combining [15]. These ingredients are credited there; the additional third-derivative sign yields a one-valley property and the complete noisy-ratio phase diagram. No formal verification claim about that external development is needed for the proof given here.
Notation and the scalar inequality
Write . All expectations and -norms without a displayed measure are taken with respect to , or to the appropriate product measure. For a function , set
The product operator is the tensor product of these one-coordinate operators. Equivalently, given , it retains each coordinate independently with probability and otherwise resamples that coordinate from , then averages the value of at the resulting point.
For , denotes the function of the coordinates in obtained by integrating all coordinates outside . We regard it as a function on , constant in the integrated coordinates; this convention leaves its -norm unchanged. The notation means that each coordinate belongs to independently with probability .
Theorem 1 of Abawonse, Hazła, and O’Donnell [1] treats . For it proves
with a sharp constant depending only on ; its nonconstant equality cases are precisely the indicators of atoms of mass . Theorem 12 of that paper supplies the induction from the scalar inequality to products, and Theorems 15 and 19 contain the precise product and scalar formulations, respectively. The fixed-reference Rényi formulation is made explicit in Theorem 3 and Remark 20.
The first item of [1 Sec. 1.4] isolates as an untreated direction. We retain the same operator, positivity assumption, and independent-subset formulation. For the variational characterization and tensorization, the standing regime is
Hypercontractive norms in § 6 use separate exponents , explicitly replacing the restriction .
A fixed-moment least-atom principle
The following comparison is formulated independently of noise. Its strictness will also identify the extremizers in the applications.
Theorem 3.1 (Least-atom moment comparison). Let be fully supported on a finite set with at least two points, and let . Suppose , , and is strictly increasing. For every with , there is a unique such that
For this ,
If , equality holds exactly for with a least atom, as in (2). If , then .
Proof. Write . On the compact mean-one simplex the strictly convex functional is minimized only by and maximized at a vertex. The vertex supported on an atom of mass has value
Strict convexity gives . Hence . The right-hand side of (6) has these endpoint values, and its derivative for is
This proves existence and uniqueness of . Strict convexity also shows that the upper endpoint is attained only at vertices of mass . It remains to consider .
First compare two-level variables without restricting their masses to subset masses of . Let the high value have mass , and the low value have mass , with
For a fixed this pair is unique whenever it exists. It exists exactly when . Thus a feasible pair at can be continued to every smaller positive mass, in particular down to when . For , put , , and . Differentiation of the two constraints gives
For , substitution yields
where has density on . The second identity uses and its analogue for . For independent copies , twice the covariance is
The strict sign follows because the ratio increases strictly and the density is positive. A pair with is an endpoint of this comparison path; continuity of and their first derivatives extends the strict comparison to that endpoint. In particular, decreasing the high-level mass strictly increases .
Now maximize subject to the prescribed mean and -moment. Compactness gives a maximizer. If all its positive coordinates are equal, it is a normalized subset indicator, and the two-level comparison just proved applies. Otherwise two positive coordinates are distinct. The gradients of the two constraints are then independent on the positive support. Lagrange multipliers give constants with
On , . Its sign can change at most once, from negative to positive. Thus a horizontal line meets in at most two positive points. Since two such points occur, has a strictly decreasing branch followed by a strictly increasing branch, and the level is strictly below .
There can be no zero coordinate. Indeed, activate a zero coordinate to a small positive value , and adjust two distinct positive coordinates to keep both constraints fixed. The implicit function theorem applies because their constraint Jacobian has nonzero determinant. The one-sided objective derivative is ; maximality requires it to be nonpositive, contradicting . The maximizer is therefore positive and two-valued.
In either case the mass of its high level is a sum of atom masses, so . If , moving to the two-level profile of mass with the same constraints strictly increases the objective. This is a feasible function on , supported at its high level on any least atom, and contradicts maximality. Hence , which consists of one atom. The constraint determines its contrast to be . This proves both the inequality and its equality cases.
The one-coordinate coefficient
Definition 4.1 (The scalar ratio). Let
For nonconstant , put
At the constant density , define , the continuous quadratic perturbation value. Finally set
Lemma 4.2 (Existence and nonlocality). For and , the maximum in Definition 4.1 exists and satisfies . If , then . More generally, the latter conclusion holds whenever has a subset of mass strictly below .
Proof. Since is fully supported, for every . Hence is compact. If , , and , Taylor expansion gives
and the same formula with replaced by for the numerator. Thus as , so the definition at makes continuous on . Compactness gives existence.
For nonconstant , Jensen gives . Since , the function is also nonconstant and has mean one, so strict Jensen gives . Also
and strict convexity of gives
Thus , and .
Assume that has mass , and put
Then , , and . For small , lies in . Writing , expansion gives
Therefore
Since , , and , the coefficient of is positive. Thus for all sufficiently small positive .
Theorem 4.3 (Sharp moment profile and scalar parameter). Let , , and . Define
If and , then
For , equality holds exactly when for a least atom . In particular,
where the ratio at zero is .
Proof. Apply Theorem 3.1 with and . Its decisive hypothesis is
which is strictly increasing for . The function is taken by to , giving (10) and its equality statement. Every mean-one density has a unique input moment parameter , while every is attained by . Dividing logarithms proves (11), with the value at zero supplied by Lemma 4.2.
Corollary 4.4 (Scalar extremizers). Every nonconstant scalar equality case, normalized to mean one, is , where is a least atom and maximizes (11). Thus its high value occurs on one least atom and its low value is common to all other atoms. Constants are always scalar equality cases, whether or not the ratio at zero is maximal.
Proof. At a fixed nonconstant input moment the denominator of the scalar ratio is fixed and positive. A scalar equality case must therefore attain the sharp output moment in (10). Conversely each maximizing profile attains the ratio. The constant equality follows directly from .
Sharp product tensorization
The scalar-to-product passage itself is already contained in the general induction theorem of Abawonse, Hązła, and O’Donnell [1 Theorem 12]. In their notation, take the target exponent , set and , use deterministic resampling parameters on the left, and independent Bernoulli inclusion variables on the right. The direct Hölder proof below is retained for self-containedness; the new input is the exact scalar coefficient and its extremizers.
For probability measures , the order- Rényi divergence is
For a channel and a fixed reference input law , define the fixed-reference coefficient
The channel-level coefficient
also optimizes the reference law. Throughout this paper the reference law remains . General properties and bounds for these two coefficients are discussed in [3, 5, 10]; their distinction is explained in the introduction. For the kernel below, stationarity gives , and the density of is when .
Theorem 5.1 (Sharp product inequality). Let , , and . The product inequality
holds for every and every nonzero nonnegative if and only if
where is given by Theorem 4.3. Equivalently, is the fixed-reference order- Rényi contraction coefficient of the one-coordinate channel
Proof. The one-coordinate inequality is
for all nonzero . By homogeneity, with , this is equivalent to
for all . Hence it holds if and only if . If , then , , and the same quotient is
If , the asserted product inequality is simply the -contraction . We may therefore assume . It remains to prove that the one-coordinate inequality tensorizes. Let be another finite probability space and let . Write
For , put , and ignore zero fibers. Then and
If , the scalar inequality gives
Hölder’s inequality, in the form
gives
But and . Taking logarithms and dividing by ,
The induction uses the following auxiliary-space statement. For every finite probability space and every nonnegative ,
where integrates the -coordinates outside and retains the auxiliary variable. The case is equality, and the one-coordinate estimate above proves the induction step with all unprocessed coordinates and carried as the auxiliary space.
Indeed, if the last coordinate is handled after the first , the induction gives
where includes each coordinate independently with probability . This is exactly the expectation over . Necessity follows from .
Lemma 5.2 (Equality in one tensorization step). Let , let be finite and fully supported, and let be nonzero. Put , and for put
Equality holds in
if and only if both of the following conditions hold:
(a) every positive normalized fiber is a scalar equality case;
(b) is constant on .
If one positive fiber is constant, then all positive fibers are constant.
Proof. Write . The two inequalities in the one-step proof are
All summands in the difference in (16) are nonnegative, and precisely on the positive fibers. Equality therefore holds there exactly when for every positive fiber, which is condition (a).
For (17), Hölder is applied to and with exponents and . Since , its equality condition is that and be proportional on their common positive support. This is exactly the constancy of , condition (b). Both intermediate inequalities must be equalities if and only if the final one-step estimate is an equality.
Finally, a constant mean-one fiber has . Condition (b) then gives on every positive fiber; strict convexity of and force every such to be constant.
Theorem 5.3 (Product equality for nonuniform laws). Suppose is nonuniform. For every and , the nonzero equality cases in the sharp product inequality are precisely
where each is either or a mean-one scalar extremizer from Corollary 4.4. Uniqueness of the maximizing contrast in (11) is not required.
Proof. Fix one coordinate , write the others as , and let be product noise on . Two orders of tensorization show that equality forces the one-step equality of Lemma 5.2 both for and for . To see the first assertion, apply (14) in the -coordinates to , with as auxiliary space, and then apply the -step to every conditional expectation in the resulting average. The term retaining all -coordinates has weight and contains the -step on raw . For the second assertion, apply the -step first to , and then tensorize the two resulting terms in . Both chains end at the same sharp product bound. Every gap is nonnegative and , so equality forces the stated steps.
Put . If one positive normalized raw fiber is constant, Lemma 5.2 makes them all constant, and . Otherwise all positive raw fibers are nonconstant scalar extremizers with a common -moment. Since is strictly increasing on , they have a common contrast . Thus
where each is a least atom. A nonuniform law has an atom with . At that atom,
The kernel of is strictly positive and , so . Every normalized fiber is a scalar equality case. Its value at is , excluding a constant fiber; as cannot be its peak, this value also forces its contrast to be exactly .
Each normalized fiber is a convex combination of the nonzero raw normalized fibers, with strictly positive weights
A mixture of the vectors can itself equal such a vector with the same only when every peak label is the same. Indeed, after subtracting and multiplying by , a convex combination of point indicators is a point indicator only in that case. Hence .
Both sides of the product inequality add under products. The factor is a scalar equality case, so equality for is equivalent to equality for in one fewer coordinate. Induction proves necessity, and the same factorization verifies the converse.
Hypercontractive norms
This section allows arbitrary . The operator remains , and denotes the two-point probability law.
Theorem 6.1 (Exact least-atom norm identity). For every finite full-support law with at least two atoms, , , and ,
For , every nonconstant nonnegative norm extremizer, normalized to mean one, is for a least atom and some . In particular, with defined by (9) for any ,
The identity holds for real or complex operator norms.
Proof. Assume first and . Positivity gives , so nonnegative functions suffice even for the complex norm. Normalize a nonzero such function to . In Theorem 3.1, use the functions and . Their derivative ratio is positive, and
The theorem replaces by with the same -moment and no smaller noisy -moment. Its norm ratio is that of a function on , proving the upper bound in (18). Conversely every function on embeds into by using one least atom and its complement; this embedding preserves the two norms and commutes with . It gives the reverse bound. Strictness in the moment comparison also gives the asserted two-level shape of every nonconstant nonnegative extremizer in this range.
If , let and . Self-adjointness for the pairing and finite-dimensional duality give
Here , so the case just proved applies, first on and then on , proving (18). To transfer the extremizer statement, normalize by and take . Then and
Every inequality is an equality. Thus is a dual extremizer and Hölder equality gives proportional to . If is nonconstant, then is nonconstant, since is invertible. The dual result makes , and hence , two-valued with its high level on one least atom.
Every nonconstant nonnegative norm extremizer is strictly positive. If , replacing it by changes by . The strictly positive kernel gives , and the corresponding change in has strictly positive first derivative. This would increase the norm ratio, a contradiction. Therefore its contrast is less than one. Constants and the preceding extremizer classification prove (19). Finally, all norms in question are continuous in , which includes .
Corollary 6.2 (Sharp boundary and its dependence on the least atom). For every ,
The function is strictly increasing on . Thus Conjecture 1.2 holds.
Proof. The identity follows immediately from (18). For strict monotonicity, duality reduces the proof to . Fix , put on , and set . Then and . Taylor expansion at the constant function gives
At , the quadratic term vanishes, while the cubic bracket is
For its positivity follows from ; for , . A small positive therefore violates hypercontractivity at , and continuity gives .
There is a nonconstant critical extremizer at . Here are the required compactness details. Normalize nonnegative inputs to mean one, forming a compact interval. For sufficiently small , the strictly negative quadratic term in (20) handles a neighborhood of the constant, uniformly in the two signs of . On the compact complement, , and continuity preserves this strict inequality for small . Hence . The admissible noise parameters form a closed interval: if , then and the first factor is an -contraction. Choose violating maximizers at . A subsequence converges to an input attaining norm ratio one at . Since , the quadratic term is uniformly negative near the constant and near ; the violating maximizers cannot approach the constant. Their limit is therefore nonconstant.
Now take and a nonconstant critical extremizer for . By Theorem 6.1 its high level has mass . Decrease that mass to while preserving its mean and -moment. The strict comparison in the proof of Theorem 3.1, with and , increases the noisy -moment. Thus the norm on already exceeds one at ; by continuity it does so slightly earlier. This proves . At , the classical value is [12 Eq. (2.1)], and the strict inequality for biased laws was proved above. Duality completes the proof.
Endpoint regimes
The soft-dictator regime
For a mean-one density , define
and
with . Let and set
with the constant density assigned the limiting value . This is the ordinary KL strong data-processing coefficient for the resampling kernel; see Polyanskiy and Wu [4] for general background on KL contraction coefficients. For uniform , this kernel is the Potts semigroup, and Gu and Polyanskiy [7 Thm. 4 and Props. 17–18] already obtained an exact one-variable formula and the corresponding one-coordinate entropy extremizers. Proposition 7.3 extends that endpoint description to general fully supported laws having a subset of mass below , in particular to every nonbinary law. Continuity of the coefficient itself at follows from the more general result [10 Cor. 1]. Positivity of KL maximizers for this strictly positive reversible kernel is also a special case of [11 Lem. 31]. The direct arguments below additionally control the ratios uniformly and use the two-level classification to obtain persistence of interior extremizers in Theorem 7.4.
Lemma 7.1 (Uniform KL limit). As , uniformly on , where
Consequently , and every subsequential limit of -maximizers is a KL maximizer.
Proof. Let . Uniformly for ,
so uniformly on ; the same holds for .
Ratios near constants require a separate argument. Fix . If , , and , Taylor’s formula with a remainder bounded on the finite coordinate range gives, uniformly for ,
The same expansion at follows from . Thus and , with constants independent of .
For the complementary region, put
It is compact and contains no constant density, so . Uniform convergence of and to their KL limits implies that, for close enough to , throughout . Division is therefore uniform there, and
Given an error tolerance, first choose so that the two quadratic-region errors are smaller than half that tolerance, and then choose close enough to for the compact-complement error. This proves uniform convergence on all of . Uniform convergence on the compact set gives convergence of maxima and the usual compactness statement for maximizers.
Lemma 7.2 (KL maximizers are soft). Assume that has a subset of mass strictly below $1/2. Then , and every nonconstant KL maximizer is strictly positive and takes exactly two values.
Proof. The perturbation from Lemma 4.2, with entropy in place of , gives . Indeed,
and the numerator has replaced by , so the quotient is
for small positive .
Let maximize the KL ratio and put . Then
is at most 0 on and equals 0 at . Suppose . Choose with . For sufficiently small , define the weighted mass transfer
Then and . At the newly positive coordinate,
while the change at coordinate is . Consequently . Since coordinatewise and , differentiability of on this positive range gives . Hence
for small , a contradiction. Thus .
The Lagrange equation on the relative interior says that
for each value . The derivative has sign determined by
which is a strictly increasing function of . Therefore the left side first decreases and then possibly increases, so a horizontal line has at most two positive intersections. Since is not constant, it has exactly two positive values.
Proposition 7.3
Proposition 7.3 (Least-atom KL formula). For , define
Then
with value at zero. If , every nonconstant KL extremizer is for a least atom and some .
Proof. For a fixed density , choose such that . Uniformly on ,
The function is strictly increasing from to . Compactness and the preceding limit therefore imply that , where . Subtracting one from (10), dividing by , and taking the limit yields . Every is attained by , proving (21).
For , Lemma 7.2 makes every nonconstant KL extremizer positive and two-valued. Apply the fixed-moment comparison from the proof of Theorem 3.1 with and . The high-mass comparison path stays strictly positive when its starting low value is positive, so differentiability at zero is not needed. On that path,
is strictly increasing. Reducing any high-level mass larger than would strictly improve its output entropy at fixed input entropy. Thus its high level has mass , and positivity gives .
Theorem 7.4 (Uniform soft dictators near ). If has a subset of mass strictly below , then there are and such that, for every , every one-coordinate maximizer of satisfies
Consequently every nonconstant one-coordinate maximizer in this range is a strictly positive two-level soft dictator.
Proof. Let be the compact set of KL maximizers. By Lemma 7.2, every element of is strictly positive, so
If a sequence had maximizers staying at sup-norm distance at least from , compactness would give a subsequence converging to a KL maximizer by Lemma 7.1, a contradiction. Thus all maximizers for close enough to lie within of , and are bounded below by . Corollary 4.4 then rules out subset indicators and gives the two-level soft form.
The least-atom regime
Theorem 7.5 (Least-atom dictators near ). Let . There is such that, for every ,
In this interval the only nonconstant one-coordinate maximizers are
Moreover, equality in the sharp product inequality on holds exactly for functions
where , , and each is a least atom.
Proof. At ,
For , the function is strictly increasing on : after differentiating, the numerator has sign equal to
whose derivative is . Thus maximizing is the same as maximizing variance in .
If , then , so . If , then , hence . Equality in forces to be zero off a set of total mass and constant on that set. Since every atom has mass at least , this set is a single least atom. Therefore the only nonconstant maximizers are the normalized least-atom indicators.
For persistence, write
Taylor expansion at zero shows that is jointly continuous in on for any . Its derivative in is jointly continuous on for every : the powers have continuous first derivatives there, including at . At ,
The strict monotonicity proved above gives for . Choose . Its derivative has a positive minimum on , which stays positive for sufficiently close to two. On the compact complement , the value of is separated from by a positive gap. Uniform continuity preserves that gap for nearby . Hence the unique maximizing contrast remains . Theorem 4.3 and its strict equality statement give the claimed scalar formula and classification. Notice that this argument depends on only through .
It remains to classify product equality cases. The induction assertion is: for every , every nonzero equality case on is a positive constant times a product of normalized least-atom indicators on a subset of the coordinates. The case is the scalar classification just proved. Assume the assertion through dimension . Write points of as , put , and set . The induction proof of Theorem 5.1 factors as
where is sampled with inclusion probability . The last line is the desired right-hand side. Every gap is nonnegative; therefore equality for forces equality in the first one-step estimate.
For a last-coordinate slice , the kernel of is strictly positive. Thus is positive everywhere if , and is identically zero otherwise. Since , for every . Lemma 5.2, applied to the normalized fibers , now says that each is either constant or a normalized least-atom indicator, and that all their -moments coincide. The two possible moments are respectively and , so all fibers have the same type.
Suppose first that all fibers are constant. Then is independent of , so for every . The operator is invertible: a one-coordinate acts as the identity on constants and as multiplication by on the mean-zero subspace, and is a tensor product of these operators. Hence all slices are equal, and . For such a function, both sides of the product inequality are exactly their -dimensional counterparts for . The induction hypothesis gives the asserted product form with coordinate inactive.
Suppose instead that all fibers are least-atom indicators. Let . Strict positivity of shows that the support of is exactly , independently of . Each normalized fiber is supported on one point, so for a least atom . With and , one has
Independence of coordinates gives
whereas the conditional-expectation side equals
The scalar equality therefore shows that equality for is equivalent to equality for . The induction hypothesis adds the last active factor and proves necessity.
Conversely, for every function in the displayed family, the product noise, the -norm, and the conditional expectations factor coordinatewise. Each active factor is a scalar equality case and every inactive factor is constant, so equality follows.
Example 7.6. (Uniform three-point space). Let with the uniform measure and let . As , a singleton indicator has limiting KL ratio
and the two-point indicator has limiting ratio
The local constant perturbation value is , and the asymmetric cubic perturbation from Lemma 4.2 improves strictly above . Hence, for all sufficiently close to , no subset indicator is extremal on the uniform three-point space. The optimizer is a strictly positive two-level soft dictator. By Theorem 7.5, for sufficiently close to , the optimizer is instead a singleton indicator. Thus the optimizer type genuinely changes inside .
For a concrete numerical illustration, maximizing the single one-variable objective in Theorem 4.3 at gives
up to permutation of the coordinates. The corresponding KL endpoint from Proposition 7.3 is . These decimal values are not used in any proof; they display the soft, non-indicator optimizer well inside the simplex.
The uniform binary phase diagram
The least-atom reduction leaves one scalar contrast to optimize. For , its full behavior can be described. Put
and define the elasticity , with . The following theorem is about the ratio ; the first threshold and the Riccati ingredients have the precedents discussed in the introduction.
Theorem 8.1 (Uniform binary phases). Let , , and set
The scalar optimization in (11) has these three regimes.
(i) If , then is strictly decreasing on . Hence , and the only nonzero scalar equality cases are constants.
(ii) If , then has a unique maximizer for every .
(iii) If , there is a unique such that the unique maximizer is for , and for .
For , the elasticity has exactly one minimum, at some . In case (iii), the critical value is the unique satisfying
In all cases every nonzero product equality case factors into scalar equality cases and constants. In case (i) it is constant.
Proof. Write . We first establish the needed shape of . The auxiliary function
is analytic at zero. Differentiating gives the Riccati equation
Its first three nonconstant Taylor coefficients are
For instance, substitution in (23) gives for . Thus .
For , one has : setting , the inequality follows from . Successive derivatives of (23) give
At a first zero of , equation (24) would give , contrary to its nonnegative derivative at that zero. Therefore . Equation (25) excludes a first zero of in the same way, giving . This is the negative-curvature argument in [15]. The next identity, (26), excludes a first zero of , since . Consequently
Let . The substitution yields
Using , this gives
In particular , , , and . Concavity implies . Define
Direct differentiation gives
The strict sign uses and (27).
If , then , so on . If , then . In this case crosses zero: indeed as . To verify the limit directly, put and . Then
Since , its derivative has a unique zero , where . Equation (29) shows that crosses zero exactly once.
By (28),
It follows that is strictly increasing if , and strictly decreasing then strictly increasing if . Also and at one. The latter follows from and .
The same shape transfers to . Since ,
If is increasing, its average is smaller than its endpoint value, so is strictly increasing. In the one-valley case, on the decreasing branch of . On its increasing branch, the function satisfies . It starts negative and tends to at one, because and . Hence it crosses zero exactly once. Formula (30) proves that has one strict minimum . Direct endpoint evaluation gives
For , logarithmic differentiation gives
If is increasing this is negative, proving case (i). Otherwise the difference is positive when , negative when , and strictly decreasing on the intermediate region . It has at most one zero, changing only from positive to negative. Therefore the unique maximum is at exactly when , and is interior otherwise. If , then , and the one-valley shape gives for every . If , then , so the decreasing branch crosses exactly once, at the value specified in (22). The increasing branch is below until its endpoint. Thus holds exactly for , proving (ii)–(iii), including uniqueness at the transition.
Finally consider equality on products. As in the two tensorization orders used in Theorem 5.3, both the raw fibers in a coordinate and the fibers after fully noising all other coordinates satisfy Lemma 5.2. In case (i), all raw fibers are constant in every coordinate, so is constant. For , if a coordinate has nonconstant raw fibers, all its positive normalized raw fibers have the unique contrast . The fully mixed fibers are either all constant or all nonconstant by their common moment. They cannot all be constant: invertibility of the other-coordinate noise would then make the raw function independent of the selected coordinate. Thus the mixed fibers also have contrast . Every mixed normalized fiber is a strictly positive convex combination of all positive raw normalized fibers. Its -moment equals their common value . Strict convexity of the -moment forces all of those raw fibers to coincide. One scalar factor therefore splits off. Induction, with coordinatewise additivity of both sides, proves necessity and sufficiency of the product form.
Concluding remarks
The least-atom principle removes the alphabet and all other atom masses from both sharp constants. For the Rényi ratio, the remaining question is scalar: for general , which contrast maximizes , and is it unique? Explicit transition curves would quantify the soft and hard regimes. The nonuniform product equality proof uses an atom larger than the minimum. The uniform binary case is settled by its unique contrast in Theorem 8.1. For uniform alphabets of size at least three, an additional scalar rigidity argument is needed outside the hard regime; the fixed-moment theorem alone does not supply it.
References
- [1]O. S. Abawonse, J. Hazła, and R. O’Donnell. Generalized Samorodnitsky noisy function inequalities, with applications to error-correcting codes. In Proceedings of the 58th Annual ACM Symposium on Theory of Computing (STOC 2026), pages 342–353, 2026; full version arXiv:2508.06940v1. doi:10.1145/3798129.3800754.DOI
- [2]A. Samorodnitsky. An upper bound on ℓ_q norms of noisy functions. IEEE Transactions on Information Theory 66(2):742–748, 2020. doi:10.1109/TIT.2019.2944698; arXiv:1809.09696.DOI
- [3]L. Jin, A. R. Esposito, and M. Gastpar. Properties of the strong data processing constant for Rényi divergence. In 2024 IEEE International Symposium on Information Theory (ISIT), pages 3178–3183, 2024; arXiv:2403.10656v2. doi:10.1109/ISIT57864.2024.10619367.DOI
- [4]Y. Polyanskiy and Y. Wu. Strong data-processing inequalities for channels and Bayesian networks. In Convexity and Concentration, pages 211–249. Springer, 2017; arXiv:1508.06025. doi:10.1007/978-1-4939-7005-6_7.DOI
- [5]A. Vandenbroucque, A. R. Esposito, and M. Gastpar. Contraction of Rényi divergences for discrete channels: Properties and applications. arXiv:2601.09328v1, 2026.arxiv.org/abs/2601.09328
- [6]O. Ordentlich and Y. Polyanskiy. Strong data processing constant is achieved by binary inputs. IEEE Transactions on Information Theory 68(3):1480–1481, 2022. doi:10.1109/TIT.2021.3130189; arXiv:2010.01987.DOI
- [7]Y. Gu and Y. Polyanskiy. Non-linear log-Sobolev inequalities for the Potts semigroup and applications to reconstruction problems. Communications in Mathematical Physics 404:769–831, 2023. doi:10.1007/s00220-023-04851-1; arXiv:2005.05444.DOI
- [8]L. Grosse, S. Saeidian, T. J. Oechtering, and M. Skoglund. Bounds on the privacy amplification of arbitrary channels via the contraction of fα-divergence. In 61st Allerton Conference on Communication, Control, and Computing, 2025. Conference paper; arXiv:2501.11473v4.arxiv.org/abs/2501.11473
- [9]A. Samorodnitsky. An improved bound on ℓ_q norms of noisy functions. arXiv:2010.02721v1, 2020.arxiv.org/abs/2010.02721
- [10]A. Vandenbroucque, A. R. Esposito, and M. Gastpar. Contraction of Rényi divergences for discrete channels. arXiv:2609.34570v1, September 2026.arxiv.org/abs/2609.34570
- [11]P. Caputo, Z. Chen, Y. Gu, and Y. Polyanskiy. Entropy contractions in Markov chains: Half-step, full-step and continuous-time. arXiv:2409.07689v1, 2024. Lemma numbering refers to this version.arxiv.org/abs/2409.07689
- [12]P. Wolff. Hypercontractivity of simple random variables. Studia Mathematica 180(3):219–236, 2007. doi:10.4064/sm180-3-3.DOI
- [13]J. Cao, S. Fan, Y. Han, Y. Qiu, and Z. Wang. The optimal hypercontractive constants for Z₃ and biased Bernoulli random variables. arXiv:2602.17248v2, March 2026.arxiv.org/abs/2602.17248
- [14]W. Song, J. Zhou, M. Yang, J.-L. Zhao, D.-C. Li, L.-H. Zhang, and Z.-L. Cao. Polygamy relation for the Rényi-α entanglement of assistance in multi-qubit systems. arXiv:1703.02858v2, 2017.DOI
- [15]trureturning. Cachin Rényi information combining convexity and concavity. Research note, accessed November 2, 2026. Research page; the cited Riccati and exact-threshold discussion is a paper proof, distinct from the page’s formalized witness range.