Effective planning horizon narrow class

Theorem of effective horizon equivalence

Let JR:ΠR be a return function, π=argmaxπJR(π), the sequence {πk}kN is fixed, and JR(π)JR(π0). We define:

Heff(R,ε)=min{k:JR(π)JR(πk)JR(π)JR(π0)ε}

Then we prove that:

(ε>0:Heff(R,ε)=Heff(R,ε))a0,bR:JR(π)=aJR(π)+bπ{π,π0}{πk}kN

Lemma

Let JR(π)JR(π0)0. Then:

(ε>0:Heff(R,ε)=Heff(R,ε))kN:f(k,R)=f(k,R)

where f(k,R):=JR(π)JR(πk)JR(π)JR(π0).

Proof

(): Suppose k:f(k,R)=f(k,R). Then for every ε, {k:f(k,R)ε}={k:f(k,R)ε}, hence ε>0:Heff(R,ε)=Heff(R,ε).

(): Assume there exists the smallest k0 such that f(k0,R)f(k0,R). Without loss of generality, let f(k0,R)<f(k0,R) (the case > is symmetric). Choose:

ε0(f(k0,R),f(k0,R))

Then k0 is included in the set {k:f(k,R)ε0}, but not in {k:f(k,R)ε0}. Consequently:

Heff(R,ε0)k0<Heff(R,ε0)at ε=ε0: Heff(R,ε0)Heff(R,ε0)

From necessity and sufficiency, the lemma is proven.


Now, based on the lemma, it suffices to prove:

(k:f(k,R)=f(k,R)) a0,b:JR(π)=aJR(π)+b π{π,π0}{πk}kN

Let's introduce the notation: J:=JR, J:=JR, Δk:=J(π)J(πk), Δ0:=J(π)J(π0)0.

(): Suppose J(π)=aJ(π)+b for all π{π,π0}{πk}, with a0. Then for any k:

J(π)J(πk)=(aJ(π)+b)(aJ(πk)+b)=a(J(π)J(πk))=aΔkJ(π)J(π0)=a(J(π)J(π0))=aΔ0

Since a0, the denominator aΔ00, and:

f(k,R)=aΔkaΔ0=ΔkΔ0=f(k,R)

(): Suppose kN:f(k,R)=f(k,R). This means:

(1)J(π)J(πk)J(π)J(π0)=J(π)J(πk)J(π)J(π0)

Where J(π)J(π0), since otherwise f(k,R) would be undefined for all k, contradicting the assumption k:f(k,R)=f(k,R).

Let's define:

a:=J(π)J(π0)J(π)J(π0)b:=J(π)aJ(π)

From (1), by multiplying both sides by aΔ0:

J(π)J(πk)=a(J(π)J(πk))J(πk)=J(π)aJ(π)+aJ(πk)J(πk)=aJ(πk)+b

We also separately check the cases with π and π0:

aJ(π)+b=aJ(π)+J(π)aJ(π)=J(π)

From the definition of a, we have J(π0)=J(π)aΔ0=J(π)a(J(π)J(π0))=aJ(π0)+b.

Thus, from necessity and sufficiency, the relation J(π)=aJ(π)+b is proven for all π{π,π0}{πk}kN, where a0, meaning J is an affine transformation of J on the specified set.

Since the proof establishes that ε>0:Heff(R)=Heff(R) if and only if JR is an affine transformation of JR (a0) on π,π0πkkN, and STARC-equivalence requires JR=aJR+b with a>0 on the entirety of Π, it follows that STARC-equivalence is a strictly stronger condition. In particular, [R]STARC[R]Heff, because any a>0 is a special case of a0, and the condition on the entirety of Π implies the condition on a subset.


Counterexample to the Pointwise Implication

We show that replacing ε>0 with ε>0 breaks the theorem: we construct explicit J,J for which the values Heff(R,ε0) and Heff(R,ε0) coincide at one specific ε0, but J is not an affine transformation of J on {π,π0}{πk}kN.

Let us define

J(π)=1,J(πk)=kk+1(k0).

Then J(π0)=0, J(πk)[0,1) for all k, and J(πk)1, so π=argmaxπJ(π) and the condition J(π)J(π0)=10 holds. A direct computation gives

f(k,R)=J(π)J(πk)J(π)J(π0)=1k/(k+1)1=1k+1.

Take ε0=2/5. The condition 1/(k+1)2/5 holds for k3/2, that is, Heff(R,ε0)=2.

Now define J on the same Π:

J(π)=1, J(π0)=0, J(π1)=25, J(π2)=710, J(πk)=1110(k1) for k3.

All values lie in [0,1), so π=argmaxJ and J(π)J(π0)=10. We compute the ratios:

f(0,R)=1,f(1,R)=35,f(2,R)=310,f(k,R)=110(k1)120 for k3.

For ε=ε0=2/5 we have f(0,R)=1>2/5, f(1,R)=3/5>2/5, f(2,R)=3/102/5. Hence

Heff(R,ε0)=2=Heff(R,ε0).

We show that there is no affine relation. Suppose J(π)=aJ(π)+b on the entire set {π,π0}{πk}. From J(π)=J(π)=1 and J(π0)=J(π0)=0 we get b=0 and a=1, that is, J(π)=J(π). But J(π1)=2/51/2=J(π1), so we have a contradiction.


Theorem of extension to dense subsets of ε

Fix R,R for which f(k,R),f(k,R) are well-defined. Introduce the notation ϕR(ε):=Heff(R,ε)N{+}, setting ϕR(ε)=+ if {k:f(k,R)ε}=. The function ϕR is non-increasing on (0,).

Let E(0,) be dense in (0,). Then

(i) εE:ϕR(ε)=ϕR(ε)(ii) ε>0:ϕR(ε)=ϕR(ε)

Combined with the original lemma, this yields the equivalence of (i) with the affinity JR=aJR+b, a0, on {π,π0}{πk}.

Proof

The implication (ii)(i) is trivial.

We show (i)(ii). By contradiction suppose there exists ε>0 with ϕR(ε)ϕR(ε). Without loss of generality ϕR(ε)<ϕR(ε). Denote n:=ϕR(ε)N.

By the definition of ϕR(ε)=n we have f(n,R)ε. From the inequality ϕR(ε)>n, for all k{0,1,,n} we have f(k,R)>ε. Set

m:=min0knf(k,R)(ε,+].

The minimum is over a finite set, and each term is strictly greater than ε, so the minimum is also strictly greater than ε. Take any ε(ε,m). Since f(k,R)m>ε for all kn, we have ϕR(ε)>n.
On the other hand, f(n,R)ε<ε, so n{k:f(k,R)ε} and ϕR(ε)n. In total:

ε(ε,m):ϕR(ε)n<ϕR(ε).

The interval (ε,m) is non-empty and open in (0,). By density of E there exists ε0E(ε,m). Then ϕR(ε0)ϕR(ε0), which contradicts (i).

Sharpness of the Density Condition

We can also show that the density of E in (0,) cannot be weakened without losing the theorem for all admissible R,R.

Suppose E is not dense: there exists an open interval (α,β)(0,) with E(α,β)=. Without loss of generality β<1 (otherwise shift the interval inside (0,1), which preserves the property of not intersecting E for a suitable subinterval; the informative zone of ϕ lies precisely in (0,1), since f=1 gives ϕ0 for ε1).

Choose cRcR inside (α,β). Define the returns via the values of f:

f(0,R)=f(0,R)=1,f(1,R)=cR,f(1,R)=cR,f(k,R)=f(k,R)=α/2 for k2.

The corresponding J,J are obtained as J(π)=J(π)=1, J(π0)=J(π0)=0, J(πk)=1f(k,R), J(πk)=1f(k,R). All values J(πk),J(πk) lie in [0,1), so π remains the argmax for both returns, and the conditions of the lemma are satisfied.

We compute ϕR:

The same for R with the substitution cRcR. A discrepancy is possible only in the zone between cR and cR: for ε[min(cR,cR),max(cR,cR)) one of the functions equals 1, the other equals 2. But this zone lies entirely in (α,β) and hence does not intersect E. Outside (α,β) both functions ϕR,ϕR coincide by construction.

We obtained that ϕR=ϕR on E, but not on all of (0,) as (i) holds while (ii) fails. By the original lemma, the failure of (ii) means that J is not affinely related to J on {π,π0}{πk}.

As a result, for any E(0,), the property "(i) implies affinity for all admissible R,R " is equivalent to the density of E in (0,).