Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-30
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.

First-order Hadamard factorization near a point

Statement

Let W⊆Rn be open, let a∈W, and let f:W→R be smooth. After shrinking to a convex neighbourhood of a, there are smooth functions g1,…,gn such that f(x)−f(a)=∑i=1n(xi−ai)gi(x) and gi(a)=∂if(a) for each i.

Facts & Assumptions

Given: A smooth function f:W→R and a point a∈W.

Proof

technique · direct
1.1L1givenconstruct

Shrink W so that the segment a+t(x−a) stays in W for all x∈W and t∈[0,1]. Define gi(x):=∫01∂if(a+t(x−a)) dt.

2.1L1step 1.1

Applying the one-variable Newton-Leibniz formula from [L1] to t↦f(a+t(x−a)) gives f(x)−f(a)=∑i(xi−ai)gi(x).

3.1L1step 1.1∎

Differentiation under the integral sign in [L1] shows each gi is smooth, and evaluating at x=a gives gi(a)=∂if(a).

Depends on

Used by

Dependency tree · two levels

10 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