Research article

A new type of generic, self-evolving and efficient automated deduction algorithm based on category theory

  • Received: 08 January 2023 Revised: 29 April 2023 Accepted: 19 May 2023 Published: 29 May 2023
  • MSC : 03B35, 68V15, 18-00, 18-04, 68W99

  • In this article, a new type of generalized, self-evolving and efficient automated statement proof algorithm based on new data structures, i.e., brackets and map graphs, and new algorithms is presented. The brackets structure provides an elegant low-knowledge representation of mathematical concepts. The map graphs offer an efficient machine-learning method which let the computer learn knowledge while proving. Additionally, the new finding is built completely on category theory. Furthermore, a prototype of the program is presented and examined for performance.

    Citation: Zijian Wang, Xinhui Shao. A new type of generic, self-evolving and efficient automated deduction algorithm based on category theory[J]. AIMS Mathematics, 2023, 8(8): 18278-18294. doi: 10.3934/math.2023929

    Related Papers:

    [1] Jingjing Yang, Jianqiu Lu . Stabilization in distribution of hybrid stochastic differential delay equations with Lévy noise by discrete-time state feedback controls. AIMS Mathematics, 2025, 10(2): 3457-3483. doi: 10.3934/math.2025160
    [2] Xiao Yu, Yan Hua, Yanrong Lu . Observer-based robust preview tracking control for a class of continuous-time Lipschitz nonlinear systems. AIMS Mathematics, 2024, 9(10): 26741-26764. doi: 10.3934/math.20241301
    [3] Hany Bauomy . Control and optimization mechanism of an electromagnetic transducer model with nonlinear magnetic coupling. AIMS Mathematics, 2025, 10(2): 2891-2929. doi: 10.3934/math.2025135
    [4] Jenjira Thipcha, Presarin Tangsiridamrong, Thongchai Botmart, Boonyachat Meesuptong, M. Syed Ali, Pantiwa Srisilp, Kanit Mukdasai . Robust stability and passivity analysis for discrete-time neural networks with mixed time-varying delays via a new summation inequality. AIMS Mathematics, 2023, 8(2): 4973-5006. doi: 10.3934/math.2023249
    [5] Limei Liu, Xitong Zhong . Analysis and anti-control of period-doubling bifurcation for the one-dimensional discrete system with three parameters and a square term. AIMS Mathematics, 2025, 10(2): 3227-3250. doi: 10.3934/math.2025150
    [6] Abdul Qadeer Khan, Zarqa Saleem, Tarek Fawzi Ibrahim, Khalid Osman, Fatima Mushyih Alshehri, Mohamed Abd El-Moneam . Bifurcation and chaos in a discrete activator-inhibitor system. AIMS Mathematics, 2023, 8(2): 4551-4574. doi: 10.3934/math.2023225
    [7] Zhiqiang Chen, Alexander Yurievich Krasnov . Disturbance observer based fixed time sliding mode control for a class of uncertain second-order nonlinear systems. AIMS Mathematics, 2025, 10(3): 6745-6763. doi: 10.3934/math.2025309
    [8] Sheng-Ran Jia, Wen-Juan Lin . Adaptive event-triggered reachable set control for Markov jump cyber-physical systems with time-varying delays. AIMS Mathematics, 2024, 9(9): 25127-25144. doi: 10.3934/math.20241225
    [9] Hyung Tae Choi, Jung Hoon Kim . An L performance control for time-delay systems with time-varying delays: delay-independent approach via ellipsoidal D-invariance. AIMS Mathematics, 2024, 9(11): 30384-30405. doi: 10.3934/math.20241466
    [10] Nasser. A. Saeed, Amal Ashour, Lei Hou, Jan Awrejcewicz, Faisal Z. Duraihem . Time-delayed control of a nonlinear self-excited structure driven by simultaneous primary and 1:1 internal resonance: analytical and numerical investigation. AIMS Mathematics, 2024, 9(10): 27627-27663. doi: 10.3934/math.20241342
  • In this article, a new type of generalized, self-evolving and efficient automated statement proof algorithm based on new data structures, i.e., brackets and map graphs, and new algorithms is presented. The brackets structure provides an elegant low-knowledge representation of mathematical concepts. The map graphs offer an efficient machine-learning method which let the computer learn knowledge while proving. Additionally, the new finding is built completely on category theory. Furthermore, a prototype of the program is presented and examined for performance.



    In the recent papers [7,9] two functionals were introduced, measuring the amount of light collected by the leaves, and the amount of water and nutrients collected by the roots of a tree. In connection with a ramified transportation cost [1,14,18], these lead to various optimization problems for tree shapes.

    Quite often, optimal solutions to problems involving a ramified transportation cost exhibit a fractal structure [2,3,4,12,15,16,17]. In the present note we analyze in more detail the optimization problem for tree branches proposed in [7], in the 2-dimensional case. In this simple setting, the unique solution can be explicitly determined. Instead of being fractal, its shape reminds of a solar panel.

    The present analysis was partially motivated by the goal of understanding phototropism, i.e., the tendency of plant stems to bend toward the source of light. Our results indicate that this behavior cannot be explained purely in terms of maximizing the amount of light collected by the leaves (Fig. 1). Apparently, other factors must have played a role in the evolution of this trait, such as the competition among different plants. See [6] for some results in this direction.

    Figure 1.  A stem γ1 perpendicular to the sun rays is optimally shaped to collect the most light. For the stem γ2 bending toward the light source, the upper leaves put the lower ones in shade.

    The remainder of this paper is organized as follows. In Section 2 we review the two functionals defining the shape optimization problem and state the main results. Proofs are then worked out in Sections 3 to 5. Finally, in Section 6 we show the sharpness of the assumptions used in Theorem 2.5 and discuss various possible extensions.

    We begin by reviewing the two functionals considered in [7,9].

    Let μ be a positive, bounded Radon measure on Rd+{(x1,x2,,xd);xd0}. Thinking of μ as the density of leaves on a tree, we seek a functional S(μ) describing the total amount of sunlight absorbed by the leaves. Fix a unit vector

    nSd1{xRd;|x|=1},

    and assume that all light rays come parallel to n. Call En the (d1)-dimensional subspace perpendicular to n and let πn:RdEn be the perpendicular projection. Each point xRd can thus be expressed uniquely as

    x=y+sn (1)

    with yEn and sR.

    On the perpendicular subspace En consider the projected measure μn, defined by setting

    μn(A)=μ({xRd;πn(x)A}). (2)

    Call Φn the density of the absolutely continuous part of μn w.r.t. the (d1)-dimensional Lebesgue measure on En.

    Definition 2.1. The total amount of sunlight from the direction n captured by a measure μ on Rd is defined as

    Sn(μ)En(1exp{Φn(y)})dy. (3)

    More generally, given an integrable function ηL1(Sd1), the total sunlight absorbed by μ from all directions is defined as

    Sη(μ)Sd1(En(1exp{Φn(y)})dy)η(n)dn. (4)

    In the formula (4), η(n) accounts for the intensity of light coming from the direction n.

    Remark 1. According to the above definition, the amount of sunlight Sn(μ) captured by the measure μ only depends on its projection μn on the subspace perpendicular to n. In particular, if a second measure ˜μ is obtained from μ by shifting some of the mass in a direction parallel to n, then Sn(˜μ)=Sn(μ).

    Consider a positive Radon measure μ on Rd with total mass M=μ(Rd), and let Θ=[0,M]. We think of ξΘ as a Lagrangian variable, labeling a water particle.

    Definition 2.2. A measurable map

    χ:Θ×R+Rd (5)

    is called an admissible irrigation plan for the measure μ if

    (ⅰ) For every ξΘ, the map tχ(ξ,t) is Lipschitz continuous. More precisely, for each ξ there exists a stopping time T(ξ) such that, calling

    ˙χ(ξ,t)=tχ(ξ,t)

    the partial derivative w.r.t. time, one has

    |˙χ(ξ,t)|={1for a.e.t[0,T(ξ)],0fort>T(ξ). (6)

    (ⅱ) At time t=0 all particles are at the origin: χ(ξ,0)=0 for all ξΘ.

    (ⅲ) The push-forward of the Lebesgue measure on [0,M] through the map ξχ(ξ,T(ξ)) coincides with the measure μ. In other words, for every open set ARd there holds

    μ(A)= meas({ξΘ;χ(ξ,T(ξ))A}). (7)

    One may think of χ(ξ,t) as the position of the water particle ξ at time t.

    To define the corresponding transportation cost, we first compute how many particles travel through a point xRd. This is described by

    |x|χmeas({ξΘ;χ(ξ,t)=xfor somet0}). (8)

    We think of |x|χ as the total flux going through the point x. Following [13,14], we consider

    Definition 2.3. For a given α[0,1], the total cost of the irrigation plan χ is

    Eα(χ)Θ(T(ξ)0|χ(ξ,t)|α1χdt)dξ. (9)

    The α-irrigation cost of a measure μ is defined as

    Iα(μ)infχEα(χ), (10)

    where the infimum is taken over all admissible irrigation plans for the measure μ.

    Remark 2. Sometimes it is convenient to consider more general irrigation plans where, in place of (6), for a.e. t[0,T(ξ)] the speed satisfies |˙χ(ξ,t)|1. In this case, the cost (9) is replaced by

    Eα(χ)Θ(T(ξ)0|χ(ξ,t)|α1χ|˙χ(ξ,t)|dt)dξ. (11)

    Of course, one can always re-parameterize each trajectory tχ(ξ,t) by arc-length, so that (6) holds. This does not affect the cost (11).

    Remark 3. In the case α=1, the expression (9) reduces to

    Eα(χ)Θ(R+|˙χt(ξ,t)|dt)dξ=Θ[total length of the pathχ(ξ,)]dξ.

    Of course, this length is minimal if every path χ(,ξ) is a straight line, joining the origin with χ(ξ,T(ξ)). Hence

    Iα(μ)infχEα(χ)=Θ|χ(ξ,T(ξ))|dξ=|x|dμ.

    On the other hand, when α<1, moving along a path which is traveled by few other particles comes at a high cost. Indeed, in this case the factor |χ(ξ,t)|α1χ becomes large. To reduce the total cost, it is thus convenient that many particles travel along the same path.

    For the basic theory of ramified transport we refer to the monograph [1]. For future use, we recall that optimal irrigation plans satisfy

    Single Path Property. If χ(ξ,τ)=χ(ξ,τ) for some ξ,ξΘ and 0<ττ, then

    χ(ξ,t)=χ(ξ,t)forallt[0,τ]. (12)

    Another property that will be repeatedly used in the sequel is the following.

    Lemma 2.4. Let χ be an admissible irrigation plan for the measure μ. Let CRd be a closed convex set containing the origin, and let pC:RdC be the perpendicular projection. Consider the projected measure ˜μ supported on C, obtained as the push-forward of μ by the map pC. Then the composed map ˜χ(ξ,t)=pC(χ(ξ,t)) is an admissible irrigation plan for the measure ˜μ. Moreover, for every α[0,1] one has

    Eα(˜χ)Eα(χ). (13)

    If ˜μμ, then the above inequality is strict.

    Proof. The first statement is obvious. As in Lemma 5.15 in [1], the inequality (13) follows from the fact that, in the projected irrigation plan, the length of particle trajectories decreases while the multiplicity increases. Indeed,

    Eα(˜χ)Θ(T(ξ)0|˜χ(ξ,t)|α1˜χ|ddt˜χ(ξ,t)|dt)dξ=Θ(T(ξ)0|(pCχ)(ξ,t)|α1pCχ|ddt(pCχ)(ξ,t)|dt)dξΘ(T(ξ)0|χ(ξ,t)|α1χ|˙χ(ξ,t)|dt)dξ=Eα(χ).

    Combining the two functionals (4) and (10), one can formulate an optimization problem for the shape of branches:

    (OPB) Given a light intensity function ηL1(Sd1) and two constants c>0, α[0,1], find a positive measure μ supported on Rd+ that maximizes the payoff

    Sη(μ)cIα(μ). (14)

    We consider here the optimization problem for branches in the planar case d=2. We assume that the sunlight comes from a single direction n=(cosθ0,sinθ0), so that the sunlight functional takes the form (3). Moreover, as irrigation cost we take (10), for some fixed α]0,1]. For a given constant c>0, this leads to the problem

    maximize:Sn(μ)cIα(μ), (15)

    over all positive measures μ supported on the half space R2+{x=(x1,x2);x20}. To fix ideas, we shall assume that 0θ0π/2. Our main goal is to prove that for this problem the "solar panel" configuration shown in Fig. 2 is optimal, namely:

    Figure 2.  When the light rays impinge from a fixed direction n, the optimal distribution of leaves is supported on the two rays Γ0 and Γ1.

    Theorem 2.5. In dimension d=2, assume that 0θ0π/2 and 1/2α1. Then the optimization problem (15) has a unique solution. The optimal measure is supported along two rays, namely

    Supp(μ){(rcosθ,rsinθ);r0,eitherθ=0orθ=θ0+π2}Γ0Γ1. (16)

    When 0<α<1/2, the same conclusion holds if either θ0=0, or else the angle θ0 satisfies

    sinθ0122α1. (17)

    In the case α=1 the result is straightforward. Indeed, for any measure μ we can consider its projection ˜μ on Γ0Γ1, obtained by shifting the mass in the direction parallel to the vector n. In other words, for xR2 call ϕn(x) the unique point in Γ0Γ1 such that ϕn(x)x is parallel to n. Then let ˜μ be the push-forward of the measure μ w.r.t. ϕn. Since this projection satisfies |ϕn(x)||x| for every xR2+, the transportation cost decreases. On the other hand, by Remark 1 the sunlight captured remains the same. We conclude that

    Sn(˜μ)cI1(˜μ)Sn(μ)cI1(μ),

    with strict inequality if μ is not supported on Γ0Γ1.

    In the case 0<α<1, the result is not so obvious. A proof of Theorem 2.5 will be worked out in Sections 3 and 4.

    Having proved that the optimal measure μ is supported on the two rays Γ0Γ1, the density of μ w.r.t. one-dimensional measure can then be determined using the necessary conditions derived in [6]. Indeed, the density u0 of μ along the ray Γ0 provides a solution to the scalar optimization problem

    maximize:J0(u)+0sinθ0(1eu(s)/sinθ0)dsc+0(+su(r)dr)αds. (18)

    among all non-negative functions u:R+R+. Here s is the arc-length variable along Γ0.

    We write (18) in the form

    maximize:J0(u)+0[sinθ0(1eu(s)/sinθ0)czα]ds, (19)

    subject to

    ˙z=u,z(+)=0. (20)

    The necessary conditions for optimality (see for example [8,11]) now yield

    u(s)=argmaxω0{eω/sinθ0sinθ0ωq(s)}=(sinθ0)lnq(s), (21)

    where the dual variable q satisfies

    ˙q=cαzα1,q(0)=0. (22)

    Notice that, by (21), u>0 only if q<1. Combining (20) with (22) one obtains an ODE for the function qz(q), with q[0,1]. Namely

    dz(q)dq=sinθ0cαz1αlnq,z(1)=0. (23)

    This equation admits the explicit solution

    z(q)=(sinθ0c)1/α[1+qlnqq]1/α. (24)

    Inserting (24) in (22), we obtain an implicit equation for q(s):

    s=(sinθ0)1αααc1/αq(s)0[1+tlntt]1ααdt. (25)

    In turn, the density u(s) of the optimal measure μ along Γ0, as a function of the arc-length s, is recovered from (21). Notice that this measure is supported only on an initial interval [0,0], determined by

    0=(sinθ0)1αααc1/α10[1+slnss]1ααds.

    In particular, the total mass M0 along the ray Γ0 is computed setting q=0 in (24), namely

    M0=00u(s)ds=z(0)=(sinθ0c)1/α. (26)

    The density of the optimal measure along the ray Γ1 is computed in an entirely similar way. In fact, it corresponds to the special case of setting θ0=π/2 in the previous computations. Along Γ1, the optimal measure μ is supported on an initial interval [0,1], where

    1=1αc1/α10[1+slnss]1ααds,

    while the total mass is given by

    M1=c1/α. (27)

    An illustration of how the corresponding density profile u(s) looks like for different values of α is displayed in Fig. 3.

    Figure 3.  Density profile u(s) for s[0,1] along the ray Γ1 for c=1 and α=2/3,1/3.

    In the analysis of the optimization problem (OPB), the case α=0 stands apart. Indeed, the general theorem on the existence of an optimal shape proved in [7] does not cover this case.

    When α=0, a measure μ is irrigable only if it is concentrated on a set of dimension 1. When this happens, in any dimension d3 we have Sη(μ)=0 and the optimization problem is trivial. The only case of interest occurs in dimension d=2. In the following, , denotes the inner product in R2.

    Theorem 2.6. Let α=0, d=2. Let ηL1(S1) and define

    Kmax|w|=1nS1|w,n|η(n)dn. (28)

    (i) If K>c, then the optimization problem (OPB) has no solution, because the supremum of all possible payoffs is +.

    (ii) If Kc, then the maximum payoff is zero, which is trivially achieved by the zero measure.

    A proof will be given in Section 5.

    In this section we consider the optimization problem (15) in dimension d=2. As a step toward the proof of Theorem 2.5, some properties of optimal branch configurations will be derived.

    By the result in [7] we know that an optimal measure μ exists and has bounded support, contained in R2+{(x1,x2);x20}. Call M=μ(R2+) the total mass of μ and let χ:[0,M]×R+R2+ be an optimal irrigation plan for μ.

    Next, consider the set of all branches, namely

    B{xR2+;|x|χ>0}. (29)

    By the single path property, we can introduce a partial ordering among points in B. Namely, for any x,yB we say that xy if for any ξ[0,M] we have the implication

    χ(t,ξ)=yχ(t,ξ)=xfor somet[0,t]. (30)

    This means that all particles that reach the point y pass through x before getting to y.

    For a given xB the subsets of points yB that precede or follow x are defined as

    χ(x){yB;yx},χ+(x){yB;xy}, (31)

    respectively (see Fig. 4).

    Figure 4.  According to the definition (31), the set χ(x) is a curve joining the origin to the point x. The set χ+(x) is a subtree, containing all paths that start from x.

    We begin by deriving some properties of the sets χ+(x). Introducing the unit vectors e1=(1,0), e2=(0,1), we denote by Re1 the set of points on the x1-axis. As before, n=(cosθ0,sinθ0) denotes the unit vector in the direction of the sunlight. Throughout the following, the closure of a set A is denoted by ˉA, while , denotes an inner product.

    Lemma 3.1. Let the measure μ provide an optimal solution to the problem (15), and let χ be an optimal irrigation plan for μ. Then, for every xB, one has

    χ+(x)Γx{yR2+;n,y[ax,bx]}, (32)

    where axn,x, while bx is defined as follows.

    If ¯χ+(x)Re1=, then bx=ax=n,x.

    If ¯χ+(x)Re1, then

    bx=max{ax,bx},bxsup{n,z;z¯χ+(x)Re1}.

    Proof. The right-hand side of (32) is illustrated in Fig. 5. To prove the lemma, consider the set of all particles that pass through x, namely

    Figure 5.  If the set χ+(x) is not contained in the slab Γx (the shaded region), by taking the perpendicular projections π and π we obtain another irrigation plan with strictly lower cost, which irrigates a new measure ˜μ gathering exactly the same amount of sunlight. Notice that here P is the point in the closed set ¯χ+(x)Re1 which has the largest inner product with n..
    Θx{ξ[0,M];χ(τ,ξ)=xfor some τ0}.

    1. We first show that, by the optimality of the solution,

    n,χ(ξ,t)axfor allξΘx,tτ. (33)

    Indeed, consider the perpendicular projection on the half plane

    π:R2S{yR2;n,yax}.

    Define the projected irrigation plan

    χ(t,ξ){πχ(t,ξ)ifξΘx,tτ,χ(t,ξ)otherwise.

    Then the new measure μ irrigated by χ is still supported on R2+ and has exactly the same projection on En as μ. Hence it gathers the same amount of sunlight. However, if the two irrigation plans do not coincide a.e., then the cost of χ is strictly smaller than the cost of χ, contradicting the optimality assumption.

    2. Next, we show that

    n,χ(ξ,t)bxfor allξΘxtτ. (34)

    Indeed, call

    bsup{n,z;zχ+(x)}.

    If bbx, we are done. In the opposite case, by a continuity and compactness argument we can find δ>0 such that the following holds. Introducing the perpendicular projection on the half plane

    π:R2S{yR2;n,ybδ},

    one has

    {π(y);yχ+(x)}R2+. (35)

    Similarly as before, define the projected irrigation plan

    χ(t,ξ){πχ(t,ξ)ifξΘx,tτ,χ(t,ξ)otherwise.

    Then the new measure μ irrigated by χ is supported on R2+S and has exactly the same projection on En as μ. Hence it gathers the same amount of sunlight. However, if the two irrigation plans do not coincide a.e., then the cost of χ is strictly smaller than the cost of χ, contradicting the optimality assumption. This completes the proof of the Lemma.

    Based on the previous lemma, we now consider the set

    B{xB;¯χ+(x)Re1}. (36)

    It will be convenient to rotate coordinates by an angle of π/2θ0, and choose new coordinates (z1,z2) oriented as in Fig. 6. In these new coordinates, the direction of sunlight becomes vertical, while the positive x1-axis corresponds to the line

    Figure 6.  After a rotation of coordinates, the sunlight comes from the vertical direction. Here the blue lines correspond to the set B in (36)..
    S{(z1,z2);z10,z2=λz1},whereλ=tanθ0. (37)

    Calling (z1(ξ,t),z2(ξ,t)) the corresponding coordinates of the point χ(ξ,t), from Lemma 3.1 we immediately obtain

    Lemma 3.2. Let χ be an optimal irrigation plan for a solution to (15). Then

    (i) For every ξ[0,M], the map tz1(ξ,t) is non-decreasing.

    (ii) If ˉz=(ˉz1,ˉz2)B, then χ+(ˉz) is contained in a horizontal line. Namely,

    χ+(ˉz){(ˉz1,s);sR}. (38)

    To make further progress, we define

    zmax1sup{z1;(z1,z2)B}.

    Moreover, on the interval [0,zmax1[ we consider the function

    φ(z1)sup{s;(z1,s)B}. (39)

    Lemma 3.3. For every z1[0,zmax1[, the supremum φ(z1) is attained as a maximum.

    Proof. 1. Assume that, on the contrary, for some ˉz1 the supremum is not a maximum. In this case, as shown in Fig. 7, there exist a sequence of points PnP with Pn=(ˉz1,sn), P=(ˉz1,ˉz2), snˉz2. Here PnB for every n1 but PB. Without loss of generality, we can assume that all points Pn lie on distinct branches (i.e., there is no couple mn such that PmPn or PnPm). Otherwise, we could group all these points into finitely many horizontal branches. But since every horizontal branch intersects the horizontal line through P in a closed interval, this would already imply that the supremum in (39) is attained.

    Figure 7.  The construction used in the proof of Lemma 3.3..

    2. Choose two values a,b such that

    λˉz1<b<a<φ(ˉz1).

    By construction, for every n1 the set ¯χ+(Pn) intersects S. Therefore we can find points

    PnAnBn

    all in B, with

    An=(tn,a),Bn=(tn,b),ˉz1tntnzmax1.

    3. Since the total mass M is finite, we have

    n1|An|χMμ(R2+).

    We can thus find N large enough so that the amount of particles εN|AN|χ going through AN is so small that

    c(ba)αεα1N>1. (40)

    Consider the modified transport plan ˜χ, obtained from χ by removing all particles that go through the point BN. More precisely, ˜χ is the restriction of χ to the domain

    ˜ΘΘ{ξ;χ(ξ,τ)=BNfor someτ0}.

    Let ˜μ be the measure irrigated by ˜χ.

    Calling σ0>0 the total amount of particles going through BN, since ˜μμ, the total amount of sunlight gathered by the measure ˜μ satisfies

    Sn(μ)Sn(˜μ)(μ˜μ)(R2)=σ0. (41)

    We now estimate the reduction in the transportation cost, achieved by replacing μ with ˜μ. Let γ:[sA,sB]R2 be an arclength parameterization of the branch from AN to BN. Along this arc, when all the particles reaching BN are removed, the multiplicity (8) decreases from |γ(s)|χ to |γ(s)|χσ0. The transportation cost through γ is reduced in the amount

    sBsA|γ(s)|αχdssBsA(|γ(s)|χσ0)αds(sBsA)αsups|γ(s)|α1χσ0(ba)αεα1Nσ0.

    This yields

    Iα(˜μ)Eα(˜χ)Iα(μ)(ba)αεα1Nσ0. (42)

    If (40) holds, combining (41)-(42) one obtains

    Sn(μ)cIα(μ)<Sn(˜μ)cIα(˜μ).

    Hence the measure μ is not optimal. This contradiction proves the lemma.

    By the previous result, the graph of φ is contained in one single maximal trajectory of the transport plan χ. As in Figure 8, we denote this curve by γ, which provides the left boundary of the set B.

    Figure 8.  The thick portions of the curve γ are the only points where a left bifurcation can occur. If a horizontal branch σ bifurcates from Cj, all the mass on this branch can be shifted downward to another branch σ bifurcating from Cj. Furthermore, if some portion of the path γ between P and Q lies above the segment γ joining these two points, we can take a projection of γ on γ. In both cases, the transportation cost is strictly reduced..

    Along the curve γ, we now consider the set of points Cj=(z1,j,z2,j) where some horizontal branch bifurcates on the left. A property of such points is given below.

    Lemma 3.4. In the above setting, for every j, one has

    φ(s)<z2,jfor alls<z1,j. (43)

    Proof. If (43) fails, there exists another point Cj=(z1,j,z2,j) along the curve γ, with z1,j<z1,j. We can now replace the measure μ by another measure ˜μ obtained as follows. All the mass lying on the horizontal half-line {(z1,j,s);sz2,j} is shifted downward on the half-line {(z1,j,s);sz2,j}. Since the functional Sn is invariant under vertical shifts, we have Sn(˜μ)=Sn(μ). However, the transportation cost is strictly smaller: Iα(˜μ)<Iα(μ). This contradicts the optimality of μ.

    Next, as shown in Fig. 8, we consider a point P=(p1,p2)γ where the component z2 achieves its maximum, namely

    p2=max{z2;(z1,z2)γ}0. (44)

    Notice that such a maximum exists because γ is a continuous curve, starting at the origin. If this maximum is attained at more than one point, we choose the one with smallest z1-coordinate, so that

    p1=min{z1;(z1,p2)γ}. (45)

    Moreover, call

    q2inf{z2;(z1,z2)Supp(μ)},

    and let Q=(q1,q2)S be the point on the ray S whose second coordinate is q2. Recalling the notation of Lemma 3.1, we note that q1=bx for x=(0,0). We claim that, by the optimality of the solution, all paths of the irrigation plan χ must lie within the convex set

    Σ{(z1,z2);z1[0,q1],z2q2}.

    Otherwise, call π:R2Σ the perpendicular projection on the convex set Σ, and let μ be the push-forward of μ by the map π. By Lemma 2.4 the composed map

    χ(ξ,t)π(χ(ξ,t))

    is an irrigation plan for μ and satisfies Eα(χ)<Eα(χ). Hence

    Sn(μ)=Sn(μ),Iα(μ)Eα(χ)<Eα(χ)=Iα(μ),

    contradicting the optimality assumption.

    By a projection argument we now show that, in an optimal solution, all the particle paths remain below the segment γ with endpoints P and Q.

    Lemma 3.5. In the above setting, let

    γ={(z1,z2);z1=a+bz2,z2[q2,p2]}

    be the segment with endpoints P,Q. If

    (ξ,t)χ(ξ,t)=(z1(ξ,t),z2(ξ,t)) (46)

    is an optimal irrigation plan for the problem (15), then for a.e. ξΘ we have the implication

    z2(ξ,t)[q2,p2]z1(ξ,t)a+bz2(ξ,t). (47)

    Proof. 1. It suffices to show that the maximal curve γ lies below γ. If this is not the case, consider the set of particles which go through the point P and then move to the right of P, namely

    Ω={ξ[0,M];χ(ξ,t)=Pfor some t0,z2(ξ,t)<p2for t>t}. (48)

    Notice that, by the single path property (see Section 7.1 in [1]), all these particles follow the same path from the origin to P. Hence the length t of this path is the same for all ξΩ.

    2. Consider the convex region below γ, defined by

    Σ{(z1,z2);0z1a+bz2,z2[q2,p2]}.

    Let π:R2Σ be the perpendicular projection. Then the irrigation plan

    χ(ξ,t){π(χ(ξ,t))ifξΩ,t>t,χ(ξ,t)otherwise,  (49)

    has total cost strictly smaller than χ. Indeed, for all x and a.e. ξ,t we have

    |π(x)|χ|x|χ,|˙χ(ξ,t)||˙χ(ξ,t)|. (50)

    Notice that, in (50), equality can hold for a.e. ξ,t only in the case where χ=χ.

    3. We now observe that the perpendicular projection on Σ can decrease the z2-component. As a consequence, the measures μ and μ irrigated by χ and χ may have a different projections on the z2 axis. If this happens, we may have Sn(μ)Sn(μ).

    To address this issue, we observe that all particles ξΩ satisfy χ(ξ,t)=χ(ξ,t)=P. In terms of the z1,z2 coordinates, this implies

    z2(ξ,t)=z2(ξ,t)=p2,z2(ξ,T(ξ))z2(ξ,T(ξ))<p2. (51)

    By continuity, for each ξΩ we can find a stopping time τ(ξ)[t,T(ξ)] such that

    z2(ξ,τ(ξ))=z2(ξ,T(ξ)).

    Call ˜χ the truncated irrigation plan, such that

    ˜χ(ξ,t){χ(ξ,t)ifξΩ,tτ(ξ),χ(ξ,τ(ξ))ifξΩ,tτ(ξ),χ(ξ,t)ifξΩ. (52)

    By construction, the measures μ and ˜μ irrigated by χ and ˜χ have exactly the same projections on the z2-axis. Hence Sn(˜μ)=Sn(μ). On the other hand, the corresponding costs satisfy

    Eα(˜χ)Eα(χ)<Eα(χ).

    This contradicts optimality, thus proving the lemma.

    In this section we give a proof of Theorem 2.5. We recall that the functional (15) to be maximized is the difference between a payoff, i.e. the sunlight Sn(μ) absorbed by the measure μ, and the ramified transportation cost cIα(μ). Together with the measure μ, at various steps of the proof we shall construct a second measure ˜μ, obtained by shifting part of the mass in a direction parallel to n. As in Remark 1, this will not change the sunlight gathered: Sn(˜μ)=Sn(μ). On the other hand, the irrigation cost of ˜μ is strictly smaller: Iα(˜μ)<Iα(μ). We shall conclude that μ is not optimal.

    As shown in Fig. 8, let P=(p1,p2) be the point defined at (44). We consider two cases:

    (ⅰ) P=0R2,

    (ⅱ) P0.

    Assume that case (ⅰ) occurs. Then, by Lemma 3.4, the only branch that can bifurcate to the left of γ must lie on the z2-axis. Moreover, by Lemma 3.5, the path γ cannot lie above the segment with endpoints P, Q. Therefore, the restriction of the measure μ to the half space {z20} is supported on the line S. Combining these two facts we achieve the conclusion of the theorem.

    The remainder of the proof will be devoted to showing that the case (ⅱ) cannot occur, because it would contradict the optimality of the solution.

    To illustrate the heart of the matter, we first consider the elementary configuration shown in Fig. 9, left, where all trajectories are straight lines. Water is first transported from the origin to the point P. Then, an amount σ>0 is moved horizontally to the point Q, while an amount κ>0 is moved to P1. This yields a transport plan χ, which irrigates the measure μ consisting of a mass σ at Q and a mass κ at P1.

    Figure 9.  Left: an irrigation plan for a measure μ with two masses at Q and at P1. Right: an irrigation plan for a modified measure ˜μ with two masses at ˜Q and at P1. The lengths of the segments PP and PP1 will be denoted by a,b, respectively..

    Next, as shown in Fig. 9, right, we consider a point P along the segment 0P. A new transport plan ˜χ is defined, where water is first transported from the origin to P. Then, an amount σ is moved horizontally to a point ˜Q located along the same vertical line as Q. The remaining amount κ is moved in a straight line from P to P1. Notice that the new transport plan ˜χ now irrigates a measure ˜μ consisting of a mass σ at ˜Q and a mass κ at P1.

    To fix ideas, we denote the lengths of the segments PP and PP1 as

    a=|PP|,b=|P1P|. (53)

    The angles between these segments and a horizontal line will be denoted by θa,θb, respectively. The next lemma provides a comparison between the costs of the two irrigation plans χ and ˜χ.

    Lemma 4.1. Let σ0, κ>0 be given, together with angles θa[0,π/2] and θb[0,π/2[. Let χ,˜χ be the irrigation plans defined above, as shown in Fig. 9. If 0<α<1/2 and θb satisfies the additional bound

    cosθb>122α1, (54)

    or if α1/2, then there exists ε>0 such that a/bε implies

    Eα(˜χ)<Eα(χ). (55)

    Proof. 1. To compute the difference between the quantities in (55), notice that the old transportation cost along PP and PP1,

    (κ+σ)αa+καb

    is replaced by the new cost

    κα2a+2b2abcos(θa+θb)+σαacosθa. (56)

    Notice that the last term in (56) accounts for the fact that an amount σ of particles need to cover a longer horizontal distance, traveling along the segment P˜Q instead of PQ.

    The difference in the cost is thus expressed by the function

    f(a,b)=Eα(χ)Eα(˜χ)=(κ+σ)αaσαacosθa+κα[b2a+2b2abcos(θa+θb)].

    2. Introducing the variables

    ε=ab,=b,ε=a,

    we obtain

    f(ε,)=[ε(κ+σ)αεσαcosθa+κα(11+ε22εcos(θa+θb))]=ε[(κ+σ)ασαcosθa+καcos(θa+θb)+O(1)ε]. (57)

    Setting

    λ=σκ+σ[0,1[,

    we are thus led to study the function

    F(λ,θa,θb)1λαcosθa+(1λ)αcos(θa+θb) (58)

    and to find conditions which imply the positivity of F.

    3. The function F in (58) can be written in terms of an inner product:

    F(λ,θa,θb)=1cosθa[λα(1λ)αcosθb]sinθa(1λ)αsinθb=1(cosθa,sinθa),(λα(1λ)αcosθb,(1λ)αsinθb). (59)

    To prove that F>0 it thus suffices to show that the second vector on the right hand side of (59) has length smaller than one, namely

    λ2α+(1λ)2α2λα(1λ)αcosθb<1.

    This inequality holds provided that

    cosθb>λ2α+(1λ)2α12λα(1λ)α. (60)

    Two cases must be considered. If α1/2, then

    λ2α+(1λ)2α1for allλ[0,1].

    Hence (60) trivially holds for all θb<π/2.

    On the other hand, if α<1/2, consider the function

    g(λ)λ2α+(1λ)2α12λα(1λ)α=1+(λα(1λ)α)212λα(1λ)α.

    We observe that, for 0α12, one has

    0g(λ)g(12)=122α1, (61)

    while

    limλ0+g(λ)=limλ1g(λ)=0.

    From (61) it now follows that the condition (54) guarantees that (60) holds, hence F0, as required.

    Summarizing the previous analysis, for any λ]0,1[ and θa[0,π/2], we have proved:

    (ⅰ) When α1/2, one has F(λ,θa,θb)>0 for all θb[0,π/2[.

    (ⅱ) When 0<α<1/2 one has F(λ,θa,θb)>0 provided that θb satisfies the additional bound (54).

    4. Combining (57) with (58), we obtain

    f(θa,θb)=a(κ+σ)α[F(λ,θa,θb)+O(1)ab]. (62)

    By the previous step, in both cases (ⅰ) and (ⅱ) the right hand side of (62) is strictly positive provided that the ratio a/b is sufficiently small. This yields (55).

    We now consider a more general irrigation plan χ, shown in Fig. 10. Water is transported from the origin along a straight path γ, up to the point P. Then the flux is split into a finite number of straight paths. One goes horizontally to the left, with flux σ0, reaching a point Q. The other paths go to the right, with fluxes κ1,,κn>0, at angles

    Figure 10.  A more general configuration, considered in Lemma 4.2..
    0θn<<θ2<θ1, (63)

    until they reach points P1,,Pn. This provides an irrigation plan for the measure concentrating a mass σ at the point Q and masses κ1,,κn at the points P1,,Pn. As shown in Fig. 10, we assume that all points Pi lie on the same straight line ˜γ, which intersects γ at a point P.

    We compare this configuration with a modified irrigation plan ˜χ defined as follows. First, the plan ˜χ moves all the mass from the origin along the straight line γ up to the point P. Then an amount of mass σ is moved horizontally to the left, until it reaches a point ˜Q on the same vertical line as Q. The remaining mass κ=κ1++κn is moved along the segment ˜γ, until it reaches the various points P1,,Pn. Notice that ˜χ is an irrigation plan for a measure ˜μ which concentrates a mass σ at the point ˜Q and masses κ1,,κn at the points P1,,Pn. As shown in Fig. 10, we call θa[0,π/2] the angle between γ and a horizontal line, and let β[0,π/2[ be the angle between ˜γ and a horizontal line.

    Lemma 4.2. Let the masses σ0 and κ1,,κn>0 be given, together with angles θa[0,π/2] and θi[0,π/2[ as in (63). Let χ,˜χ be the irrigation plans defined above, as shown in Fig. 10. If 0<α<1/2 and θ1 satisfies the additional bound

    cosθ1>122α1, (64)

    or if α1/2, then there exists ε>0 such that 0<βθ1<ε implies

    Eα(χ)Eα(˜χ)>0. (65)

    Proof. 1. The left-hand side of (65), describing the difference between the old and the new transportation cost, can be expressed as

    |PP|(σ+nj=1κj)α+nj=1καj|PPj|σαcosθa|PP|nj=1(ji=1κi)α|Pj+1Pj|, (66)

    where, for notational convenience, we set Pn+1P. According to (66) we can write

    Eα(χ)Eα(˜χ)=A+Sn, (67)

    where

    A|PP|[(σ+nj=1κj)ασαcosθa]+(nj=1κj)α(|PP1||PP1|), (68)
    Sn=nj=1καj|PPj|(nj=1κj)α(|PP1||Pn+1P1|)nj=1(ji=1κi)α|Pj+1Pj|. (69)

    2. Notice that the quantity A in (68) would describe the difference in the costs if all the mass κ=κ1++κn were flowing through the point P1. We claim that

    A|PP|[(σ+κ)ασαcosθa+καcos(θa+θ1)κα2|PP||P1P|]. (70)

    Indeed, the last two terms within the square brackets in (70) are derived from

    |PP1||PP1|=|PP1|[112|PP||PP1|cos(θa+θ1)+|PP|2|PP1|2]|PP1|[1(1|PP||PP1|cos(θa+θ1)+|PP|22|PP1|2)].

    Using Lemma 4.1, we can now choose ε>0 small enough such that, if

    |PP||P1P|<ε, (71)

    then the right hand side of (70) is strictly positive. It now suffices to observe that, given all the angles θa,θ1,,θn, by choosing ε>0 small enough one achieves the implication

    βθ1<ε|PP||P1P|<ε. (72)

    In turn, this implies the strict inequality

    A>0. (73)

    3. To complete the proof of the lemma, it remains to prove that Sn0. This will be proved by induction on n. Starting from (69) and using the inequalities

    |PnP1||PP1|,(ni=1κi)ακαn+(n1i=1κi)α,

    we obtain

    Sn=nj=1καj|PPj|(nj=1κj)α(|PP1||PnP1|)0n1j=1(ji=1κi)α|Pj+1Pj|καn|PPn|+n1j=1καj|PPj|(καn+(n1j=1κj)α)(|PP1||PnP1|)(n1i=1κi)α|PnPn1|n2j=1(ji=1κi)α|Pj+1Pj|=n1j=1καj|PPj|(n1j=1κj)α(|PP1||Pn1P1|)n2j=1(ji=1κi)α|Pj+1Pj|+καn(|PPn|+|PnP1||PP1|)=Sn1+καn(|PPn||PP1|+|PnP1|)Sn1, (74)

    where in the second equality we have used |Pn1P1|=|PnP1||PnPn1|. Repeating this same argument, by induction we obtain

    SnSn1S1.

    Observing that

    S1=κα1|PP1|κα1(|PP1||P2P1|)κα1|P2P1|=0,

    the proof of the lemma is completed.

    Remark 4. As soon as all the masses σ,κ1,,κn and all the angles θa,β,θ1,,θn have been assigned, the difference between the two irrigation costs in (65) is a positive homogeneous function of the distance |P1P|. We can thus replace (65) with the inequality

    Eα(χ)Eα(˜χ)>c0|P1P|, (75)

    for some c0>0 depending on all the above constants. Notice that, by continuity, the bound (75) remains valid if θa is replaced by some other angle θa, with |θaθa| sufficiently small.

    Let μ be an optimal measure, maximizing the functional (15), and let χ:Θ×R+R2 be an optimal irrigation plan for μ. According to (6), we assume that all paths are parameterized by arc-length.

    As remarked at the beginning of this section, a proof of Theorem 2.5 can be achieved by showing that, for an optimal solution, the point P=(p1,p2) introduced at (44) must coincide with the origin. We recall that by definition we must necessarily have p20 since the maximal curve γ contains the origin. Moreover, p2=0 implies p1=0, since by a projection argument, this leads to a lower irrigation cost. Throughout the following we shall thus assume p2>0 and derive a contradiction.

    1. Call

    Θ{ξΘ;χ(ξ,t)=Pfor somet>0} (76)

    the set of particles that move through P. Notice that, by the single path property, there exists a unique path γ:[0,t]R2 such that

    γ(0)=0,γ(t)=P,χ(ξ,t)=γ(t)for allξΘ,t[0,t]. (77)

    As a consequence, in (76) the time t is the same for all ξΘ.

    Within the set Θ of all particles reaching P, we distinguish the ones which proceed to the left or to the right of P, namely

    Θ=ΘlΘr. (78)

    Here Θl denotes the set of particles that, after reaching P, move along the horizontal line {(z1,z2);z1=p1,z2>p2} to the left of P. Moreover, Θr=ΘΘl is the set of particles which, after reaching P, move to the right. For all ξΘr and t>t, we thus have

    χ(t,ξ){(z1,z2);z1p1,z2p2}. (79)

    For future use, we denote

    σmeas(Θl),κmeas(Θr). (80)

    2. In connection with the path γ at (77), consider the set (the shaded region in Fig. 11)

    Figure 11.  Left: in the shaded region Δ above the curve γ, the measure μ cannot concentrate any mass. Otherwise, by shifting this mass downward until it hits a point on γ, we would obtain a second measure ˜μ which gathers the same amount of sunlight, but has a lower irrigation cost. As a consequence, by the interior regularity property, the flow out of P is locally supported on a finite number of line segments. Right: the construction used in steps 4–6 of the proof of Theorem 2.5..
    Δ{(z1,z2);there existsˆz1<z1andt[0,t]such that(ˆz1,z2)=γ(t)}. (81)

    We claim that the measure μ cannot concentrate any mass on the open set Δ. Indeed, if μ(Δ)>0, then we consider the measure ˆμ obtained by vertically shifting all the mass in Δ until it touches some point on the curve Γ. More precisely, let ϕ:Δ{γ(t);t[0,t]} be a measurable map such that ϕ(z1,z2)=(ˆz1,z2), with ˆz1 as in (81). Furthermore, outside the set Δ we extend the map by the identity, that is, ϕ(z1,z2)=(z1,z2). Let ˆμ be the push-forward of the measure μ by the map ϕ. This new measure μ would then satisfy

    Sn(ˆμ)=Sn(μ),Iα(ˆμ)<Iα(μ),

    contradicting the optimality of μ.

    3. The previous argument shows that there are no sinks inside Δ. Hence all particles ξΘr continue to move to the right of P, eventually crossing the z1-axis. For ξΘr we can thus define the stopping time

    τ(ξ)min{t>t;χ(ξ,t)=(z1,0)for somez1p1},

    and introduce the measure ˉμ, supported on the z1-axis, defined by

    ˉμ(V)=meas{ξΘr;χ(ξ,τ(ξ))V}.

    We observe that the restriction of χ to the set

    {(ξ,t);ξΘr,t[t,τ(ξ)]}

    yields an optimal transport plan from a point mass located at P to the measure ˉμ.

    By the interior regularity property (see Theorem 8.16 in [1], or Theorem 4.10 in [19]), outside a neighborhood of the support of ˉμ, the optimal transport plan is supported on a finite union of line segments. In particular, restricted to the set {z2>p2/2}, all paths χ(ξ,), with ξΘr, t>t are contained within finitely many line segments.

    4. By the previous step, within a neighborhood of P, all particle paths which move out of P are contained in finitely many straight lines starting at P.

    Adopting the same notation used in Lemma 4.2, we call σ=meas(Θl) the amount of mass which moves horizontally to the left of P. As in (63), we call θ1,,θn the angles formed by the line segments to the right of P with a horizontal line (see Fig. 11, right). The fluxes along these line segments are denoted by κ1,,κn. We introduce the decomposition

    Θr=Θ1Θn, (82)

    where Θi denotes the set of particles ξΘr that move along the i-th segment. Notice that, with this notation, one has κi=meas(Θi).

    We recall that, by Lemma 3.5, all particle paths χ(ξ,t), ξΘr, lie below the segment γ with endpoints P, Q. This implies that all angles θ1,,θn are strictly smaller than π2θ0. By the assumption (17), we are led to consider two cases.

    Case 1: 1/2α1 and 0θ1<π/2,

    Case 2: 0<α<1/2 and

    cosθ1>cos(π2θ0)=sinθ0122α1. (83)

    5. In this step, under the assumption that p2>0, we construct a competing measure ˜μ. Using Lemma 4.2, this will eventually allow us to conclude that the measure μ is not optimal.

    For t<t, consider the unit vector

    w(t)=γ(t)γ(t)|γ(t)γ(t)|.

    By compactness, there exists an increasing sequence tνt such that

    limνw(tν)=ˉw, (84)

    for some unit vector ˉw=(ˉw1,ˉw2), with ˉw10, ˉw20. Call θa[0,π/2] the angle between ˉw and a horizontal line.

    In connection with the masses σ,κ1,,κn and the angles θ1,,θn defined above, we now choose an angle β>θ1, sufficiently close to θ1, so that the conclusion of Lemma 4.2 holds. In particular, by Remark 4 the inequality (75) holds.

    Next, we choose ν1 sufficiently large (its precise value will be determined later), and consider the point P=(p1,p2)=γ(tν). Again referring to Fig. 11, right, we denote by ˜γ the straight line through P, forming an angle β with a horizontal line. As in Lemma 4.2, we denote by P1,,Pn the points where ˜γ intersects the line segments through P, forming angles 0θn<<θ1 with a horizontal line.

    A new measure ˜μ and a new irrigation plan ˜χ are now defined as follows.

    ● The measure ˜μ is obtained from μ by vertically shifting all the mass located on the horizontal line to the left of P downward on the horizontal line to the left of P. More precisely, ˜μ is the push-forward of μ by the map

    ϕ(z1,z2)={(p1,z2)ifz1=p1,z2>p2,(z1,z2)otherwise.

    ● Recalling (78), for ξΘ we simply set ˜χ(ξ,t)=χ(ξ,t) for all t0.

    ● Particles ξΘl move along the path γ up to the point P. Then the move horizontally to the left of P, stopping at a point ˜χ(ξ,˜T(ξ)) on the same vertical line as χ(ξ,T(ξ)).

    ● Particles ξΘr move along the path γ up to the point P. Then they move along ˜γ until they reach the corresponding points P1,,Pn. Afterwards, the remaining portions of their trajectories are exactly as before.

    6. By construction we have Sn(˜μ)=Sn(μ). To analyze the cost of the new irrigation plan ˜χ, consider the set

    Θν{ξΘΘ;χ(ξ,tν)=γ(tν)=P}.

    This is the set of particles that go through P, but do not reach P afterwards: either they stop along γ, or they move to some other branch bifurcating from γ before reaching P.

    We observe that, in the case where Θν=, one can immediately apply Lemma 4.2 and conclude

    Iα(˜μ)Eα(˜χ)<Eα(χ)=Iα(μ). (85)

    The following analysis will show that the same conclusion can still be reached, provided that P is sufficiently close to P and

    δνmeas(Θν) (86)

    is sufficiently small. For future use, we observe that

    limνtν=t,limνδν=0. (87)

    We are now ready to estimate the difference between the two irrigation costs, in the general case.

    (1) For ξΘΘν, we have

    χ(ξ,t)=˜χ(ξ,t),|χ(ξ,t)|χ=|˜χ(ξ,t)|˜χ (88)

    for all t>0. Hence these particles do not contribute to the difference in the transportation cost.

    (2) For ξΘν, the first identity in (88) still holds for all t>0. However, the second one holds only for t[tν,τ(ξ)], where

    τ(ξ)=sup{t[tν,T(ξ)];χ(ξ,t)=γ(t)}<t

    is the time when the particle ξ either stops, or leaves the path γ. We estimate the difference

    AΘντ(ξ)tν(|˜χ(ξ,t)|α1˜χ|χ(ξ,t)|α1χ)dtdξΘντ(ξ)tν|˜χ(ξ,t)|α1˜χdtdξ[meas(Θν)]α(ttν). (89)

    (3) It remains to estimate the difference in the cost for transporting particles ξΘ, namely

    BΘ(˜T(ξ)0|˜χ(ξ,t)|α1˜χdtT(ξ)0|χ(ξ,t)|α1χdt)dξ. (90)

    The estimate of B is based on the following observation. If the portion of the curve γ between P and P were a straight segment, and if on this segment the multiplicity were constantly equal to σ+κ, then we could use Lemma 4.2 and Remark 4. By (75) we could thus conclude

    Bc0|P1P|. (91)

    In the general case, recalling (86), the multiplicity along γ is estimated by

    σ+κ|γ(t)|χσ+κ+δνfor allt[tν,t].

    The presence of the additional particles ξΘν increases the multiplicity and hence reduces the cost of χ. The amount by which this cost is reduced can be bounded above by

    Θttν[(σ+κ)α1(σ+κ+δν)α1]dtdξ=[(σ+κ)α1(σ+κ+δν)α1](σ+κ)(ttν). (92)

    On the other hand, the fact that the curve γ is not necessarily a straight line increases the cost of χ in an amount which is bounded below by

    (σ+κ)(σ+κ+δν)α1((ttν)|PP|). (93)

    Combining all the previous observations, from (89), (91), (92), and (93), we conclude

    Eα(˜χ)Eα(χ)δαν(ttν)c0|P1P|+[(σ+κ)α1(σ+κ+δν)α1](σ+κ)(ttν)(σ+κ)(σ+κ+δν)α1((ttν)|PP|). (94)

    We claim that, for some choice of ν1 large enough, the right hand side of (94) becomes negative, thus contradicting the optimality of the measure μ. We consider two cases.

    Case 1: (ttν)2|γ(tν)P| for infinitely many integers ν1. When this inequality holds, (94) yields

    Eα(˜χ)Eα(χ)2δαν|γ(tν)P|c0|P1P|+[(σ+κ)α1(σ+κ+δν)α1]2(σ+κ)|γ(tν)P|. (95)

    We now observe that the limit (84) implies an inequality of the form

    |γ(tν)P|C|P1P|,

    for a suitable constant C and all ν sufficiently large. Therefore, as δν0, it is clear that the right hand side of (95) becomes negative. This contradicts the optimality of μ.

    Case 2: (ttν)2|γ(tν)P| for infinitely many integers ν1. When this inequality holds, (94) yields

    Eα(˜χ)Eα(χ)δαν(ttν)+[(σ+κ)α1(σ+κ+δν)α1](σ+κ)(ttν)(σ+κ)(σ+κ+δν)α112(ttν). (96)

    When δν is sufficiently small, the right hand side of (96) becomes negative. Once again, this contradicts the optimality of μ.

    We give here a proof of Theorem 2.6.

    1. Assume that there exists a unit vector wR2 such that

    K=nS1|w,n|η(n)dn>c.

    Let v=(cosβ,sinβ) be a unit vector perpendicular to w, with β[0,π]. Let μ be the measure supported on the segment {rv;r[0,]}, with constant density λ w.r.t. 1-dimensional Lebesgue measure.

    Then the payoff achieved by μ is estimated by

    Sη(μ)cI0(μ)=S1(1exp{λ|w,n|})|w,n|η(n)dnc
    (1eλ)S1|w,n|η(n)dnc=[(1eλ)Kc]. (97)

    By choosing λ>0 large enough, the first factor on the right hand side of (97) is strictly positive. Hence, by increasing the length , we can render the payoff arbitrarily large.

    2. Next, assume that Kc. Consider any Lipschitz curve sγ(s), parameterized by arc-length s[0,]. Then, for any measure μ supported on γ, the total amount of sunlight from the direction n captured by μ satisfies the estimate

    Sn(μ)0|˙γ(s),n|ds.

    Indeed, it is bounded by the length of the projection of γ on the line En perpendicular to n. Integrating over the various sunlight directions, one obtains

    Sη(μ)0S1|˙γ(s),n|η(n)dndsK.

    More generally, μ=iμi can be the sum of countably many measures supported on Lipschitz curves γi. In this case, since the sunlight functional is sub-additive, one has

    Sη(μ)iSη(μi)iKi.

    Hence

    Sη(μ)cI0(μ)iKicii0.

    This concludes the proof of case (ⅱ) in Theorem 2.6.

    We first clarify the role of the assumption (17), used in Theorem 2.5 when 0<α<1/2.

    Consider the problem of irrigating two masses M0,M1>0 from the origin. Then, as shown in Fig. 12, left, the optimal bifurcation angle satisfies

    Figure 12.  Changing the transport plan, when θ0>0 is very small. If in the irrigation problem the bifurcation angle satisfies θ>θ0+π2, then the original configuration, where all the mass is supported along Γ0Γ1, would not be optimal. The analysis at (102) shows that this situation never happens..
    cosθ=1λ2α(1λ)2α2λα(1λ)α,λ=M0M0+M1. (98)

    For a proof, see Lemma 12.2 of [1]. As a consequence, we have the implications

    12<α1cosθ]0,22α11],α=12cosθ=0,0α<12cosθ[22α11,0[.

    Notice that cosθ=22α11 when M0=M1 and hence λ=1/2. As a consequence, regardless of the relative sizes of M0,M1, we have:

    ● When α1/2, a bifurcation with an angle θ>π/2 cannot be optimal.

    ● When α<1/2, a bifurcation with an angle θ such that cosθ<22α11 cannot be optimal.

    This is the underlying motivation for the assumption (17), repeatedly used in the proofs. Notice that a similar assumption (54) was introduced in Lemma 4.1.

    It is interesting to speculate whether the conclusion of Theorem 2.5 may still hold when α<1/2 while the angle θ0>0 is arbitrarily small. Consider any measure μ supported on the two half-lines Γ0Γ1 as shown in Fig. 12, right. The necessary conditions derived for the problem (18) allow us to compute the total mass concentrated by the measure μ on each of these half-lines. Indeed, according to (26) and (27), we have

    M0μ(Γ0)=(sinθ0c)1/α,M1=μ(Γ1)=(1c)1/α. (99)

    Therefore

    λ=M0M0+M1=(sinθ0)1/α1+(sinθ0)1/α,sinθ0=λα(1λ)α. (100)

    In order for this configuration to be optimal, a necessary condition is

    cosθ=1λ2α(1λ)2α2λα(1λ)αcos(θ0+π2)=sinθ0. (101)

    Indeed, if (101) fails, a better configuration could be constructed as shown in Fig. 12, right. Here A and B are points along Γ0 and Γ1 respectively, at distance ε>0 from the origin, while P is a suitable point such that the angle between PA and PB equals θ. To uniquely determine P, we again refer to the necessary conditions in Lemma 12.2 of [1]. Replacing the segments 0A and 0B with the three segments 0P, PA, and PB, we can obtain a new configuration where the transportation cost is reduced by O(1)ε, while keeping the same value of the sunlight functional. Therefore, our initial configuration where the measure μ is supported on Γ0Γ1 would not be optimal.

    The inequality (101) is precisely what is needed to rule out this possibility. Namely, if (101) holds, then the point P cannot lie inside the sector bounded by Γ0 and Γ1. Recalling (100), we can write (101) in the form

    1λ2α(1λ)2α2λα(1λ)αλα(1λ)α.

    Equivalently:

    ϕ(λ)(1λ)2αλ2α10. (102)

    We observe that ϕ(0)=0 while ϕ(1)=2. In addition,

    ϕ(λ)=2α[(1λ)2α1+λ2α1]<0

    for 0<λ<1. This implies that ϕ(λ)<0 for 0<λ<1. Therefore, the necessary conditions for optimality (101) are always satisfied, even when the angle θ0 is very small.

    We conclude this paper by discussing possible extensions of our results.

    (I) Motivated by the previous analysis, we conjecture that the conclusion of Theorem 2.5 remains valid even without the assumption (17). Namely, for all 0<α<1/2 and every θ0[0,π/2], the optimal measure μ is still supported on the union of the two rays Γ0Γ1. To achieve a proof, however, an additional argument will be needed. More specifically, the assumption (54) in Lemma 4.1 can be removed only by imposing some additional restriction on the value of λ=σκ+σ[0,1]. Our construction in Section 4, however, does not yield such information.

    (II) In Theorem 2.5 it was assumed that sunlight comes from one single direction. In the case considered at (4), where sunlight comes with varying intensity from different directions, one may conjecture that a similar result still holds true. This guess seems very reasonable if the support of the function ηL1(S1) is contained within a small sector, say [θ0δ,θ0+δ]. We remark, however, that proving such a result will require a substantially different approach. In the proof of Theorem 2.5, we repeatedly used the fact (highlighted in Remark 1) that, shifting part of the mass of μ along the direction n of sunlight, one obtains a new measure ˜μ which collects exactly the same amount of sunlight: Sn(˜μ)=Sn(μ). This crucial property fails as soon as we replace Sn with Sη, allowing sunlight to come from different directions.

    (III) It would be interesting to analyze the optimal branch configuration in three space dimensions. To fix ideas, assume that sunlight comes from the direction parallel to n=(cosθ0,0,sinθ0), and call e=(0,0,1) the unit vector in the vertical direction. Then it is easy to see that the optimal measure μ must be supported within the convex closure of the two half-planes

    Γ0{vR3;v,n0,v,e=0},Γ1{vR3;v,n=0,v,e0}.

    In addition, the Hausdorff measure of Supp(μ) must be 2. Otherwise, the collected sunlight would be Sn(μ)=0. A challenging question is whether the support of μ is indeed contained in a two-dimensional surface. In this case, the optimal irrigation plan should have a structure similar to the one studied in [16].

    The research of the first author was partially supported by NSF with grant DMS-1714237, "Models of controlled biological growth". The research of the second author was partially supported by a grant from the U.S.-Norway Fulbright Foundation.



    [1] S. Wolfram, Wolfram language & system documentation center, Wolfram Research Inc., Champaign, IL, US, 12Eds., 2019.
    [2] X. S. Gao, Geoexpert, Beijing, 1998. Available from: http://www.mmrc.iss.ac.cn/gex/.
    [3] L. D. Moura, S. Ullrich, The lean 4 theorem prover and programming language, Autom. Deduction -CADE, 2021,625–235. http://doi.org/10.1007/978-3-030-79876-5_37 doi: 10.1007/978-3-030-79876-5_37
    [4] L. D. Moura, N. Bjørner, Z3: An efficient smt solver, In: Tools and Algorithms for the Construction and Analysis of Systems, 4963 (2008), 337–340. http://doi.org/10.1007/978-3-540-78800-3_24
    [5] W. W. Li, Daishuxue Fangfa, 1 Ed, High Education Press, Beijing, 2019. ISBN 978-7-04-050725-6.
    [6] H. Ebbinghaus, Memory: A contribution to experimental psychology, Teachers College, Columbia University, New York City, 1913. Available from: https://archive.org/details/memorycontributi00ebbiuoft/page/n5/mode/2up.
    [7] K. Entacher, A collection of selected pseudorandom number generators with linear structures, 1997. Available from: https://www.semanticscholar.org/paper/6ae5fe88d296e70f188b0d12207d468c8f36e262.
    [8] A. S. Tanenbaum, Operating systems: Design and implementation (volume 1), Publishing House of Electronics Industry, Beijing, 3 Eds., 2015. ISBN 978-7-121-26193-0.
    [9] Z. J. Wang, The defqed repository, 2022. Available from: https://github.com/ZijianFelixWang/DefQed.
    [10] Z. J. Wang, Benchmark of the defqed algorithm, 2022. Available from: https://github.com/ZijianFelixWang/DefQed-Benchmark.
    [11] H. Packard, The hp zbook 14u g5 specifications, 2018. https://support.hp.com/us-en/document/c05873311.
  • This article has been cited by:

    1. Uliana Vladimirovna Monakhova, Orbital stabilization of dynamically elongated small satellite using active magnetic attitude control, 2024, 20712898, 1, 10.20948/prepr-2024-5
    2. Dmitry Roldugin, Anna Okhitina, Uliana Monakhova, Mikhail Ovchinnikov, Comparison of Feedback Three-Axis Magnetic Attitude Control Strategies, 2023, 10, 2226-4310, 975, 10.3390/aerospace10120975
  • Reader Comments
  • © 2023 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(4785) PDF downloads(1309) Cited by(0)

Figures and Tables

Figures(4)  /  Tables(2)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog