Saved in:
Bibliographic Details
Main Authors: Bai, Yifan, Li, Yantao, Yu, Jian, Liang, Jingwei
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2602.17064
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866914338732769280
author Bai, Yifan
Li, Yantao
Yu, Jian
Liang, Jingwei
author_facet Bai, Yifan
Li, Yantao
Yu, Jian
Liang, Jingwei
contents Iterative algorithms are fundamental tools for approximating fixed-points of nonexpansive operators in real Hilbert spaces. Among them, Krasnosel'ski\uı--Mann iteration and Halpern iteration are two widely used schemes. In this work, we formalize the convergence of these two fixed-point algorithms in the interactive theorem prover Lean4 based on type dependent theory. To this end, weak convergence and topological properties in the infinite-dimensional real Hilbert space are formalized. Definition and properties of nonexpansive operators are also provided. As a useful tool in convex analysis, we then formalize the Fejér monotone sequence. Building on these foundations, we verify the convergence of both the iteration schemes. Our formalization provides reusable components for machine-checked convergence analysis of fixed-point iterations and theories of convex analysis in real Hilbert spaces. Our code is available at https://github.com/TTony2019/fixed-point-iterations-in-lean.
format Preprint
id arxiv_https___arxiv_org_abs_2602_17064
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Formalization of Two Fixed-Point Algorithms in Hilbert Spaces
Bai, Yifan
Li, Yantao
Yu, Jian
Liang, Jingwei
Optimization and Control
Iterative algorithms are fundamental tools for approximating fixed-points of nonexpansive operators in real Hilbert spaces. Among them, Krasnosel'ski\uı--Mann iteration and Halpern iteration are two widely used schemes. In this work, we formalize the convergence of these two fixed-point algorithms in the interactive theorem prover Lean4 based on type dependent theory. To this end, weak convergence and topological properties in the infinite-dimensional real Hilbert space are formalized. Definition and properties of nonexpansive operators are also provided. As a useful tool in convex analysis, we then formalize the Fejér monotone sequence. Building on these foundations, we verify the convergence of both the iteration schemes. Our formalization provides reusable components for machine-checked convergence analysis of fixed-point iterations and theories of convex analysis in real Hilbert spaces. Our code is available at https://github.com/TTony2019/fixed-point-iterations-in-lean.
title Formalization of Two Fixed-Point Algorithms in Hilbert Spaces
topic Optimization and Control
url https://arxiv.org/abs/2602.17064