Related papers: Lean-certified four-point HRT results for three la…
We present a formally verified framework for patent analysis as a hybrid AI + Lean 4 pipeline. The DAG-coverage core (Algorithm 1b) is fully machine-verified once bounded match scores are fixed. Freedom-to-operate, claim-construction…
This note considers the finite linear independence of coherent systems associated to discrete subgroups. We show by simple arguments that such coherent systems of amenable groups are linearly independent whenever the associated twisted…
The HRT (Heil-Ramanathan-Topiwala) conjecture stipulates that the set of any finitely many time-frequency shifts of a non-zero square Lebesgue integrable function is linearly independent. The present work settles two special cases of this…
We present a framework for verifying the deterministic structured computations surrounding a large language model rather than the model itself, extending a Lean 4 trust-boundary architecture to the generic interfaces of modern LLM…
The HRT (Heil-Ramanathan-Topiwala) posits the linear independence of any set of nonzero square-integrable vectors obtained from a single nonzero vector $f$ by applying a finite set of time-frequency shift operators. In this short note, we…
The HRT (Heil-Ramanathan-Topiwala) conjecture asks whether a finite collection of time-frequency shifts of a non-zero square integrable function on $\mathbb{R}$ is linearly independent. This longstanding conjecture remains largely open even…
Proof automation is crucial to large-scale formal mathematics and software/hardware verification projects in ITPs. Sophisticated tools called hammers have been developed to provide general-purpose proof automation in ITPs such as Coq and…
We prove that the HRT (Heil, Ramanathan, and Topiwala) conjecture is equivalent to the conjecture that finite translates of square-integrable functions on the Heisenberg group are linearly independent.
In the restricted setting of product phase space lattices, we give an alternate proof of P. Linnell's theorem on the finite linear independence of lattice Gabor systems in $L^2(\mathbb R^d)$. Our proof is based on a simple argument from the…
We prove that the HRT conjecture holds when the Gabor system consists of a 4-point set in the time-frequency plane and a square-integrable function that is ultimately positive. We also prove the conjecture for Gabor systems generated by an…
A celebrated theorem of Fr\"oberg gives a complete combinatorial classification of quadratic square-free monomial ideals with a linear resolution. A generalization of this theorem to higher degree square-free monomial ideals is an active…
In this project, a rather complete proof-theoretical formalization of Lambek Calculus (non-associative with arbitrary extensions) has been ported from Coq proof assistent to HOL4 theorem prover, with some improvements and new theorems.…
Given $f \in C_0(\mathbb{R}^n)$ and $\Lambda \subset \mathbb{R}^{2n}$ a finite set we demonstrate the linear independence of the set of time-frequency translates $\mathcal{G}(f, \Lambda) = \{\pi(\lambda)f\}_{\lambda\in \Lambda}$ when the…
Number fields and their rings of integers, which generalize the rational numbers and the integers, are foundational objects in number theory. There are several computer algebra systems and databases concerned with the computational aspects…
We prove that for any 4 points in a (2-2) configuration, there is no linear dependence between the associated time-frequency translates of any $L^2(\R)$ function
Linearisability has become the standard correctness criterion for concurrent data structures, ensuring that every history of invocations and responses of concurrent operations has a matching sequential history. Existing proofs of…
Let $D=(V,A)$ be a digraph whose underlying undirected graph is $2$-edge-connected, and let $P$ be the polytope whose vertices are the incidence vectors of arc sets whose reversal makes $D$ strongly connected. We study the lattice theoretic…
RL-trained Lean theorem provers mode-collapse at inference time: on miniF2F-test with DeepSeek-Prover-V1.5-RL, doubling the i.i.d.\ sampling budget from $k{=}32$ to $k{=}64$ produces zero additional solved theorems (42/244 in both cases). A…
This paper deals with the certification problem for robust quadratic stability, robust state convergence, and robust quadratic performance of linear systems that exhibit bounded rates of variation in their parameters. We consider both…
In this article, we study a calibrated version of Reifenberg theorem "with holes". In particular we study sets that are suitably approximable at all points and scales by calibrated planes and show that, without any additional hypotheses on…