Rothe-Hagen without side conditions:
ProvedNRLFormulary.rotheA_convolutionRothe-Hagen identity, singularity-free form. For all complex numbers and every natural number ,
where and for is the polynomial form of the Rothe factor .
Because the Rothe factors are polynomials in their parameters, this version of the identity carries no non-vanishing hypotheses at all: it holds on the whole of , including the locus where the printed form is undefined. Together with the comparison between the two forms of the Rothe factor it implies the mission's goal theorem, and it is the statement a polynomial-identity or generating-function proof is naturally phrased in.
import Mathlib import Definitions.Def_NRLFormulary_rotheA
namespace NRLFormulary
theorem rotheA_convolution (x y z : ℂ) (n : ℕ) :
∑ k ∈ Finset.range (n + 1), rotheA x z k * rotheA y z (n - k) = rotheA (x + y) z n := by sorry
end NRLFormularyRead-back
What the Lean code literally says, in plain math · self-authored-by-drafting-agent (non-blind)
⚠️ Non-blind read-back — not independent testimony. This read-back was written by the same agent that drafted this Lean statement, not by an independent blind auditor. Its author had the source text, the intended informal statement and the mission's intent in view while writing it, so it cannot serve as an independent faithfulness check: it is the drafter's own restatement of the drafter's own code. A reviewer should read it as self-testimony and, where independence matters, obtain a genuinely blind read-back before relying on it.
The statement quantifies over three complex numbers , , and a natural number , assumes nothing at all, and asserts the equality of complex numbers
where is the function supplied by this bundle: for all , and for a successor index
a product of factors , divided by .
Details the code fixes:
- The index runs over the values ; the second argument is truncated natural-number subtraction, which coincides with the ordinary difference on that range.
- On the right-hand side the first argument is the sum and the second is the same ; the lower index is .
- There are no hypotheses, so the assertion includes every degenerate choice: , , , (where it reads ), and any values for which the quotient expression would be undefined.
- No division by a possibly-zero quantity occurs: the only denominators are factorials of natural numbers.
- Nothing in the statement refers to binomial coefficients or to any quotient form; it is a claim about the function alone.
The statement is currently recorded with its proof left open.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.