Next Article in Journal
A Pedagogical Reinforcement of the Ideal (Hard Sphere) Gas Using a Lattice Model: From Quantized Volume to Mechanical Equilibrium
Previous Article in Journal
Entropy of a Quasi-de Sitter Spacetime and the Role of Specific Heat
Previous Article in Special Issue
Entropic Dynamics Approach to Quantum Electrodynamics
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Generalized Legendre Transforms Have Roots in Information Geometry †

Sony Computer Science Laboratories, 3-14-13 Higashi Gotanda, Shinagawa Ku, Tokyo 141-0022, Japan
This paper is dedicated to Professor Shun-ichi Amari in honor of his 90th birthday.
Entropy 2026, 28(1), 44; https://doi.org/10.3390/e28010044 (registering DOI)
Submission received: 5 December 2025 / Revised: 28 December 2025 / Accepted: 28 December 2025 / Published: 30 December 2025

Abstract

Artstein-Avidan and Milman [Annals of mathematics (2009), (169):661–674] characterized invertible reverse-ordering transforms in the space of lower, semi-continuous, extended, real-valued convex functions as affine deformations of the ordinary Legendre transform. In this work, we first prove that all those generalized Legendre transforms of functions correspond to the ordinary Legendre transform of dually corresponding affine-deformed functions. In short, generalized convex conjugates are ordinary convex conjugates of dually affine-deformed functions. Second, we explain how these generalized Legendre transforms can be derived from the dual Hessian structures of information geometry.

1. Introduction

Let R denote the field of real numbers and R ¯ = R { ± } be the extended real line. A m-variate extended function F : R m R ¯ is proper when its efficient domain Θ = dom ( F ) : = { θ : F ( θ ) < + } is non-empty and lower semi-continuous (lsc.) when its epigraph epi ( F ) : = { ( θ , y ) : y F ( θ ) , θ dom ( F ) } is closed with respect to the metric topology of R m . We denote by Γ 0 (shorcut for Γ 0 ( R m ) ) the space of of proper, lower, semi-continuous, extended, real-valued convex functions.
Consider the Legendre–Fenchel transform [1] (LFT) L F of a function F:
( L F ) ( η ) : = sup θ R m θ , η F ( θ ) ,
where v , v : = i = 1 m v i v i denotes the Euclidean inner product. The function F * = L F is called the convex conjugate function. Some examples of convex conjugates are reported in Appendix B.
The Legendre transform originated in the work of Adrien-Marie Legendre [2] circa 1805. Legendre considered variational calculus problems and introduced the variable transform. The Legendre transform was later formalized by Hamilton [3] and Gibbs [4] as a way to switch between equivalent descriptions of a system by exchanging variables like position ↔ momentum or energy ↔ entropy. This variable duality principle induced by the Legendre transform turned out to be fundamental in many scientific fields, like thermodynamics [5] for relating thermodynamic potentials, quantum field theory [6] for connecting Lagrangian and Hamiltonian formulations (and underlying effective actions), economics for relating expenditure with utility functions [7], and convex optimization [8], where it is the cornerstone of duality theory in convex analysis.
The Moreau–Fenchel–Rockafellar theorem [9] states that when a function F Γ 0 , its biconjugate function ( F * ) * coincides with the function F: F * * = F . That is, the Legendre transform is an involutive transform of Γ 0 . For general lsc. functions F (possibly non-convex), it is known that the biconjugate function ( F * ) * : = L ( L F ) lower bounds the function F by the largest possible lsc. convex function ( F * ) * F . This lower bound convexification property has been proven useful in machine learning [10].
This study was motivated by the fundamental result of Artstein-Avidan and Milman [11,12], who proved the following theorem:
Theorem 1 
([12], Theorem 7). Let T be an invertible transform such that the following are true:
  • F 1 F 2 T F 2 T F 1 ;
  • T F 1 T F 2 F 2 F 1 .
Then, T is a generalized Legendre–Fenchel transform (GLFT), written canonically as
( T F ) ( η ) = λ ( L F ) ( E η + f ) + η , g + h ,
where λ > 0 , E GL ( R m ) (general linear group), f , g R m , and h R .
We note in passing that Fenchel [13,14] interpreted the graph of the Legendre transform of an m-variate function F Γ 0 as the polarity with respect to the paraboloid surface of R m + 1
P = θ , y = 1 2 i = 1 m θ i 2 : θ R m R m + 1 ,
of the graph of F. This geometric polarity connection of the Legendre transform is all the more interesting since Böröczky and Schneider [15] characterized the duality of convex bodies in Euclidean spaces containing the origin in the interior into the same space [11].
In this work, we shall first prove that a generalized convex conjugate T F obtained by Equation (2) can always be expressed as the ordinary convex conjugate of a corresponding affine-deformed function. Namely, we shall show that
( T F ) ( η ) = L λ F ( A θ + b ) + θ , c + d ) ,
where A GL ( R m ) , b , c R m and d R are defined according to E , f , g , h (details reported in Theorem 2). This equivalence result allows us to interpret the origin of the generalized Legendre transforms from the viewpoint of information geometry [16,17] and untangle the various degrees of freedom used when defining generalized Legendre transforms in Section 3.

2. Generalized Legendre Transforms as Ordinary Legendre Transforms

Consider a parameter
P = ( λ , A , b , c , d ) P : = R > 0 × GL ( R m ) × R m × R m × R ,
and deform a function F ( θ ) by carrying out affine transformations of both the parameter argument and its output as follows:
F P ( θ ) : = λ F ( A θ + b ) + θ , c + d .
Those affine deformations preserve convexity:
Property 1 
(Convexity-preserving affine deformations). Let F Γ 0 . Then, F P belongs to Γ 0 for all P P .
Proof. 
Let us check the convexity of F P :
α F P ( θ 1 ) + ( 1 α ) F P ( θ 2 ) = λ ( α F ( θ ¯ 1 ) + ( 1 α ) F ( θ ¯ 2 ) ) + α θ 1 + ( 1 α ) θ 2 ) , c + d ,
where θ ¯ 1 : = A θ 1 + b and θ ¯ 2 : = A θ 2 + b . Since F is convex, we have α F ( θ ¯ 1 ) + ( 1 α ) F ( θ ¯ 2 ) F ( α θ ¯ 1 + ( 1 α ) θ ¯ 2 ) . Let θ ¯ α : = α θ ¯ 1 + ( 1 α ) θ ¯ 2 = A θ ¯ α + b with θ α : = α θ 1 + ( 1 α ) θ 2 . We obtain
α F P ( θ 1 ) + ( 1 α ) F P ( θ 2 ) λ F ( A θ ¯ α + b ) + θ α , c + d = F P ( α θ 1 + ( 1 α ) θ 2 ) ,
hence proving that F P is convex. Since the lower semi-continuous property is ensured (i.e., the epigraph of F P is closed), we conclude that F P Γ 0 . □
Next, let us express the convex conjugate of a function F P according to the ordinary convex conjugate F * = L F :
Proposition 1 
(LFT of an affine-deformed function). The Legendre transform of F P with P = ( λ , A , b , c , d ) P is
( F P ) * = ( F * ) P
where
P : = λ , 1 λ A 1 , 1 λ A 1 c , A 1 b , b , A 1 c d P .
That is, we have L ( F P ) = ( L F ) P .
Proof. 
Let Γ 1 Γ 0 be defined as the class of differentiable, strictly convex Legendre-type functions [18] (see Appendix A). In general, given a function F ( θ ) Γ 1 , we proceed as follows to calculate its convex conjugate. First, we find the inverse function ( F ) 1 of its gradient F to obtain the gradient of the convex conjugate F * = ( F ) 1 . Then, we have
F * ( η ) = θ , η F ( θ ) = ( F ) 1 ( η ) , η F ( ( F ) 1 ( η ) ) .
For parameter P = ( λ , A , b , c , d ) , consider the strictly convex and differentiable function F P ( θ ) = λ F ( A θ + b ) + c , θ + d for an invertible matrix A GL ( d , R ) , vectors b , c R d , and scalars d R and λ R > 0 . The gradient of F P is
η = F P ( θ ) = λ A F ( A θ + b ) + c .
We denote by G = F * and G P = ( F P ) * the Legendre convex conjugates of F and F P , respectively. By solving the equation F P ( θ ) = η , we find the reciprocal gradient θ ( η ) = G P ( η ) :
G P ( η ) = A 1 G 1 λ A ( η c ) b .
Therefore, the Legendre convex conjugate is obtained as follows:
G P ( η ) = η , G P ( η ) F P ( G P ( η ) ) , = λ G ( A η + b ) + c , η + d ,
where
λ = λ , A = 1 λ A 1 , b = 1 λ A 1 c , c = A 1 b , d = b , A 1 c d .
Hence, it follows that we have P = λ , 1 λ A 1 , 1 λ A 1 c , A 1 b , b , A 1 c d P .
Let us check that the (diamond) ⋄ operator on affine deformation parameters is an involution:
Proposition 2 
(⋄ involution). The parameter transformation P is an involution, where ( P ) = P .
Proof. 
Let P = ( λ , A , b , c , d ) and P = ( λ , A , b , c , d ) with
λ = λ , A = 1 λ A 1 , b = 1 λ A 1 c , c = A 1 b , d = b , A 1 c d .
We check that P = ( λ , A , b , c , d ) = ( λ , A , b , c , d ) = P component-wise as follows:
λ = λ = λ , A = 1 λ A 1 = 1 λ 1 λ A 1 1 = A , b = 1 λ A 1 c = 1 λ 1 λ A 1 1 ( A 1 b ) = b , c = A 1 b = 1 λ A 1 1 1 λ A 1 c = c , d = b , A 1 c d = 1 λ A 1 c , 1 λ 1 λ A 1 1 ( A 1 b ) b , A 1 c + d = d .
The ⋄ involution confirms that the Legendre–Fenchel transform is an involution:
( ( F P ) * ) * = L ( L F P ) = L F P = F ( P ) = F P .
Let us now define the following notation to express the generalized Legendre convex conjugates:
Definition 1 
(Generalized Legendre–Fenchel convex conjugates [12]). Let L λ , E , f , g , h denote a generalized Legendre–Fenchel transform
L λ , E , f , g , h F : = L P F : = λ ( L F ) ( E η + f ) + η , g + h
for the parameter P = ( λ , E , f , g , h ) P .
Our result is that we can interpret those generalized Legendre–Fenchel transforms of Equation (2) as the ordinary Legendre transform on corresponding affine-deformed convex functions:
Theorem 2. 
For any F Γ 0 , we have L P ( F ) : = ( F * ) P = L F P .
Proof. 
By definition, L P F : = ( L F ) P . Since P = ( P ) (Proposition 2), we have ( L F ) P = ( L F ) ( P ) , and by using Proposition 1, we obtain ( L F ) ( P ) = L ( F P ) . To summarize, we have
L P ( F ) = ( L F ) P = ( L F ) ( P ) = L F P .
That is, in plain words, the Artstein-Avidan–Milman generalized Legendre transforms [11,12] are ordinary Legendre transforms on affine-deformed functions evaluated on affine deformed arguments.
Next, we describe an information-geometric interpretation of Theorem 2 which casts light on the origin and meanings of the degrees of freedom used to define generalized Legendre transforms. Thus, understanding the ordinary Legendre transform from the information-geometric viewpoint allows one to understand how to recover the generalized Legendre transforms formalized axiomatically by Artstein-Avidan–Milman [11,12].

3. An Information-Geometric Interpretation of Generalized Legendre Transforms

We can interpret the fact that generalized Legendre convex conjugates are affine-deformed convex conjugates from the lens of information geometry [16]. Consider a smooth, strictly convex function F : R m R ¯ of the space Γ 2 of twice-differentiable lsc. Legendre-type convex functions (with Γ 2 Γ 1 Γ 0 ). This function F ( θ ) defines a dually flat m-dimensional space [16] ( M , g , , * ) which is a global chart manifold M = { p } of points p equipped with dual Hessian structures [19] ( g , ) and ( g , * ) . The primal Hessian structure is induced by a potential function ψ on M with a torsion-free, flat, affine connection ∇ such that ψ ( p ) = F ( θ ( p ) ) , where ( M , θ ( · ) ) is the primal ∇-affine coordinate system. The dual Hessian structure is induced by a dual potential function ϕ on M with a dual torsion-free, flat, affine connection * such that ϕ ( p ) = F * ( η ( p ) ) , where ( M , η ( · ) ) is the dual * -affine coordinate system. The Riemannian metric g can be expressed in the dual coordinate charts as g ( θ ) = 2 F ( θ ) or g ( η ) = 2 F * ( η ) , where F * is the convex conjugate. These two potential functions ψ and ϕ living on the manifold M satisfy the Fenchel–Young inequality:
ψ ( θ ( p ) ) + ϕ ( η ( q ) ) i = 1 m θ i ( p ) η i ( q ) ,
with equality if and only if p = q on M. The metric tensor g can be expressed as g = d ψ or equivalently as g = * d ϕ , where d denotes the exterior derivative and ψ and ϕ are 0 forms.
Now, the ∇-affine coordinate system θ is defined up to an affine transformation. That is, if θ ( · ) is a ∇ coordinate system, then the coordinate system is θ ¯ ( · ) = A θ ( · ) + b . However, once parameters A and b are fixed, it fully determines the dual * coordinate system η ( · ) .
The potential function ϕ is also reconstructed by solving differential modulo equations an affine term c , θ + d (e.g., see the proofs relying on Poincaré lemma in [16,19,20,21]). Fixing the degrees of freedom in the reconstruction of ψ will also fix the corresponding affine term in F * which expresses ψ . The dual potential functions ψ and ϕ on the manifold M are related by the fiberwise Legendre transform [22] in geometric mechanics.
Thus, the information geometry of dually flat spaces allows one to explain the decoupling of the interactions of the dual set of parameters ( A , b , c , d ) with ( E , f , g , h ) . Lastly, the scalar parameter λ > 0 is the degree of freedom obtained from the fact that if ( M , g , , * ) is a dually flat space, then so is ( M , λ g , , * ) .
The Fenchel–Young inequality induced by the dual potential functions of Equation (5) defines a canonical divergence on a dually flat space that we term the dually flat Hessian divergence:
D g , , ( p : q ) = ψ ( θ ( p ) ) + ϕ ( η ( q ) ) i = 1 m θ i ( p ) η i ( q ) 0 .
We have the following reference duality [23]: D g , ( q : p ) = D g , * ( p : q ) .
The dually flat Hessian divergence can be expressed using the dual coordinate systems as a corresponding Fenchel–Young divergence defined by
Y F , F * ( θ : η ) : = F ( θ ) + F * ( η ) i = 1 m θ i η i .
A Fenchel–Young divergence can also be expressed equivalently as dual Bregman divergences B F or B F * :
Y F , F * ( θ : η ) = B F ( θ : θ ) = B F * ( η : η ) ,
where θ = F * ( η ) and η = F ( θ ) with
B F ( θ : θ ) = F ( θ ) F ( θ ) θ θ , F ( θ ) .
Thus, the dually flat Hessian divergence can be expressed as dual Fenchel–Young divergences (using the fact that F * * = F ) in the mixed θ / η coordinate systems as
D g , , ( p : q ) = Y F , F * ( θ ( p ) : η ( q ) ) = Y F * , F ( η ( q ) : θ ( p ) ) ,
= 1 λ Y F P , F P * ( θ ¯ ( p ) : η ¯ ( q ) ) = 1 λ Y F P * , F P ( η ¯ ( q ) : θ ¯ ( p ) ) , P P ,
This follows from the fact that ψ ( p ) = F P ( θ ¯ ( p ) ) = F ( θ ( p ) ) and ϕ ( q ) = F P * ( η ¯ ( q ) ) = F * ( η ( q ) ) for any P P .
Thus, we can define an equivalence relation ∼ between the functions of Γ 2 : F F ˜ if and only if F ˜ = F P for some P P . Furthermore, a distance invariant under the Legendre transform [24] can be defined in the moduli space Γ 2 / of dually flat spaces.
Lastly, we may consider some curvilinear dual coordinate systems instead of the mutually orthogonal, dually affine coordinate systems. Let us transform the affine θ coordinate system into some arbitrary curvilinear coordinate system θ ˜ . The dual affine η coordinate system transforms correspondingly into the curvilinear coordinate system η ˜ . The underlying geometric structures have been called the ( u , v ) structures by Amari [16,25] or the ( ρ , τ ) structures by Zhang [23]. The dual Bregman divergences or, equivalently, the dual Fenchel–Young divergences of the underlying dually flat space need to be addressed as undeforming arguments [26,27] θ ˜ or η ˜ . Since the inverse transform θ ˜ θ can be interpreted as a representation function, the Bregman divergences addressed as undeforming θ ˜ arguments were called representational Bregman divergences in [26]. For example, the β divergences are Bregman divergences [28,29,30] which can be transformed by a nonlinear change of coordinates into α divergences [31]. Although the α divergences are Bregman divergences for any α on positive measures [26,27], α divergences are not Bregman divergences anymore when constrained on the probability simplex (except for the α = ± 1 case).
Remark 1. 
In information geometry [16], and more generally in Hessian geometry [19], a Legendre-type C 3 convex function F ( θ ) of Γ 3 induces a dually flat space or manifold. The convex function F ( θ ) (potential function) may stem from several modeling sources. We may consider the following settings to build dually flat spaces:
  • The cumulant function of a natural exponential family [16,32]: Let ( X , Ω , μ ) be a measurable space with a sample space X , σ algebra Ω, and a positive measure μ (e.g., counting or Lebesgue measure). An exponential family E is a set of probability measures E = P θ ( x ) = exp ( x , θ F ( θ ) ) d μ ( x ) : θ Θ , where
    Θ = { θ : F ( θ ) = log exp ( x , θ ) d μ ( x ) < } ,
    is the natural parameter space. Z ( θ ) = exp ( F ( θ ) ) is strictly log-convex [32], and hence F ( θ ) = log Z ( θ ) is strictly convex (and differentiable). In this case, the convex conjugate amounts to the negative Shannon or differential entropy [33] F * ( η ) = S ( p θ ) = p θ ( x ) log p θ ( x ) d μ ( x ) , where S ( p ) = p ( x ) log p ( x ) d μ ( x ) is the Shannon entropy (when μ is the counting measure) or the differential entropy (when μ is the Lebesgue measure).
  • The negative Shannon entropy of a mixture family [16]: A mixture family M is a set of probability measures
    M = m θ ( x ) = i = 1 d 1 θ i p i ( x ) + ( 1 i = 1 d 1 θ i ) p 0 ( x ) ,
    parameterized by a normalized positive weight vector θ Θ = Δ d (the standard ( d 1 ) -dimensional simplex) such that the functions 1 , p 0 ( x ) , , p d 1 ( x ) are linearly independent. The function F ( θ ) = S ( m θ ) is strictly convex and differentiable (see [34] for a proof). In this case, the convex conjugate F * ( η ) = S × ( p 0 , m θ ) is the cross-entropy of p 0 ( x ) with the mixture m θ ( x ) , where S × ( p , q ) = p ( x ) log q ( x ) d μ ( x ) .
  • The characteristic function of a regular cone [19] (i.e., convex and pointed cone): Let K be a regular cone and K * = θ K { η : θ , η 0 } be its dual cone. We define F ( θ ) = log χ K ( θ ) , where χ K ( θ ) is the characteristic function χ K ( θ ) = K * exp ( θ , η ) d η . One can further build generalized Wishart exponential families on the cones [35]. (Note that Massieu [36] introduced the concept of characteristic functions and their convex conjugates in thermodynamics in the 19th century.) See also the barrier functions (logarithms of characteristic functions) on convex cones for interior point methods [37].
  • The Guillemin potential of a (Delzant) polytope [38] which recovers the negative Shannon entropy when considering the standard simplex.

4. Conclusions

To summarize, we first proved that the generalized Legendre transforms obtained from the reverse-ordering involutive transform axiomatization of [11,12] can be interpreted as the ordinary Legendre transform of corresponding affine-deformed functions. Second, we explained how these generalized Legendre transforms are merely different expressions of the well-known geometric Legendre transforms on dually flat spaces (Hessian manifolds with global charts).
Figure 1 summarizes the various classes of convex functions used in this paper, with some of their key properties used to define information-geometric structures. In particular, the class of functions Γ 3 is thrice-differentiable Legendre-type lsc. convex functions (with Γ 3 Γ 2 Γ 1 Γ 0 ), which allows one to construct α geometry [16] from the Amari–Chentsov cubic tensor [17].

Funding

This research received no external funding.

Data Availability Statement

No new data were created or analyzed in this study. Data sharing is not applicable to this article.

Conflicts of Interest

Author Frank Nielsen was employed by the company Sony Computer Science Laboratories. The author declares that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.

Appendix A. Legendre-Type Functions

Rockafellar [18] showed that there exist convex lsc. functions of Γ 0 with corresponding gradient domains that are not convex. For example, Rockafellar showed that the bivariate function F ( θ ) = F ( θ 1 , θ 2 ) = 1 4 θ 1 2 θ 2 + θ 1 2 + θ 2 2 defined on the upper plane domain Θ = R × R > 0 is strictly convex, but its gradient domain H is not convex. Thus, to rule out these functions, Rockafellar defined Legendre-type functions [18]:
Definition A1 
(Legendre-type function [18]). A convex function F : Θ R m R ¯ is of a Legendre type if the following are true:
  • Θ is a non-empty open effective domain;
  • F is strictly convex and differentiable on Θ;
  • F becomes infinitely steep close to boundary points of its effective domain:
    θ Θ , θ Θ , lim λ 0 d d λ F ( λ θ + ( 1 λ ) θ ) = .
When F is of a Legendre type, so is its convex conjugate F * , and moreover the gradients of convex conjugates are reciprocal to each other such that F * = ( F ) 1 and F = ( F * ) 1 . This property of reciprocal gradients obtained from the LFT of Legendre-type functions is strong since, in general, the implicit function theorem only guarantees local inversion of multivariate functions and not the existence of global inverse functions.
We shall denote by Γ 1 ( Θ ) Γ 0 ( Θ ) the subset of proper lsc. strictly convex and differentiable functions of a Legendre type defined on the open effective domain Θ . We define the Legendre–Fenchel transform of L ( Θ , F ) = ( H , F * ) where H is the gradient domain, and we call F * the convex conjugate of F. We have L L ( Θ , F ) = ( Θ , F ) for Legendre-type functions F Γ 1 ( Θ ) . The concept of a Legendre-type function is related to the concept of steep exponential families in statistics.
In general, convex conjugate pairs enjoy the following reverse-ordering property:
Property A1 
(Reverse-ordering). Let F 1 and F 2 in Γ 0 ( Θ ) . If F 2 F 1 , then L F 2 L F 1 . If F 2 F 1 , then L F 2 L F 1 .
Proof. 
Assume that F 2 F 1 , and let us prove that F 2 * = L F 2 F 1 * = L F 1 :
F 1 * ( η ) = sup θ { η , θ F 1 ( θ ) } , = η , F 1 ( η ) F 1 ( F 1 ( η ) ) , η , F 1 ( η ) F 2 ( F 1 ( η ) ) , sup θ { η , θ F 2 ( θ ) } = F 2 * ( η ) .
The case F 2 F 1 is similar to the case F 1 F 2 by exchanging the role of F 1 and F 2 (i.e., F 2 F 1 ). □

Appendix B. Some Examples of Convex Conjugates

Example A1. 
Let F ( θ ) = a , θ + b be an affine function. Then, we have
F * ( η ) = b i f η = a + i f η a
Let
1 A ( x ) = 0 i f x A + i f x A
be the indicator function of a set A. Then, we can write F * = 1 { a } b .
Example A2. 
Let F ( θ ) = | θ | for θ R . Then, we have the convex conjugate
F * ( η ) = 1 [ 1 , 1 ] ( η ) = 0 | η | 1 , + o t h e r w i s e .
Example A3. 
Consider F ( θ ) = exp θ for Θ = R . We have
F * ( η ) = η log η η , i f η > 0 , 0 , i f η = 0 , + i f η < 0 .
The convex conjugate is the scalar Shannon entropy function extended to positive real values.
Example A4. 
For p [ 1 , + ) , let F p ( θ ) = 1 p θ p for θ Θ = R m . Then, we have F p * ( η ) : = F q ( η ) , where 1 p + 1 q = 1 . The powers p and q are called a conjugate pair of exponents. Notice that the Fenchel–Young inequality reduces to the Young’s inequality in the scalar case:
F p ( θ ) + F q ( η ) θ , η .
Furthermore, by integrating Young’s inequality on both sides for η = g ( x ) and θ = f ( x ) for x X and f L p and g L q (Lebesgue spaces), we recover Hölder’s inequality:
1 p f p + 1 q g q f g 1 .
In fact, we have the self-duality F = F * only for F ( θ ) = F 2 ( θ ) = 1 2 θ 2 .
When a function F Γ 0 ( Θ ) is not of the Legendre type, the Fenchel–Young inequality may be tight for several pairs ( θ , η ) instead of a single pair ( θ = F * ( η ) , η = F ( θ ) ) . A subgradient η of F ( θ ) at θ 0 satisfies
F ( θ ) F ( θ 0 ) η , θ θ 0 .
The subdifferential θ 0 F of F at θ 0 is the set of subgradients. The subdifferential operator : R m R m is multivalued:
F ( θ ) = η : F ( θ ) F ( θ 0 ) η , θ θ 0 , i f θ Θ = dom ( F ) i f θ Θ .
The following example illustrates the LFT of a non-Legendre type function and the LFT of a Legendre-type function obtained by restricting the function to a specified domain.
Example A5. 
Let F ( θ ) : = exp ( | θ | ) | θ | 1 be defined on Θ = R . Then, F * ( η ) = ( 1 + | η | ) log ( 1 + | η | ) | η | , defined on H = R . These two functions F and F * are even and convex, and they form a conjugate pair (Figure A1). The function F ( θ ) is not differentiable at θ = 0 , and thus we have
F ( θ ) = F ( θ ) = exp ( θ ) 1 , θ > 0 , F ( 0 ) = [ 1 , 1 ] , θ = 0 , F ( θ ) = exp ( θ ) + 1 , θ < 0 .
The function F * ( η ) is differentiable everywhere, and we have
F * ( η ) = F * ( η ) = log ( 1 + η ) , η 0 , F * ( η ) = log ( 1 η ) , η 0 .
For θ 0 , the gradients F ( θ ) and F * ( η ) are reciprocal to each other. The function ( R , F ( θ ) ) is not of a Legendre type since it is not differentiable at θ = 0 , but the functions ( R > 0 , F ( θ ) ) and ( R > 0 , F * ( η ) ) form a Legendre-type pair when restricted to the positive domain R > 0 : F , F * Γ 1 ( R > 0 ) .
Figure A1. A pair ( F ( θ ) , F * ( η ) ) of conjugate functions (top) with their subgradients plotted (bottom). The function F ( θ ) is not differentiable at θ = 0 and thus admits a subgradient F ( 0 ) at θ = 0 . The function F * ( η ) is differentiable everywhere, and when θ 0 , we have F * = ( F ) 1 , visualized by rotating the x y axis 90 degrees).
Figure A1. A pair ( F ( θ ) , F * ( η ) ) of conjugate functions (top) with their subgradients plotted (bottom). The function F ( θ ) is not differentiable at θ = 0 and thus admits a subgradient F ( 0 ) at θ = 0 . The function F * ( η ) is differentiable everywhere, and when θ 0 , we have F * = ( F ) 1 , visualized by rotating the x y axis 90 degrees).
Entropy 28 00044 g0a1

References

  1. Bauschke, H.H.; Lucet, Y. What is… a Fenchel conjugate? Not. AMS 2012, 59, 44–46. [Google Scholar] [CrossRef]
  2. Legendre, A.M. Nouvelles méthodes pour la détermination des orbites des comètes; Firmin Didot: Paris, France, 1805. [Google Scholar]
  3. Hamilton, W.R. On a General Method in Dynamics. In Philosophical Transactions of the Royal Society of London; Cambridge University: Cambridge, UK, 1834; pp. 247–308. [Google Scholar]
  4. Gibbs, J.W. Elementary Principles of Statistical Mechanics; Yale University Press: New Haven, CT, USA, 1902. [Google Scholar]
  5. Callen, H.B. Thermodynamics and an Introduction to Thermostatistics; John Wiley & Sons: Hoboken, NJ, USA, 1985. [Google Scholar]
  6. Weinberg, S. The Quantum Theory of Fields; Cambridge University Press: Cambridge, UK, 1995; Volume 2. [Google Scholar]
  7. Mas-Colell, A.; Whinston, M.D.; Green, J.R. Microeconomic Theory; Oxford University Press: New York, NY, USA, 1995; Volume 1. [Google Scholar]
  8. Rockafellar, R.T. Convex Analysis. Princet. Math. Ser. 1970, 28, 470. [Google Scholar]
  9. Correa, R.; Hantoute, A.; López, M.A. Fundamentals of Convex Analysis and Optimization; Springer: Berlin/Heidelberg, Germany, 2023. [Google Scholar]
  10. Möllenhoff, T.; Khan, M.E. SAM as an Optimal Relaxation of Bayes. In Proceedings of the The Eleventh International Conference on Learning Representations, Kigali, Rwanda, 1–5 May 2023; ICLR: Appleton, WI, USA, 2023. [Google Scholar]
  11. Artstein-Avidan, S.; Milman, V. A characterization of the concept of duality. Electron. Res. Announc. 2007, 14, 42–59. [Google Scholar]
  12. Artstein-Avidan, S.; Milman, V. The concept of duality in convex analysis, and the characterization of the Legendre transform. Ann. Math. 2009, 169, 661–674. [Google Scholar] [CrossRef]
  13. Fenchel, W. On Conjugate Convex Functions. Can. J. Math. 1949, 1, 73–77. [Google Scholar] [CrossRef]
  14. Fenchel, W. On conjugate convex functions. In Traces and Emergence of Nonlinear Programming; Springer: Berlin/Heidelberg, Germany, 2013; pp. 125–129. [Google Scholar]
  15. Böröczky, K.J.; Schneider, R. A characterization of the duality mapping for convex bodies. Geom. Funct. Anal. 2008, 18, 657–667. [Google Scholar] [CrossRef]
  16. Amari, S.i. Information Geometry and Its Applications; Springer: Berlin/Heidelberg, Germany, 2016; Volume 194. [Google Scholar]
  17. Ay, N.; Jost, J.; Vân Lê, H.; Schwachhöfer, L. Information Geometry; Springer: Berlin/Heidelberg, Germany, 2017; Volume 64. [Google Scholar]
  18. Rockafellar, R.T. Conjugates and Legendre transforms of convex functions. Can. J. Math. 1967, 19, 200–205. [Google Scholar] [CrossRef]
  19. Shima, H. The Geometry of Hessian Structures; World Scientific: Singapore, 2007. [Google Scholar]
  20. Amari, S.i.; Nagaoka, H. Methods of Information Geometry; American Mathematical Society: Providence, RI, USA, 2000; Volume 191. [Google Scholar]
  21. Morales, P.A.; Korbel, J.; Rosas, F.E. Geometric structures induced by deformations of the Legendre transform. Entropy 2023, 25, 678. [Google Scholar] [CrossRef] [PubMed]
  22. Leok, M.; Zhang, J. Connecting information geometry and geometric mechanics. Entropy 2017, 19, 518. [Google Scholar] [CrossRef]
  23. Naudts, J.; Zhang, J. Legendre duality: From thermodynamics to information geometry. Inf. Geom. 2024, 7, 623–649. [Google Scholar] [CrossRef]
  24. Attouch, H.; Wets, R.J.B. Isometries for the Legendre-Fenchel transform. Trans. Am. Math. Soc. 1986, 296, 33–60. [Google Scholar] [CrossRef]
  25. Nock, R.; Nielsen, F.; Amari, S.I. On conformal divergences and their population minimizers. IEEE Trans. Inf. Theory 2015, 62, 527–538. [Google Scholar] [CrossRef]
  26. Nielsen, F.; Nock, R. The dual Voronoi diagrams with respect to representational Bregman divergences. In Proceedings of the Sixth International Symposium on Voronoi Diagrams (ISVD), Copenhagen, Denmark, 23–26 June 2009; IEEE: New York, NY, USA, 2009; pp. 71–78. [Google Scholar]
  27. Amari, S.i. α-Divergence is unique, belonging to both f-divergence and Bregman divergence classes. IEEE Trans. Inf. Theory 2009, 55, 4925–4931. [Google Scholar] [CrossRef]
  28. Csiszar, I. Why least squares and maximum entropy? An axiomatic approach to inference for linear inverse problems. Ann. Stat. 1991, 19, 2032–2066. [Google Scholar] [CrossRef]
  29. Murata, N.; Takenouchi, T.; Kanamori, T.; Eguchi, S. Information geometry of U-Boost and Bregman divergence. Neural Comput. 2004, 16, 1437–1481. [Google Scholar] [CrossRef] [PubMed]
  30. Hennequin, R.; David, B.; Badeau, R. Beta-divergence as a subclass of Bregman divergence. IEEE Signal Process. Lett. 2010, 18, 83–86. [Google Scholar] [CrossRef]
  31. Dikmen, O.; Yang, Z.; Oja, E. Learning the information divergence. IEEE Trans. Pattern Anal. Mach. Intell. 2014, 37, 1442–1454. [Google Scholar] [CrossRef] [PubMed]
  32. Barndorff-Nielsen, O. Information and Exponential Families: In Statistical Theory; John Wiley & Sons: Hoboken, NJ, USA, 2014. [Google Scholar]
  33. Nielsen, F.; Nock, R. Entropies and cross-entropies of exponential families. In Proceedings of the 2010 IEEE International Conference on Image Processing, Hong Kong, China, 26–29 September 2010; IEEE: New York, NY, USA, 2010; pp. 3621–3624. [Google Scholar]
  34. Nielsen, F.; Hadjeres, G. Monte Carlo information-geometric structures. In Geometric Structures of Information; Springer: Berlin/Heidelberg, Germany, 2018; pp. 69–103. [Google Scholar]
  35. Graczyk, P.; Ishi, H.; Mamane, S. Wishart exponential families on cones related to tridiagonal matrices. Ann. Inst. Stat. Math. 2019, 71, 439–471. [Google Scholar] [CrossRef]
  36. Massieu, F. Thermodynamique: Mémoire sur les Fonctions Caractéristiques des Divers Fluides et sur la Théorie des Vapeurs; Académie des Sciences de L’Institut National de France: Paris, France, 1876; Volume 22. [Google Scholar]
  37. Güler, O. Barrier functions in interior point methods. Math. Oper. Res. 1996, 21, 860–885. [Google Scholar] [CrossRef]
  38. Fujita, H. The generalized Pythagorean theorem on the compactifications of certain dually flat spaces via toric geometry. Inf. Geom. 2024, 7, 33–58. [Google Scholar] [CrossRef]
Figure 1. The ordinary Legendre transform for various classes of functions: relationships with Fenchel–Young and Bregman divergences, dually flat Hessian divergence, and α geometry in information geometry.
Figure 1. The ordinary Legendre transform for various classes of functions: relationships with Fenchel–Young and Bregman divergences, dually flat Hessian divergence, and α geometry in information geometry.
Entropy 28 00044 g001
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Nielsen, F. Generalized Legendre Transforms Have Roots in Information Geometry. Entropy 2026, 28, 44. https://doi.org/10.3390/e28010044

AMA Style

Nielsen F. Generalized Legendre Transforms Have Roots in Information Geometry. Entropy. 2026; 28(1):44. https://doi.org/10.3390/e28010044

Chicago/Turabian Style

Nielsen, Frank. 2026. "Generalized Legendre Transforms Have Roots in Information Geometry" Entropy 28, no. 1: 44. https://doi.org/10.3390/e28010044

APA Style

Nielsen, F. (2026). Generalized Legendre Transforms Have Roots in Information Geometry. Entropy, 28(1), 44. https://doi.org/10.3390/e28010044

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop