Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Additive count number is linear

Proved
APFPaper5.K1.additive_count_number_is_linear

by FiniteUniverse · Nov 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

apfapf-referencesib-v44-2026-11

If a real-valued function h of two natural counts is additive under componentwise addition, then h(a,k)=a h(1,0)+k h(0,1). Additivity is supplied; the two coefficients and their physical meaning are not determined.

Preamble
import Definitions.Def_APF_B02_DeclaredInput
import Theorems.Thm_APFPaper5_K1_reaching_every_value_needs_a_turn_over
import Theorems.Thm_APFPaper5_K1_holdStep_returns
import Theorems.Thm_APFPaper5_K1_turn_mixes_the_pair_of_step
import Theorems.Thm_APFPaper5_K1_two_distinctions_quarter_turn
import Theorems.Thm_APFPaper5_K1_quarter2_is_not_a_rearrangement_in_any_naming
import Mathlib.Algebra.Order.BigOperators.Group.Finset

set_option autoImplicit false



namespace APFPaper5.K1
end APFPaper5.K1
open APFPaper5.K1
Formal statement
theorem APFPaper5.K1.additive_count_number_is_linear (h : ℕ → ℕ → ℝ)
    (hadd : ∀ a k a' k' : ℕ, h (a + a') (k + k') = h a k + h a' k') (a k : ℕ) :
    h a k = (a : ℝ) * h 1 0 + (k : ℝ) * h 0 1 := by sorry
Source
Sib v44 Theorems/Thm_APFPaper5_K1_list_reduced.lean:121
Human review
  • Endorsed by Shuze Chen · Nov 16, 2026

    Confirmed by the moderator at approval.

  • Endorsed by FiniteUniverse · Nov 16, 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