equal
deleted
inserted
replaced
33 shows "log b (\<Sum> i \<in> s. a i * y i) \<ge> (\<Sum> i \<in> s. a i * log b (y i))" |
33 shows "log b (\<Sum> i \<in> s. a i * y i) \<ge> (\<Sum> i \<in> s. a i * log b (y i))" |
34 proof - |
34 proof - |
35 have "convex_on {0 <..} (\<lambda> x. - log b x)" |
35 have "convex_on {0 <..} (\<lambda> x. - log b x)" |
36 by (rule minus_log_convex[OF `b > 1`]) |
36 by (rule minus_log_convex[OF `b > 1`]) |
37 hence "- log b (\<Sum> i \<in> s. a i * y i) \<le> (\<Sum> i \<in> s. a i * - log b (y i))" |
37 hence "- log b (\<Sum> i \<in> s. a i * y i) \<le> (\<Sum> i \<in> s. a i * - log b (y i))" |
38 using convex_on_setsum[of _ _ "\<lambda> x. - log b x"] assms pos_is_convex by fastsimp |
38 using convex_on_setsum[of _ _ "\<lambda> x. - log b x"] assms pos_is_convex by fastforce |
39 thus ?thesis by (auto simp add:setsum_negf le_imp_neg_le) |
39 thus ?thesis by (auto simp add:setsum_negf le_imp_neg_le) |
40 qed |
40 qed |
41 |
41 |
42 lemma log_setsum': |
42 lemma log_setsum': |
43 assumes "finite s" "s \<noteq> {}" |
43 assumes "finite s" "s \<noteq> {}" |
1325 lemma subvimage_finite: |
1325 lemma subvimage_finite: |
1326 assumes svi: "subvimage A f g" and fin: "finite (f`A)" |
1326 assumes svi: "subvimage A f g" and fin: "finite (f`A)" |
1327 shows "finite (g`A)" |
1327 shows "finite (g`A)" |
1328 proof - |
1328 proof - |
1329 from subvimage_translator_image[OF svi] |
1329 from subvimage_translator_image[OF svi] |
1330 obtain h where "g`A = h`f`A" by fastsimp |
1330 obtain h where "g`A = h`f`A" by fastforce |
1331 with fin show "finite (g`A)" by simp |
1331 with fin show "finite (g`A)" by simp |
1332 qed |
1332 qed |
1333 |
1333 |
1334 lemma subvimage_disj: |
1334 lemma subvimage_disj: |
1335 assumes svi: "subvimage A f g" |
1335 assumes svi: "subvimage A f g" |