arxiv: 2605.13704 · v1 · submitted 2026-05-13 · 🧮 math.AP

Recognition: 2 theorem links

· Lean Theorem

Lax-Oleinik formula for nonautonomous Hamilton-Jacobi equations on networks

Marco Pozza

Authors on Pith no claims yet

Pith reviewed 2026-05-14 17:46 UTC · model grok-4.3

classification 🧮 math.AP

keywords Lax-Oleinik formulaHamilton-Jacobi equationsnetworksnonautonomousflux limitersviscosity solutionsaction functional

0 comments

The pith

A Lax-Oleinik-type representation formula yields the unique solution to nonautonomous Hamilton-Jacobi equations on networks with loops and countably many arcs.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes a representation formula for solutions of time-dependent Hamilton-Jacobi equations defined on networks. This formula is built from a Lagrangian that combines the dynamics on each arc with constraints at the vertices known as flux limiters. It works even when the networks have infinitely many arcs or loops and when the flux limiters are larger than previously allowed bounds. A reader would care because such equations model wave propagation or optimal control on graph-like structures, and the formula gives an explicit way to compute or characterize the solutions without solving the PDE directly.

Core claim

The central claim is that the Lax-Oleinik representation formula, defined using an overall action functional that accounts for both the arc-specific Hamiltonians and the flux limiters at vertices, gives the unique viscosity solution to the nonautonomous Hamilton-Jacobi equation on the network. The authors show that the minimizers of this functional are Lipschitz continuous without having to exclude Zeno phenomena, and that the formula remains valid even when the flux limiters exceed the standard upper bounds required in earlier works.

What carries the argument

The overall Lagrangian that integrates the arc Hamiltonians with vertex flux limiters, used to define the action functional whose infimum yields the solution via the representation formula.

If this is right

The formula provides the unique solution even for flux limiters exceeding standard upper bounds.
Minimizers of the associated action functional are Lipschitz continuous without ruling out the Zeno phenomenon.
The approach handles networks with countably many arcs and loops.
Nonautonomous Hamiltonians that are convex, superlinear in momentum, and Lipschitz in time are covered.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The formula could support numerical approximations for solutions on large or infinite networks.
Applications might include time-dependent optimal control problems on road or communication networks.
Relaxing convexity of the Hamiltonians could be tested in future extensions of the same representation approach.

Load-bearing premise

The Hamiltonians must be convex and superlinear in the momentum variable while satisfying a Lipschitz condition in time, and the networks must have flux limiters at vertices that ensure well-posedness even when exceeding standard bounds.

What would settle it

Finding a specific network with loops and a Hamiltonian satisfying the conditions where the formula does not produce the unique viscosity solution when flux limiters are above the usual bounds would disprove the claim.

read the original abstract

We provide a Lax-Oleinik-type representation formula for solutions to nonautonomous Hamilton-Jacobi equations posed on networks with a rather general geometry. The networks may possess countably many arcs and allow for the presence of loops. We consider Hamiltonians that are convex and superlinear in the momentum variable, and satisfy a Lipschitz-type condition in the time variable. The representation formula is constructed via an overall Lagrangian that accounts for both the arc-specific dynamics and vertex-based constraints, called flux limiters, which ensure the well-posedness of the problem. We prove that the corresponding action functional admits Lipschitz continuous minimizers without needing to rule out the Zeno phenomenon. Furthermore, we demonstrate that the formula yields the unique solution to the problem even when the flux limiters exceed standard upper bounds.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

This paper gives a Lax-Oleinik representation for nonautonomous Hamilton-Jacobi equations on networks with countable arcs, loops, and flux limiters beyond standard bounds.

read the letter

The main takeaway is a representation formula that works for nonautonomous Hamilton-Jacobi equations on networks allowing countably many arcs and loops. It builds an overall Lagrangian from the arc dynamics and vertex flux limiters, shows the action functional has Lipschitz continuous minimizers without excluding the Zeno phenomenon, and proves the formula gives the unique solution even when those limiters exceed the usual upper bounds. The Hamiltonians are assumed convex and superlinear in momentum with a Lipschitz condition in time, which is standard but keeps the setting manageable. This combination looks like a real step past the autonomous or finite-arc cases that dominate earlier work. The construction avoids obvious circularity by deriving everything from the given Lagrangian and constraints. On the soft side, countable arcs raise questions about compactness and convergence that the abstract claims are handled, but the details of those estimates would need close reading in the proofs. The time-Lipschitz assumption limits how wild the time dependence can be, though that is typical for these results. No load-bearing gaps jump out from the stated claims. This is aimed at people working on PDEs on metric graphs, optimal control on networks, or traffic models with complex topology. A reader already familiar with Lax-Oleinik formulas on simpler graphs would find the extensions useful and concrete. The work shows clear technical engagement with the literature and the math holds together on its own terms, so it deserves a serious referee even if some estimates might need polishing.

Referee Report

2 major / 3 minor

Summary. The paper establishes a Lax-Oleinik-type representation formula for solutions to nonautonomous Hamilton-Jacobi equations on networks that may contain countably many arcs and loops. Hamiltonians are assumed convex and superlinear in the momentum variable with a Lipschitz condition in time. The formula is constructed from an overall Lagrangian that incorporates arc-specific dynamics together with vertex flux limiters. The central results are that the associated action functional admits Lipschitz continuous minimizers (without excluding the Zeno phenomenon) and that the representation yields the unique solution even when the flux limiters exceed conventional upper bounds.

Significance. If the claims hold, the work extends the classical Lax-Oleinik formula to nonautonomous problems on networks with quite general topology, including countable arcs and loops, while relaxing the usual restrictions on flux limiters. The construction via a global Lagrangian and the Lipschitz-minimizer result without Zeno exclusion are technically notable and could serve as a foundation for further well-posedness and control-theoretic studies on networks.

major comments (2)

[§4, Theorem 4.3] §4, Theorem 4.3: the argument that the action functional admits Lipschitz minimizers relies on the superlinear growth of the Lagrangian, but the passage from finite to countably infinite arcs appears to use only sequential compactness; an explicit uniform bound on the Lipschitz constant independent of the number of arcs would strengthen the claim.
[§5.2, Proposition 5.4] §5.2, Proposition 5.4: uniqueness is asserted for flux limiters larger than the standard bound, yet the comparison principle invoked in the proof is stated only for the case where the limiters satisfy the usual inequality; the extension to the supercritical regime needs an additional estimate showing that the representation still satisfies the equation at vertices.

minor comments (3)

[§2.3] Notation for the overall Lagrangian L is introduced in §2.3 but used without re-statement in the proof of Theorem 3.1; a brief reminder of its definition would improve readability.
[Figure 1] Figure 1 (network example) lacks labels on the arcs; adding arc indices would clarify the correspondence with the countable-arc construction.
[Assumption (H)] The Lipschitz condition on the Hamiltonian in time is stated as |H(t,p) - H(s,p)| ≤ C|t-s|(|p|+1), but the constant C is not tracked through the estimates; making its dependence explicit would help verify the time-regularity of the solution.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and the positive recommendation for minor revision. We address each major comment below and will incorporate the suggested clarifications and additions in the revised manuscript.

read point-by-point responses

Referee: [§4, Theorem 4.3] §4, Theorem 4.3: the argument that the action functional admits Lipschitz minimizers relies on the superlinear growth of the Lagrangian, but the passage from finite to countably infinite arcs appears to use only sequential compactness; an explicit uniform bound on the Lipschitz constant independent of the number of arcs would strengthen the claim.

Authors: We agree that an explicit uniform bound strengthens the result. In the revision we add a new auxiliary lemma (Lemma 4.2) that extracts a Lipschitz constant depending only on the superlinear growth constants of the Lagrangian and on the total length of the network, independent of the cardinality of the arc set. The proof proceeds by contradiction: any minimizing sequence with unbounded Lipschitz constants would produce infinite action by the coercivity assumption, contradicting minimality; the same coercivity then yields the uniform bound used in the sequential compactness argument for countable networks. revision: yes
Referee: [§5.2, Proposition 5.4] §5.2, Proposition 5.4: uniqueness is asserted for flux limiters larger than the standard bound, yet the comparison principle invoked in the proof is stated only for the case where the limiters satisfy the usual inequality; the extension to the supercritical regime needs an additional estimate showing that the representation still satisfies the equation at vertices.

Authors: We thank the referee for this observation. The comparison principle in Section 3 is indeed formulated under the classical bound on the flux limiters. For the supercritical case we rely on direct verification: the Lax-Oleinik formula is constructed so that its value at a vertex is the infimum over admissible incoming and outgoing arcs, which automatically enforces the flux-limiter condition by definition of the global Lagrangian. In the revision we insert a short additional paragraph in the proof of Proposition 5.4 that explicitly checks the vertex inequality for the representation formula when the limiter exceeds the usual threshold, thereby confirming that the formula remains a viscosity solution and uniqueness follows from the comparison principle applied to the subcritical envelope. revision: yes

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The derivation constructs the Lax-Oleinik representation explicitly from an overall Lagrangian assembled from the given arc Hamiltonians and vertex flux-limiter constraints. All load-bearing steps (existence of Lipschitz minimizers, uniqueness of the viscosity solution) are obtained by direct analysis of this functional under the stated convexity, superlinearity, and time-Lipschitz hypotheses; none of these steps is defined in terms of the final formula, fitted to a subset of its own outputs, or justified solely by self-citation. The network geometry (countable arcs, loops) and allowance for flux limiters beyond standard bounds are treated as external data, not derived from the representation itself. The argument is therefore self-contained against the paper's own assumptions.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claim rests on standard domain assumptions from convex analysis and network PDE theory; no free parameters are fitted and no new entities are postulated.

axioms (2)

domain assumption Hamiltonians are convex and superlinear in the momentum variable
Standard assumption ensuring existence of minimizers and well-posedness for Hamilton-Jacobi equations.
domain assumption Hamiltonians satisfy a Lipschitz-type condition in the time variable
Required to handle the nonautonomous dependence while preserving continuity properties of the action.

pith-pipeline@v0.9.0 · 5422 in / 1491 out tokens · 64438 ms · 2026-05-14T17:46:16.316378+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

We define an overall Lagrangian L on the tangent bundle of Γ by gluing together the local Lagrangians Lγ... L(x,q,t):=|q|²/2 + cx(t) for x∈V
IndisputableMonolith/Foundation/ArithmeticFromLogic.lean reality_from_one_distinction unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

the action functional admits Lipschitz continuous minimizers... representation formula yields the unique solution

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

25 extracted references · 20 canonical work pages

[1]

Deterministic mean field games on networks: a Lagrangian approach

Y. Achdou, P. Mannucci, C. Marchi, and N. Tchou. “Deterministic mean field games on networks: a Lagrangian approach.” In:SIAM Journal on Mathematical Analysis56.5 (Oct. 2024), pp. 6689–6730.issn: 1095-7154.doi:10.1137/23m1615073

work page doi:10.1137/23m1615073 2024
[2]

Bardi and I

M. Bardi and I. Capuzzo-Dolcetta.Optimal control and viscosity solutions of Hamilton- Jacobi-Bellman equations. Birkhäuser Boston, 1997.isbn: 978-0-8176-4755-1.doi:10.1007/ 978-0-8176-4755-1

1997
[3]

Existence ofC1,1 critical sub-solutions of the Hamilton–Jacobi equation on compact manifolds

P. Bernard. “Existence ofC1,1 critical sub-solutions of the Hamilton–Jacobi equation on compact manifolds.” In:Annales Scientifiques de l’École Normale Supérieure40.3 (May 2007), pp. 445–452.issn: 0012-9593.doi:10.1016/j.ansens.2007.01.004

work page doi:10.1016/j.ansens.2007.01.004 2007
[4]

Burago, Y

D. Burago, Y. Burago, and S. Ivanov.A course in metric geometry. Vol. 33. Graduate Studies in Mathematics. American Mathematical Society (AMS), June 2001.isbn: 978-1- 4704-1794-9.doi:10.1090/gsm/033

work page doi:10.1090/gsm/033 2001
[5]

Error estimate for a semi-Lagrangian scheme for Hamilton-Jacobi equations on networks

E. Carlini, V. Coscetti, and M. Pozza. “Error estimate for a semi-Lagrangian scheme for Hamilton-Jacobi equations on networks.” In:Communications on Applied Mathematics and Computation(Oct. 2025).issn: 2661-8893.doi:10.1007/s42967-025-00527-w

work page doi:10.1007/s42967-025-00527-w 2025
[6]

Numerical analysis of time-dependent Hamilton–Jacobi equations on networks

E. Carlini and A. Siconolfi. “Numerical analysis of time-dependent Hamilton–Jacobi equations on networks.” In:Numerische Mathematik(Oct. 2025).issn: 0945-3245.doi: 10.1007/s00211-025-01498-z

work page doi:10.1007/s00211-025-01498-z 2025
[7]

Serre,Local Fields, Graduate Texts in Mathematics, vol

F. Clarke.Functional analysis, calculus of variations and optimal control. Graduate Texts in Mathematics. Springer London, 2013.isbn: 978-1-4471-4820-3.doi: 10.1007/978-1- 4471-4820-3

work page doi:10.1007/978-1- 2013
[8]

Numerical approximation of the critical value of eikonal Hamilton-Jacobi equations on networks

V. Coscetti and M. Pozza. “Numerical approximation of the critical value of eikonal Hamilton-Jacobi equations on networks.” In:Applied Mathematics and Optimization. Forth- coming
[9]

User’s guide to viscosity solutions of second order partial differential equations

M. G. Crandall, H. Ishii, and P.-L. Lions. “User’s guide to viscosity solutions of second order partial differential equations.” In:Bulletin of the American Mathematical Society 27.1 (1992), pp. 1–67.issn: 1088-9485.doi:10.1090/s0273-0979-1992-00266-5

work page doi:10.1090/s0273-0979-1992-00266-5 1992
[10]

Convergence of the solutions of the discounted Hamilton–Jacobi equation

A. Davini, A. Fathi, R. Iturriaga, and M. Zavidovique. “Convergence of the solutions of the discounted Hamilton–Jacobi equation.” In:Inventiones mathematicae206.1 (Jan. 2016), pp. 29–55.issn: 1432-1297.doi:10.1007/s00222-016-0648-6

work page doi:10.1007/s00222-016-0648-6 2016
[11]

A generalized dynamical approach to the large time behavior of solutions of Hamilton–Jacobi equations

A. Davini and A. Siconolfi. “A generalized dynamical approach to the large time behavior of solutions of Hamilton–Jacobi equations.” In:SIAM Journal on Mathematical Analysis 38.2 (Jan. 2006), pp. 478–502.issn: 1095-7154.doi:10.1137/050621955. 36

work page doi:10.1137/050621955 2006
[12]

Sur la convergence du semi-groupe de Lax-Oleinik

A. Fathi. “Sur la convergence du semi-groupe de Lax-Oleinik.” In:Comptes Rendus de l’Académie des Sciences - Series I - Mathematics327.3 (Aug. 1998), pp. 267–270.issn: 0764-4442.doi:10.1016/s0764-4442(98)80144-4

work page doi:10.1016/s0764-4442(98)80144-4 1998
[13]

Fathi.The weak kam theorem in Lagrangian dynamics

A. Fathi.The weak kam theorem in Lagrangian dynamics. Vol. 88. Cambridge Studies in Advanced Mathematics. Cambridge University Press, 2008.isbn: 978-0-5218-2228-2

2008
[14]

Imbert and R

C. Imbert and R. Monneau. “Flux-limited solutions for quasi-convex Hamilton-Jacobi equations on networks.” In:Annales scientifiques de l’École normale supérieure50.2 (2017), pp. 357–448.issn: 1873-2151.doi:10.24033/asens.2323

work page doi:10.24033/asens.2323 2017
[15]

Imbert, R

C. Imbert, R. Monneau, and H. Zidani. “A Hamilton-Jacobi approach to junction problems and application to traffic flows.” In:ESAIM: Control, Optimisation and Calculus of Variations19.1 (Mar. 2012), pp. 129–166.issn: 1262-3377.doi:10.1051/cocv/2012002

work page doi:10.1051/cocv/2012002 2012
[16]

Asymptotic solutions for large time of Hamilton–Jacobi equations in euclidean n space

H. Ishii. “Asymptotic solutions for large time of Hamilton–Jacobi equations in euclidean n space.” In:Annales de l’Institut Henri Poincaré C, Analyse non linéaire25.2 (Apr. 2008), pp. 231–266.issn: 1873-1430.doi:10.1016/j.anihpc.2006.09.002

work page doi:10.1016/j.anihpc.2006.09.002 2008
[17]

The Lax-Oleinik semigroup on graphs

R. Iturriaga and H. Sánchez Morgado. “The Lax-Oleinik semigroup on graphs.” In:Networks and Heterogeneous Media12.4 (2017), pp. 643–662.issn: 1556-181X.doi:10.3934/nhm. 2017026

work page doi:10.3934/nhm 2017
[18]

Well-posedness for multi-dimensional junction problems with Kirchoff-type conditions

P.-L. Lions and P. Souganidis. “Well-posedness for multi-dimensional junction problems with Kirchoff-type conditions.” In:Rendiconti Lincei - Matematica e Applicazioni28.4 (Nov. 2017), pp. 807–816.issn: 1120-6330.doi:10.4171/rlm/786

work page doi:10.4171/rlm/786 2017
[19]

Convergence & rates for Hamilton–Jacobi equations with Kirchoff junction conditions

P. S. Morfe. “Convergence & rates for Hamilton–Jacobi equations with Kirchoff junction conditions.” In:Nonlinear Differential Equations and Applications NoDEA27.1 (Jan. 2020), p. 10.issn: 1420-9004.doi:10.1007/s00030-020-0615-1

work page doi:10.1007/s00030-020-0615-1 2020
[20]

Large time behavior of solutions to Hamilton–Jacobi equations on networks

M. Pozza. “Large time behavior of solutions to Hamilton–Jacobi equations on networks.” In:Nonlinear Differential Equations and Applications NoDEA32.6 (Sept. 2025), p. 125. issn: 1420-9004.doi:10.1007/s00030-025-01128-5

work page doi:10.1007/s00030-025-01128-5 2025
[21]

Lax–Oleinik formula on networks

M. Pozza and A. Siconolfi. “Lax–Oleinik formula on networks.” In:SIAM Journal on Mathematical Analysis55.3 (June 2023), pp. 2211–2237.issn: 1095-7154.doi:10.1137/ 21m1448677

2023
[22]

Pozza, A

M. Pozza, A. Siconolfi, and A. Sorrentino.Homogenization of Hamilton-Jacobi equations on networks. Nov. 2024. arXiv:2411.03803v1

work page arXiv 2024
[23]

A general chain rule for derivatives and the change of variables formula for the Lebesgue integral

J. Serrin and D. E. Varberg. “A general chain rule for derivatives and the change of variables formula for the Lebesgue integral.” In:The American Mathematical Monthly76.5 (May 1969), pp. 514–520.issn: 0002-9890.doi:10.2307/2316959

work page doi:10.2307/2316959 1969
[24]

Time–dependent Hamilton–Jacobi equations on networks

A. Siconolfi. “Time–dependent Hamilton–Jacobi equations on networks.” In:Journal de Mathématiques Pures et Appliquées163 (July 2022), pp. 702–738.issn: 0021-7824.doi: 10.1016/j.matpur.2022.05.020

work page doi:10.1016/j.matpur.2022.05.020 2022
[25]

Stochastic homogenization of Hamilton–Jacobi equations and some applica- tions

P. Souganidis. “Stochastic homogenization of Hamilton–Jacobi equations and some applica- tions.” In:Asymptotic Analysis20 (1999), pp. 1–11. 37

1999