A fibre of size twice a power of two needs one further character
ProvedCouret.STROBO2TORS.recoh_double_fibre_rank_succ_le_of_separating_bankcouret-programmecouret-unification-20261108
Let be an abelian group, the ordered pair-sum count of a support , , and . Put . Assume finite. Let and be characters whose reading vector is injective on . If , then
No separate hypothesis that has size three is present.
Preamble
import Aesop
import Definitions.Def_Couret_RecohPrimaryCharacters_3b850762e03a
import Definitions.Def_Couret_RecohReconstruction_b9109c17baa8
import Lean.Elab.Tactic.Omega
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Algebra.BigOperators.Group.Finset.Piecewise
import Mathlib.Algebra.BigOperators.Group.Finset.Sigma
import Mathlib.Algebra.Group.AddChar
import Mathlib.Algebra.Module.ZMod
import Mathlib.Analysis.SpecialFunctions.Complex.CircleAddChar
import Mathlib.Data.Complex.Basic
import Mathlib.Data.Finset.Powerset
import Mathlib.Data.Fintype.BigOperators
import Mathlib.Data.Fintype.Card
import Mathlib.Data.Nat.Factorization.Basic
import Mathlib.FieldTheory.Finiteness
import Mathlib.GroupTheory.FiniteAbelian.Duality
import Mathlib.Tactic.Abel
import Mathlib.Tactic.LinearCombination
import Mathlib.Tactic.Ring
import Mathlib.Tactic.Tauto
import Theorems.Thm_Couret_STROBO2TORS_recoh_fibre_rank_le_of_separating_bank
import Definitions.Def_Couret_RecohReconstruction_b9109c17baa8
import Definitions.Def_Couret_RecohPrimaryCharacters_3b850762e03a
import Mathlib.Data.Fintype.BigOperators
set_option autoImplicit false
/-!
Information lower bound for a bank chosen after the labelled ordered
square is known. Reconstructing means actual injectivity on the existing
finite square fibre. The result applies to arbitrary complex characters,
including probes which vanish on that fibre.
-/
namespace Couret.STROBO2TORS
variable {G : Type*} [AddCommGroup G] [DecidableEq G] [Fintype G]
Formal statement
theorem recoh_double_fibre_rank_succ_le_of_separating_bank
(S : Finset G) (r : ℕ) (hcard : (squareFibre S).card = 2 * 2 ^ r)
{k : ℕ} (bank : Fin k → AddChar G ℂ)
(hsep : Set.InjOn
(fun T : Finset G => fun i => recohSupportProbe (bank i) T)
(squareFibre S)) : r + 1 ≤ k := by sorry
end Couret.STROBO2TORS
Source
Alexandre Couret, Couret — Additive reconstruction: STROBO-4, singleton collisions and RECOH formal proof artifacts, https://zenodo.org/records/23980513; archive COURET_MATHEMATIQUES_20261105.zip, SHA-256 19a3b59aee930df74cab79c27b29e014843bd17179a26fef1261ed6b5a651ab7; file RECOH/lean/RecohFibreLower.lean, lines 89–97; source file SHA-256 25b4421c1b3f5d0b165e92effb04f9cec71c9084d67a55ff431cc52c867772ef; theorem Couret.STROBO2TORS.recoh_double_fibre_rank_succ_le_of_separating_bank