Backend
From Pen-and-Paper to Machine-Checked Proofs: Lean for System Identification
arXiv cs.SY0 views
arXiv:2611.18220v1 Announce Type: new Abstract: Mathematical proofs in scientific papers are often long and intricate, relying on chains of references to earlier results. This makes it difficult for readers and reviewers to verify each and every step. Interactive theorem proving offers a complement: the theorem and its proof are written as code, and every inference is checked by a small, trusted piece of software called the kernel. This paper serves as an introduction to the Lean 4 proof assistant for a system identification and control audience, assuming no prior exposure to formal methods. We first show how a Lean proof is read using two elementary examples: the first on identifiability, the second on set invariance. We then illustrate how Lean can be used to analyse results from the literature, taking as example a classic lemma on the inversion of the noise filter in prediction-error identification (Ljung, 1999, Lemma 3.1). Since in Lean every step must be justified, the formalization brings to light a subtle point: the original claim of that lemma holds almost surely, although not for every realisation, as its statement may suggest. A simple counterexample makes this concrete. Finally, the paper discusses guidelines and perspectives on the use of Lean in system identification research.
Source:https://arxiv.org/abs/2611.18220PreviousData-Driven Sparse Identification and Robust Tube-Based Predictive Control for Multivariable Chaotic SystemsNextCharacterisation of the DQsym Framework Against Harmonic State-Space and Dynamic Phasor Models for Modular Multilevel Converters
Related posts
The $\alpha$-Limit Problem: Convergence of a Linear Degenerate Interface Transmission Problem
0arXiv cs.NA
A Spectral Proximal DC Algorithm with Nonmonotone Line Search and Extrapolation
0arXiv cs.NA
Watch Your Step: Adam's Margin Maximization Bias Depends on the Learning Rate Schedule
0arXiv stat.ML
Minimizing classical resources in variational measurement-based quantum computation for generative modeling
0arXiv stat.ML
Deep Multivariate Models with Parametric Conditionals
0arXiv stat.ML
CoordX Types: A Trustless, Swappable Type System for Shared Records
0arXiv cs.CR