Download data/lean/OAI/Analysis/ForestSpace/Moduli.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 2.7 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Analysis/ForestSpace/Moduli.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Analysis/ForestSpace/Moduli.lean
-
curl -L -o Moduli.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Analysis/ForestSpace/Moduli.lean
2.7 kB
| import Mathlib | |
| namespace OAI | |
| open scoped BigOperators | |
| open Finset | |
| namespace ForestSpace | |
| noncomputable section | |
| attribute [local instance] Classical.propDecidable | |
| section ModulusDefinitions | |
| variable (E : Type) [NormedAddCommGroup E] [NormedSpace β E] | |
| /-- The closed finite-codimensional subspaces. -/ | |
| def Cofinite : Type := | |
| {F : Submodule β E // IsClosed (F : Set E) β§ FiniteDimensional β (E β§Έ F)} | |
| noncomputable def cofiniteTop : Cofinite E := | |
| β¨β€, by simp, inferInstanceβ© | |
| /-- The inner one-sided excess values and their infimum. -/ | |
| def aucValues (N : E β β) (t : β) (x : E) (F : Cofinite E) : Set β := | |
| {a | β y : E, y β F.val β§ N y = 1 β§ a = N (x + t β’ y) - 1} | |
| noncomputable def aucInner (N : E β β) (t : β) (x : E) (F : Cofinite E) : β := | |
| sInf (aucValues E N t x F) | |
| noncomputable def aucCenter (N : E β β) (t : β) (x : E) : β := | |
| sSup (Set.range (aucInner E N t x)) | |
| /-- The one-sided asymptotic uniform convexity modulus, with the order | |
| of infimum, supremum and infimum. -/ | |
| noncomputable def aucModulus (N : E β β) (t : β) : β := | |
| sInf {a | β x : E, N x = 1 β§ a = aucCenter E N t x} | |
| /-- The inner averaged signed excess; it is not replaced by a maximum. -/ | |
| def averageValues (N : E β β) (t : β) (x : E) (F : Cofinite E) : Set β := | |
| {a | β y : E, y β F.val β§ N y = 1 β§ | |
| a = (N (x+tβ’y) + N (x-tβ’y))/((2 : β) : β) - 1} | |
| noncomputable def averageInner (N : E β β) (t : β) (x : E) (F : Cofinite E) : β := | |
| sInf (averageValues E N t x F) | |
| noncomputable def averageCenter (N : E β β) (t : β) (x : E) : β := | |
| sSup (Set.range (averageInner E N t x)) | |
| /-- The averaged asymptotic midpoint modulus. -/ | |
| noncomputable def averageModulus (N : E β β) (t : β) : β := | |
| sInf {a | β x : E, N x = 1 β§ a = averageCenter E N t x} | |
| end ModulusDefinitions | |
| /-- An equivalent norm is kept as its exact real seminorm, with explicit positive | |
| comparison constants. The lower inequality makes it a norm. -/ | |
| structure EquivalentNorm (E : Type) [NormedAddCommGroup E] [NormedSpace β E] | |
| (Ξ± Ξ² : β) where | |
| N : Seminorm β E | |
| alpha_pos : 0 < Ξ± | |
| alpha_le_beta : Ξ± β€ Ξ² | |
| lower : β x : E, Ξ±*βxβ β€ N x | |
| upper : β x : E, N x β€ Ξ²*βxβ | |
| /-- Canonical (not merely abstract) reflexivity. -/ | |
| def Reflexive (E : Type) [NormedAddCommGroup E] [NormedSpace β E] : Prop := | |
| Function.Surjective (NormedSpace.inclusionInDoubleDual β E) | |
| /-- AUC requires positivity at every strictly positive parameter. -/ | |
| def IsAUC {E : Type} [NormedAddCommGroup E] [NormedSpace β E] (N : E β β) : Prop := | |
| β t : β, 0 < t β 0 < aucModulus E N t | |
| end | |
| end ForestSpace | |
| end OAI | |