        {"id":1777,"date":"2023-11-17T06:00:45","date_gmt":"2023-11-17T04:00:45","guid":{"rendered":"https:\/\/www.glc.us.es\/~jalonso\/calculemus\/?p=1777"},"modified":"2023-11-06T12:34:29","modified_gmt":"2023-11-06T10:34:29","slug":"17-nov-23","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/calculemus\/17-nov-23\/","title":{"rendered":"Si para cada a existe un x tal que f(x) < a, entonces f no tiene cota inferior"},"content":{"rendered":"<p>Demostrar con Lean4 que si &#92;(f&#92;) es una funci\u00f3n de &#92;(\u211d&#92;) en &#92;(\u211d&#92;) tal que para cada &#92;(a&#92;) existe un &#92;(x&#92;) tal que &#92;(f(x) &lt; a&#92;), entonces &#92;(f&#92;) no tiene cota inferior.<\/p>\n<p>Para ello, completar la siguiente teor\u00eda de Lean4:<\/p>\n<pre lang=\"lean\">\nimport Mathlib.Data.Real.Basic\n\ndef CotaInferior (f : \u211d \u2192 \u211d) (a : \u211d) : Prop :=\n  \u2200 x, a \u2264 f x\n\ndef acotadaInf (f : \u211d \u2192 \u211d) : Prop :=\n  \u2203 a, CotaInferior f a\n\nvariable (f : \u211d \u2192 \u211d)\n\nexample\n  (h : \u2200 a, \u2203 x, f x < a)\n  : \u00ac acotadaInf f :=\nby sorry\n<\/pre>\n<p><!--more--><\/p>\n<p><b>Demostraci\u00f3n en lenguaje natural<\/b><\/p>\n<p><br \/>\nSupongamos que &#92;(f&#92;) tiene cota inferior. Sea &#92;(b&#92;) una de dichas cotas inferiores. Por la hip\u00f3tesis, existe un &#92;(x&#92;) tal que &#92;(f(x) &lt; b&#92;). Adem\u00e1s, como &#92;(b&#92;) es una cota inferior de &#92;(f&#92;), &#92;(b \u2264 f(x)&#92;) que contradice la desigualdad anterior.<\/p>\n<p><b>Demostraciones con Lean4<\/b><\/p>\n<pre lang=\"lean\">\nimport Mathlib.Data.Real.Basic\n\ndef CotaInferior (f : \u211d \u2192 \u211d) (a : \u211d) : Prop :=\n  \u2200 x, a \u2264 f x\n\ndef acotadaInf (f : \u211d \u2192 \u211d) : Prop :=\n  \u2203 a, CotaInferior f a\n\nvariable (f : \u211d \u2192 \u211d)\n\n-- 1\u00aa demostraci\u00f3n\nexample\n  (h : \u2200 a, \u2203 x, f x < a)\n  : \u00ac acotadaInf f :=\nby\n  intros hf\n  -- hf : acotadaInf f\n  -- \u22a2 False\n  cases' hf with b hb\n  -- b : \u211d\n  -- hb : CotaInferior f b\n  cases' h b with x hx\n  -- x : \u211d\n  -- hx : f x < b\n  have : b \u2264 f x := hb x\n  linarith\n\n-- 2\u00aa demostraci\u00f3n\nexample\n  (h : \u2200 a, \u2203 x, f x < a)\n  : \u00ac acotadaInf f :=\nby\n  intros hf\n  -- hf : acotadaInf f\n  -- \u22a2 False\n  rcases hf with \u27e8b, hb : CotaInferior f b\u27e9\n  rcases h b with \u27e8x, hx : f x < b\u27e9\n  have : b \u2264 f x := hb x\n  linarith\n<\/pre>\n<p><b>Demostraciones interactivas<\/b><\/p>\n<p>Se puede interactuar con las demostraciones anteriores en <a href=\"https:\/\/live.lean-lang.org\/#url=https:\/\/raw.githubusercontent.com\/jaalonso\/Calculemus2\/main\/src\/Funcion_no_acotada_inferiormente.lean\" rel=\"noopener noreferrer\" target=\"_blank\">Lean 4 Web<\/a>.<\/p>\n<p><b>Referencias<\/b><\/p>\n<ul>\n<li> J. Avigad y P. Massot. <a href=\"https:\/\/bit.ly\/3U4UjBk\">Mathematics in Lean<\/a>, p. 32.<\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>Demostrar con Lean4 que si &#92;(f&#92;) es una funci\u00f3n de &#92;(\u211d&#92;) en &#92;(\u211d&#92;) tal que para cada &#92;(a&#92;) existe un &#92;(x&#92;) tal que &#92;(f(x) &lt; a&#92;), entonces &#92;(f&#92;) no tiene cota inferior. Para ello, completar la siguiente teor\u00eda de Lean4: import Mathlib.Data.Real.Basic def CotaInferior (f : \u211d \u2192 \u211d) (a : \u211d) : Prop := \u2200 x, a \u2264 f x def acotadaInf (f : \u211d \u2192 \u211d) : Prop := \u2203 a, CotaInferior f a variable (f : \u211d \u2192 \u211d) example (h : \u2200 a, \u2203 x, f x < a) : \u00ac acotadaInf f := by sorry\n<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_kad_post_transparent":"","_kad_post_title":"","_kad_post_layout":"","_kad_post_sidebar_id":"","_kad_post_content_style":"","_kad_post_vertical_padding":"","_kad_post_feature":"","_kad_post_feature_position":"","_kad_post_header":false,"_kad_post_footer":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[1],"tags":[],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/calculemus\/wp-json\/wp\/v2\/posts\/1777"}],"collection":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/calculemus\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/calculemus\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/calculemus\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/calculemus\/wp-json\/wp\/v2\/comments?post=1777"}],"version-history":[{"count":1,"href":"https:\/\/www.glc.us.es\/~jalonso\/calculemus\/wp-json\/wp\/v2\/posts\/1777\/revisions"}],"predecessor-version":[{"id":1778,"href":"https:\/\/www.glc.us.es\/~jalonso\/calculemus\/wp-json\/wp\/v2\/posts\/1777\/revisions\/1778"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/calculemus\/wp-json\/wp\/v2\/media?parent=1777"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/calculemus\/wp-json\/wp\/v2\/categories?post=1777"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/calculemus\/wp-json\/wp\/v2\/tags?post=1777"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}