From 99e7b2fd7b0b1364f24916b744805524f6f9d61d Mon Sep 17 00:00:00 2001 From: Jonathan Berrisch Date: Wed, 25 Jun 2025 16:01:49 +0200 Subject: [PATCH] Make prop2 proof more consistent --- index.html | 4 ++-- index.qmd | 4 ++-- 2 files changed, 4 insertions(+), 4 deletions(-) diff --git a/index.html b/index.html index 4fd1bde..10d884c 100644 --- a/index.html +++ b/index.html @@ -26438,8 +26438,8 @@ w_{t,k}^{\text{Naive}} = \frac{1}{K}\label{eq:naive_combination}

\[\begin{align} \rho_p(z) &= \begin{cases} - z(1 - p) = z - zp, & \text{if } z > 0 \\ - z(0 - p) = -zp, & \text{if } z \leq 0 + z(1 - p) = z - zp, & \text{if } 0 < z \\ + z(0 - p) = -zp, & \text{if } 0 \geq z \end{cases} \\ \rho_p'(z) &= \begin{cases} diff --git a/index.qmd b/index.qmd index 65b37d7..382890a 100644 --- a/index.qmd +++ b/index.qmd @@ -1464,8 +1464,8 @@ To find $\mathcal{Q}''_p(x)$ we rewrite \eqref{eq:check}: \begin{align} \rho_p(z) &= \begin{cases} - z(1 - p) = z - zp, & \text{if } z > 0 \\ - z(0 - p) = -zp, & \text{if } z \leq 0 + z(1 - p) = z - zp, & \text{if } 0 < z \\ + z(0 - p) = -zp, & \text{if } 0 \geq z \end{cases} \\ \rho_p'(z) &= \begin{cases}