Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Equal fiber sizes for a surjective linear map

Proved
QAlgorithms.Papers.Independent.Intakenext100.P30.linear_preimage_sizes

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let UUU and VVV be finite vector spaces over the same field and let f:U→Vf:U\to Vf:U→V be a surjective linear map. Then every v∈Vv\in Vv∈V satisfies

∣f−1(v)∣=∣U∣∣V∣.|f^{-1}(v)|=\frac{|U|}{|V|}.∣f−1(v)∣=∣V∣∣U∣​.

The cardinalities in the displayed quotient are real numbers, so no truncated natural division is involved. This is the equal-fiber fact used by the channel-code construction when the compression alphabet is its actual range.

All alphabets are finite and nonempty, and output Hilbert spaces are finite dimensional and nonzero. A classical–quantum channel assigns a positive semidefinite, trace-one matrix to each input. Encoders may use private randomness; decoders are normalized POVMs. Codes are fixed independently of the message, with no supplied shared key or entanglement. Logarithms and entropies are in bits.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P30
Formal statement
noncomputable section

open scoped BigOperators ComplexConjugate Matrix ComplexOrder

open Filter

namespace QAlgorithms.Papers.Independent.Intakenext100.P30

variable {X Y Z M U V A B C : Type*}

variable [Fintype X] [DecidableEq X] [Fintype Y] [DecidableEq Y]

variable [Fintype Z] [DecidableEq Z] [Fintype M] [DecidableEq M]

variable [Fintype U] [DecidableEq U] [Fintype V] [DecidableEq V]

variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]

variable [Fintype C] [DecidableEq C]

attribute [local instance] Classical.propDecidable

/-- Lemma 3, PDF p.7: onto-range correction. The printed statement omits
surjectivity and fails for the zero map F2→F2. The proof and section II.B use
attained outputs; all fibers of an onto linear map have this size. -/
theorem linear_preimage_sizes {K : Type*} [Field K]
    [AddCommGroup U] [Module K U] [AddCommGroup V] [Module K V]
    (f : U →ₗ[K] V) (honto : Function.Surjective f) (v : V) :
    (Fintype.card {u : U // f u = v} : ℝ) =
      (Fintype.card U : ℝ) / (Fintype.card V : ℝ) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P30

end
Source
Noisy channel coding via privacy amplification and information reconciliation, arXiv:1012.4814v2, PDF p. 7, Lemma 3: Preimage Sizes of Linear Functions (onto-range correction)
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For every field KKK, finite additive commutative groups U,VU,VU,V equipped with KKK-module structures and the finite-type structures needed to count fibers, every surjective KKK-linear map f:U→Vf:U\to Vf:U→V, and every v∈Vv\in Vv∈V, the fiber has real-valued cardinality

∣{u∈U:f(u)=v}∣=∣U∣∣V∣.\bigl|\{u\in U:f(u)=v\}\bigr|=\frac{|U|}{|V|}.​{u∈U:f(u)=v}​=∣V∣∣U∣​.

All cardinalities in this equation are cast to real numbers. No finiteness assumption is imposed on KKK; trivial modules are included, and VVV is nonempty because it contains its zero vector, so the denominator is nonzero.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 2026

    Confirmed by the mission captain (proposal self-audit).

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