AFTD Auto-Formalizing Theoretical Domains

bivariate_poisson_pmf_symm

theoremverified

For any natural numbers a and b, bivariate_poisson_pmf a b = bivariate_poisson_pmf b a.

Statement

theorem bivariate_poisson_pmf_symm (a b : ℕ) :
    bivariate_poisson_pmf a b = bivariate_poisson_pmf b a
Source
step towards dual_melas_adjacent_cyclic_patterns_bivariate_poisson_limit
Verified
03 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
  • bivariate_poisson_pmfThe bivariate Poisson probability mass function bivariate_poisson_pmf a b is defined by Real.exp (-(3/2)) * ∑ j ∈ Finset.range (min a b +…

The proof, explained

The bivariate Poisson probability mass function at (a, b) is defined as exp(-3/2) times a sum over j from 0 to min(a, b) of (1/2)^(a + b - j) / (j! * (a - j)! * (b - j)!). Swapping a and b does not change min(a, b) or the sum a + b, and it simply exchanges the two factors (a - j)! and (b - j)! in the denominator. The proof unfolds the definition, uses the commutativity of min and addition to align the summation bounds and numerators, and then equates the summands term by term via the commutativity of real multiplication.

  1. Expanding the definition and commuting the arguments of min and addition aligns the summation bounds and numerators of both sides.

    Unfolding the definition of bivariate_poisson_pmf expresses each side as exp(-3/2) times a sum from j = 0 to the minimum of the two variables. Rewriting with min_comm a b and add_comm a b changes min a b to min b a and a + b - j to b + a - j on the left-hand side, matching the summation range and numerators of the right-hand side.

    lines 4–5

    uses min_comm, add_comm

      unfold bivariate_poisson_pmf
      rw [min_comm a b, add_comm a b]
  2. Equality of the two expressions reduces to checking that their summands agree for each index j in the summation range.

    Congruence strips off the common outer factor exp(-3/2). Because both sums now run over the identical set Finset.range (min b a + 1), Finset.sum_congr reduces the equality of the sums to showing that their terms are equal for an arbitrary index j in that range.

    lines 6–8

    uses Finset.sum_congr

      congr 1
      apply Finset.sum_congr rfl
      intro j hj
  3. The summands are equal because multiplication in the denominator is commutative.

    Congruence strips the shared numerator (1/2)^(b + a - j), leaving only the equality of the denominators: j! * (a - j)! * (b - j)! = j! * (b - j)! * (a - j)!. This is an identity under commutativity of real multiplication, which ring closes.

    lines 9–10

      congr 1
      ring
min_comm
The minimum of two elements is commutative: min a b = min b a.
add_comm
Addition is commutative: a + b = b + a.
Finset.sum_congr
Two finite sums are equal if their index sets are identical and their summands are equal at every element of the index set.

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

/-- The bivariate Poisson PMF is symmetric in its two arguments. -/theorem bivariate_poisson_pmf_symm (a b : ℕ) :    bivariate_poisson_pmf a b = bivariate_poisson_pmf b a := by  unfold bivariate_poisson_pmf  rw [min_comm a b, add_comm a b]  congr 1  apply Finset.sum_congr rfl  intro j hj  congr 1  ring
See it in the graphDiscuss this resultChallenge it