Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Counting finite incidences by target labels

Definition
Esgk_FiniteIncidenceCodegreeBound

by mysticflounder · Oct 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

finite-combinatoricsincidence-geometry

This counts pairs in finite source and target sets satisfying a given relation by summing the filtered source cardinalities over target labels.

Definition code
-- Extracted dependency interfaces and their necessary proofs.
import Mathlib

/-
Copyright (c) 2026 Adam McKenna. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
-/


noncomputable section

open scoped Classical

namespace Esgk

def finiteIncidenceCount {α β : Type*}
    (P : Finset α) (C : Finset β) (R : α → β → Prop) : ℕ := by
  classical
  exact ∑ b ∈ C, (P.filter (fun x ↦ R x b)).card


end Esgk

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me