Keyboard shortcuts

Press ← or → to navigate between chapters

Press ? to show this help

Press Esc to hide this help

Biquadratic independence and integer approximation times

Abstract

Two independent nonsquare classes over the rationals force four-coefficient independence of real quadratic roots; an integer-character condition gives approximation sequences on every finite torus.

Theorem 1.1 (Four rational coefficients vanish).

Proof. Machine-checked in Lean as D5/S3/Fourier/BiquadraticKroneckerTimes.biquadratic_independent (✓ std3). ∎

Source. Repository-derived.

Commentary.

Assume x squared is p, y squared is q, x is irrational, and neither q nor pq is a rational square. Squaring the relation and separating the rational and x coefficients gives two equations. Their product eliminates the coefficient of xy through the nonsquare obstructions. The remaining coefficients then vanish. All rational coefficients and radicands are explicitly cast to the reals where necessary.

Theorem 1.2 (Every torus target is approached).

Proof. Machine-checked in Lean as D5/S3/Fourier/BiquadraticKroneckerTimes.dense_circle_sequence (✓ std3). ∎

Source. Repository-derived.

Commentary.

The character criterion TorusOrbitClosure.result identifies the closure of nonnegative powers. The assumption says that any integer combination of the frequencies which is an integer has all coefficients zero; equivalently the frequencies together with one have no nontrivial integer relation. The sequential characterization of closure then supplies natural exponents tending to the prescribed target. The exponents need not be monotone or unbounded, and no algebraicity assumption is imposed.

References