Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Hermite–Genocchi simplex formula for divided differences

Statement

Let q∈N, let f∈Cq([a,b]), and let t0,…,tq∈[a,b] be distinct real nodes. For q≥1, define Δq={(u1,…,uq)∈[0,∞)q: u1+⋯+uq≤1},u0=1−∑j=1quj. Then f[t0,…,tq]=∫Δqf(q) ⁣(∑j=0qujtj) du1⋯duq,vol⁡(Δq)=1q!. For q=0, the integral is by convention evaluation at t0, and vol⁡(Δ0):=1. For q≥1, the integral over Δq is the iterated Riemann integral with 0≤u1≤1 and, successively, 0≤uj≤1−∑k=1j−1uk for 2≤j≤q.

Facts & Assumptions

Given: q∈N, f∈Cq([a,b]), and distinct nodes t0,…,tq∈[a,b].

[F1]

Divided differences on distinct nodes: divided differences satisfy the recursive endpoint rule.

[F2]

Divided differences are symmetric leading coefficients: divided differences are symmetric in their nodes.

[F3]

Higher derivatives and the classes Ck and C∞: f∈Cq means its derivatives through order q exist and are continuous, including their one-sided endpoint extensions.

[F4]

Newton–Leibniz needs only continuity on [a,b], differentiability on (a,b), and a Riemann-integrable extension of the interior derivative: for a continuous function on a closed interval whose interior derivative has a Riemann-integrable extension, the integral of that extension is the endpoint increment.

[F5]

The natural numbers N (von Neumann): 0∈N, so the order-zero base case is included.

[F6]

The principle of mathematical induction: a property true at 0 and preserved by successor holds for every natural number.

Proof

1.1givenF1F5

For q=0, which is allowed by [F5], the integral convention gives f(t0)=f[t0] and the zero-dimensional simplex has volume one.

1.2F1F2F3F4F6inductionalgebra

By [F6], use induction on q∈N. Suppose the formula is established in order q−1, where q≥1. In the recursive rule [F1], express the two order-(q−1) divided differences by the induction hypothesis. The bottom face uq=0 has argument t0+∑j=1q−1uj(tj−t0) and gives f[t0,…,tq−1]. On the top face uq=1−∑j=1q−1uj, the same argument is tq+∑j=1q−1uj(tj−tq) and gives f[t1,…,tq] by symmetry [F2]. For fixed u1,…,uq−1 with sum less than 1, the derivative with respect to uq of f(q−1) ⁣(t0+∑j=1quj(tj−t0)) is (tq−t0)f(q)(∑j=0qujtj). The derivative is continuous by [F3], hence Riemann integrable. Applying [F4] on the uq interval, followed by integration over the other coordinates, shows that the difference of the two face integrals is (tq−t0) times the q-dimensional integral in the statement. When the outer coordinates sum to 1, the inner uq interval is [0,0] and its integral is zero; for q=1 there are no outer coordinates and the interval is [0,1]. Division by tq−t0≠0 gives the order-q formula.

2.1step 1.1F4F6inductionalgebra∎

By [F6], prove the volume formula by induction, with its q=0 case from step 1.1. For q≥1, fix the outer coordinate u1∈[0,1]. The remaining coordinates form a (q−1)-simplex scaled by 1−u1. If q=1, its zero-dimensional volume is 1; if q≥2 and u1<1, the dilation to Δq−1 has Jacobian (1−u1)q−1, while the section at u1=1 has (q−1)-volume zero. Thus, by induction, the section volume is (1−u1)q−1/(q−1)!. The function H(u)=−(1−u)q/q! has derivative (1−u)q−1/(q−1)!; applying [F4] to H on [0,1] gives H(1)−H(0)=1/q!. vol⁡(Δq)=∫01(1−u1)q−1(q−1)! du1=1q!. The induction and the divided-difference identity prove the statement.

Depends on

Used by

Dependency tree · two levels

19 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources