Lean 4 Source Archive

Pure Mathlib v4.27.0 · 0 sorry · Standard axioms only All 10 verified source files for the Poisson DEQ Mirror Descent erratum.

DeqMdErratum.lean

Root library entry point importing all 9 formalization modules.

9 lines · 0 decls In-app viewer Raw .lean
Imports all 9 modules

DeqMdErratum/Variational.lean

Finite-dimensional Euclidean helpers, effective domains, Fréchet and limiting subdifferentials, attentive closedness, smooth sum rule, and box normal cones.

551 lines · 38 decls In-app viewer Raw .lean
abbrev E L18lemma E_norm_sq_eq L24lemma E_norm_sq_sub_eq L29lemma E_inner_eq L34lemma E_abs_coord_le_norm L39lemma E_ext L46lemma E_single_apply L50lemma E_inner_single_right L54lemma E_inner_single_left L58lemma gradient_coord_eq_fderiv_single L63lemma E_coord_continuous L72lemma E_mk_continuous L75lemma E_mk_continuousOn L81lemma ereal_coe_add_eq_top_iff L93def effectiveDom L103lemma mem_effectiveDom_iff L106lemma EReal.coe_toReal_of_mem_effectiveDom L110def IsProper L116def indicatorE L120lemma indicatorE_of_mem L125lemma indicatorE_of_notMem L131lemma effectiveDom_indicatorE L136lemma isProper_indicatorE L140def frechetSubdiff L148def limitingSubdiff L153def crit L162def normalCone L166lemma frechetSubdiff_subset_limitingSubdiff L169lemma zero_mem_frechetSubdiff_of_isMin L175lemma frechetSubdiff_congr_nhds L188lemma limitingSubdiff_congr_nhds L213lemma limitingSubdiff_closed_attentive L247lemma frechetSubdiff_add_smooth_at L317lemma limitingSubdiff_add_smooth_on_nhds L387lemma normalCone_subset_frechetSubdiff_indicator L470lemma frechetSubdiff_indicator_subset_normalCone_of_convex L482lemma frechetSubdiff_indicator_eq_normalCone_of_convex L528lemma limitingSubdiff_indicator_eq_normalCone_of_closed_convex L534

DeqMdErratum/KL.lean

Desingularizing functions, the KŁ property, ω-limit sets, uniformized KŁ via finite sums, and a full proof of Theorem A.8 of [3].

600 lines · 16 decls In-app viewer Raw .lean
def DesingularizingFunction L23lemma DesingularizingFunction.antitoneOn_deriv L32lemma DesingularizingFunction.mul_sub_le L38lemma DesingularizingFunction.nonneg L55lemma concaveOn_finset_sum L65lemma DesingularizingFunction.finset_sum L74def HasKLAt L117def HasKL L128def omegaLimitSet L132lemma omegaLimitSet_nonempty L135lemma omegaLimitSet_isClosed L140lemma omegaLimitSet_subset_closure L189lemma omegaLimitSet_isCompact L194lemma tendsto_infDist_omegaLimitSet_zero L201theorem uniformized_kl L243theorem theorem_A8 L315

DeqMdErratum/Defs.lean

Box constraints, Poisson KL divergence (allowing y_i ≥ 0), ProblemData, Ψ, F, singular boundary S, shifted Burg entropy h_ξ, and sublevel sets L₀ and K_β.

422 lines · 44 decls In-app viewer Raw .lean
def boxSet L24def boxIndicator L28lemma boxIndicator_of_mem L32lemma boxIndicator_of_notMem L37lemma boxSet_zero_mem L41lemma boxSet_nonempty L44lemma boxSet_convex L47lemma boxSet_isClosed L59lemma boxSet_isCompact L66lemma boxIndicator_isProper L81def klScalar L86def klDiv L94def klSmoothScalar L99lemma klScalar_ne_bot L102lemma klDiv_ne_bot L111lemma klScalar_nonneg L121lemma klDiv_nonneg L141lemma klScalar_eq_klSmoothScalar_of_nonneg L150structure ProblemData L164def Ax L183lemma Ax_coord_continuous L186lemma Ax_nonneg_of_mem_box L192def Psi L198def FSmooth L202def UPos L206lemma isOpen_UPos L209def singularSet L219lemma ereal_coe_finset_sum L222lemma klDiv_eq_sum_klSmoothScalar_on_box_inter_UPos L230lemma Psi_eq_FSmooth_on_box_inter_UPos L240lemma Psi_eq_FSmooth_add_boxIndicator_on_UPos L247lemma effectiveDom_Psi_eq L260lemma closure_effectiveDom_Psi_eq_boxSet L302lemma closure_effectiveDom_Psi_diff_eq_singularSet L354def burgEntropy L379def burgGrad L384def shiftedBurg L388def shiftedBurgReal L393def shiftedBurgGrad L397def bregmanShiftedBurg L401def L0 L405def K_beta L409def beta0 L413def beta1 L417

DeqMdErratum/Counterexample.lean

Example 1 counterexample proving that the unshifted Burg gradient ∇h is not Lipschitz continuous on dom(h) ∩ L₀(x⁰).

193 lines · 11 decls In-app viewer Raw .lean
def example1Matrix L21def example1Data L25def example1Vec L43lemma example1Vec_0 L47lemma example1Vec_1 L50lemma example1_Ax L52lemma example1_vec_mem_box L59lemma example1_vec_mem_UPos L66theorem example1_psi_zero_one_finite L74theorem example1_segment_mem_sublevel L84theorem example1_burgGrad_not_lipschitzOn_sublevel L138

DeqMdErratum/ProximalStep.lean

Strong convexity and 1/ξ²-Lipschitz gradient of h_ξ on [0, a]^n, total continuous T_τ, and variational equivalence (1) ⟺ (4) ⟺ (5).

495 lines · 23 decls In-app viewer Raw .lean
def breg1D L26lemma bregmanShiftedBurg_eq_sum_breg1D L29lemma breg1D_nonneg L39lemma bregmanShiftedBurg_nonneg L52lemma breg1D_ge_sq_on_Icc L58theorem bregmanShiftedBurg_ge_norm_sq L133theorem shiftedBurgGrad_lipschitzOn_box L140lemma bregmanShiftedBurg_three_point L172def T_tauCoord L190def T_tau L195lemma T_tauCoord_mem_Icc L198lemma T_tau_mem_box L205lemma T_tau_eq_closed_form L209lemma T_tauCoord_eq_clamped L218lemma FSmooth_contDiffOn_open L268lemma gradient_FSmooth_continuousOn L299theorem T_tau_continuousOn L318lemma T_tauCoord_scalar_normalCone L352theorem T_tau_normalCone_opt L404theorem T_tau_optimality_cond L418def mdSubproblemObj L428theorem T_tau_unique_argmin L434theorem argmin_eq_T_tau L484

DeqMdErratum/Lemma2.lean

Properness/LSC/lower boundedness of Ψ, convexity/compactness of K_β, positive lower bound separating K_β from S, and Lemma 2 relative smoothness L_β h_ξ − F.

815 lines · 30 decls In-app viewer Raw .lean
lemma lowerSemicontinuous_ereal_add L28lemma klScalar_lowerSemicontinuous L34lemma klDiv_lowerSemicontinuous L107theorem Psi_isProper L131theorem Psi_lowerSemicontinuous L149lemma R_theta_bddBelow_box L199lemma R_theta_sInf_le L204theorem Psi_bddBelow L208lemma K_beta_mono L236lemma klScalar_mem_K_beta_bounds L240theorem K_beta_convex L272theorem K_beta_isClosed L422theorem K_beta_isCompact L429theorem K_beta_ax_lower_bound L433lemma K_beta_subset_UPos L468lemma K_beta_subset_open L474theorem K_beta_disjoint_singularSet L479lemma L0_subset_K_beta0 L486lemma fderiv_gradient_FSmooth_continuousOn L510def M_beta L532lemma M_beta_pos L535lemma norm_fderiv_gradient_le_M_beta L538theorem grad_FSmooth_lipschitzOn_K_beta L548lemma grad_FSmooth_norm_sub_le L575def L_beta L583lemma L_beta_pos L586lemma hasDerivAt_segment_shiftedBurg_sub_FSmooth L590lemma deriv_segment_monotoneOn L659theorem L_beta_shiftedBurg_sub_FSmooth_convexOn L749theorem FSmooth_bregman_upper_bound L778

DeqMdErratum/Lemma3.lean

Connectedness bootstrap proving denominator positivity, K_{β₁} ∩ L₀ invariance, Bregman sufficient decrease (6), and relative error bound (7).

411 lines · 15 decls In-app viewer Raw .lean
def coordInfNorm L28lemma coordInfNorm_nonneg L31lemma abs_coord_le_coordInfNorm L34lemma coordInfNorm_continuous L40def G_const L56lemma G_const_nonneg L59lemma abs_grad_coord_le_G_const L73def tauBar L88lemma tauBar_pos L94lemma mem_Ioo_tauBar_iff L102lemma T_tau_zero_eq_self L131lemma T_tau_continuous_in_step L138lemma denom_lower_bound L157lemma descent_on_K_beta1 L182theorem lemma_3 L219

DeqMdErratum/Theorem4.lean

Constant-step shifted-Burg Mirror Descent convergence (Theorem 4): finite trajectory length and limit in crit(Ψ) ∩ L₀ solving x^∞ = T_τ(x^∞).

214 lines · 7 decls In-app viewer Raw .lean
lemma L0_isClosed L24lemma L0_isBounded L29lemma Psi_tendsto_of_mem_L0 L38lemma T_tau_fixed_point_of_tendsto L61def mdIter L130lemma mdIter_mem_L0 L134theorem theorem_4 L147

DeqMdErratum/Backtracking.lean

Monotone backtracking Mirror Descent (Algorithm 1): acceptance below τ_hat, finite inner termination, finite step-size stabilization, and global convergence.

528 lines · 25 decls In-app viewer Raw .lean
def tauHat L29lemma tauHat_pos L35lemma tauHat_le_tauBar L46lemma tauHat_le_one_sub_gamma_div_L L56def AcceptStep L64lemma acceptStep_of_mem_Ioo_tauHat L72lemma exists_backtrack_pow L99structure BtState L121def btInitState L129def btBacktrackCount L139lemma btBacktrackCount_spec L146lemma btBacktrackCount_min L155def btNextState L164def btStateSeq L221def btIter L229def btTau L235lemma btIter_mem_L0 L240lemma btIter_succ_eq L246lemma btTau_accept L253lemma btTau_bounds L262lemma btTau_succ_cases L270lemma btTau_antitone L300lemma eventually_const_of_geometric_drops L309theorem btTau_eventually_const L374theorem algorithm1_backtracking_convergence L393