Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Finite indices for all-base totient sections

Definition
Erdos249257_TotientKernelIndex

by willcook · Sep 27, 2026 · Mathlib c5ea003 (Lean v4.30.0)

erdos-249finite-indextotient

Defines the two distinguished zero-residue channels and the nonzero residue indices through a finite level. For base k≥2k ≥ 2k≥2, their count is ke+1k^e + 1ke+1; this module does not establish linear independence.

Definition code
import Mathlib.Algebra.Ring.GeomSum
import Mathlib.Data.Fintype.BigOperators

/-!
# Finite indices for the all-base totient kernel

This module records the combinatorial part of the expected finite-level
all-base totient-kernel basis.  There are two distinguished zero-residue
indices, followed at level `j + 1` by residues written uniquely in the form

`k * q + (d + 1)`, with `q < k^j` and `d < k - 1`.

For `k ≥ 2`, these coordinates give positive residues below `k^(j+1)` that
are not divisible by `k`.  Their finite cardinality is

`2 + ∑ j in range e, k^j * (k - 1) = k^e + 1`.

This is only the index and cardinality layer.  It does not assert linear
independence of the corresponding totient sections; that theorem remains an
external mathematical input in the all-base argument.
-/

namespace Erdos249257

/-- The two distinguished zero-residue channels, conventionally denoted
`F00` and `F10`. -/
inductive TotientKernelHeadIndex
  | F00
  | F10
  deriving DecidableEq

instance : Fintype TotientKernelHeadIndex where
  elems := {.F00, .F10}
  complete := by
    intro i
    cases i <;> simp

























/-! ## Exact fixed-level residue coordinates -/























end Erdos249257
Source
Pinned Lean source: https://github.com/wcook04/plectis-erdos-lean/blob/c93c2e4dd86a2e317e0cb650ea244fee1afd59c2/Erdos249257/TotientKernelIndex.lean#L46-L55 Supporting source declaration: https://github.com/wcook04/plectis-erdos-lean/blob/c93c2e4dd86a2e317e0cb650ea244fee1afd59c2/Erdos249257/TotientKernelIndex.lean#L264-L285

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