Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Fischler 2001, Th. 5.3, with a vector hyperplane: if m, k ≥ 2, (k, m) ≠ (2, 2) and v ⊗ ⋯ ⊗ v (k factors) has its coordinates in ℒ̃, it lies in a vector hyperplane defined over Q̄

Proved
DiazModulus.fischler_theorem_5_3

by carlok · Nov 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

diaz-modulus-leannumber-theorytranscendence

Here Q‾\overline{\mathbb Q}Q​ is the field of algebraic numbers, L\mathcal LL the set of logarithms of algebraic numbers (z∈Cz \in \mathbb Cz∈C with eze^zez algebraic), and L~\widetilde{\mathcal L}L the Q‾\overline{\mathbb Q}Q​-vector space spanned by 111 and L\mathcal LL. A subspace S⊆CdS \subseteq \mathbb C^dS⊆Cd is rational if it is spanned by vectors with algebraic coordinates.

For v∈Cmv \in \mathbb C^mv∈Cm and a map I:{1,…,k}→{1,…,m}I : \{1, \dots, k\} \to \{1, \dots, m\}I:{1,…,k}→{1,…,m} write vI=vI(1)vI(2)⋯vI(k)v_I = v_{I(1)} v_{I(2)} \cdots v_{I(k)}vI​=vI(1)​vI(2)​⋯vI(k)​; these are the coordinates of v⊗⋯⊗vv \otimes \cdots \otimes vv⊗⋯⊗v (kkk factors) in the basis eI(1)⊗⋯⊗eI(k)e_{I(1)} \otimes \cdots \otimes e_{I(k)}eI(1)​⊗⋯⊗eI(k)​ of (Cm)⊗k(\mathbb C^m)^{\otimes k}(Cm)⊗k, which is defined over Q‾\overline{\mathbb Q}Q​.

Let m≥2m \ge 2m≥2 and k≥2k \ge 2k≥2 with (k,m)≠(2,2)(k, m) \neq (2, 2)(k,m)=(2,2), let v∈Cmv \in \mathbb C^mv∈Cm, and suppose that vI∈L~v_I \in \widetilde{\mathcal L}vI​∈L for every map I:{1,…,k}→{1,…,m}I : \{1, \dots, k\} \to \{1, \dots, m\}I:{1,…,k}→{1,…,m}. Then there is a family (ψI)I(\psi_I)_I(ψI​)I​ of algebraic numbers, indexed by these maps and not all zero, such that

∑IψIvI=0.\sum_I \psi_I v_I = 0.I∑​ψI​vI​=0.

So v⊗⋯⊗vv \otimes \cdots \otimes vv⊗⋯⊗v lies in the vector hyperplane ∑IψIxI=0\sum_I \psi_I x_I = 0∑I​ψI​xI​=0 of (Cm)⊗k(\mathbb C^m)^{\otimes k}(Cm)⊗k, which is defined over Q‾\overline{\mathbb Q}Q​: Fischler's Conjecture 2 for the set T(k,m)\mathcal T(k, m)T(k,m) of tensors v⊗⋯⊗vv \otimes \cdots \otimes vv⊗⋯⊗v, with a hyperplane through 000.

Preamble
import Definitions.Def_DiazModulus
Formal statement
open Complex ComplexConjugate

namespace DiazModulus

theorem fischler_theorem_5_3 {m k : ℕ} (hm : 2 ≤ m) (hk : 2 ≤ k) (hkm : (k, m) ≠ (2, 2))
    (v : Fin m → ℂ) (hv : ∀ I : Fin k → Fin m, ∏ t, v (I t) ∈ LogAlgTilde) :
    ∃ ψ : (Fin k → Fin m) → ℂ, (∀ I, ψ I ∈ Qbar) ∧ ψ ≠ 0 ∧
      ∑ I, ψ I * ∏ t, v (I t) = 0 := by
  sorry

end DiazModulus
Source
S. Fischler, Orbits under algebraic groups and logarithms of algebraic numbers, Acta Arith. 100 (2001), 167–187, Th. 5.3 (p. 180), in the setting of §5.1 (m ≥ 2, k ≥ 2, p. 178), with Conjecture 2 (p. 168) in the coordinates of the basis e_I(1) ⊗ ⋯ ⊗ e_I(k), which is defined over Q̄ (p. 170). The conclusion is slightly stronger than printed: the hyperplane is a vector hyperplane, where Conjecture 2 asks for an affine one; Fischler notes that his method gives vector hyperplanes (p. 169). Fischler's ℒ, the Q̄-vector space spanned by 1 and the logarithms of algebraic numbers, is ℒ̃ here. The printed proof goes through the orbit results of §4 and is sketched (p. 178); Fischler points to Th. 6.4 for a more precise result (p. 180). The proof here uses only the bound n ≤ 2, and n ≤ 1 for k ≥ 3, on the dimension n of the Q̄-span of v₁, …, vₘ, the common core of the proofs of Th. 6.2 and Th. 6.4: it gives n < m, so the vᵢ are linearly dependent over Q̄, and a relation Σ βᵢvᵢ = 0 gives ψ. Neither Th. 6.4 nor the rational hull of v is used. Proved from DiazModulus.fischler_power_span_finrank. Formal proof: Diaz modulus mission, 20 November 2026 (C. Perassi).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me