Let be a finite connected simple graph with a chosen orientation of its edges. For the edge potential we minimize over each affine class . The minimizer is the unique representative satisfying the nonlinear coclosed equation and hence defines a nonlinear selector We show that is real analytic, identify its image as and compute its differential as a weighted Hodge projector. In particular, agrees with the ordinary Hodge projector to first order at the origin, and the first nonlinear correction is cubic. Our main global theorem is a graph-theoretic criterion: for every admissible edge potential – even, , strictly convex, and non-quadratic – the associated nonlinear selector coincides with on all of if and only if is a cactus graph. Finally, we work out the two-triangle graph, the smallest connected simple obstruction, and record a self-concordant Newton method for computing .

生成讲解博客的中文版本

生成AI智能校验的中文版本