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.
A non-Poisson bivector cannot be a first-order star commutator
Statement refuted
Every smooth bivector field on a smooth manifold is the first-order antisymmetric commutator of some unital associative formal deformation of its function algebra.
Facts & Assumptions
Given: The coordinate bivector convention on , and the first-order obstruction statement in [F3].
General Poisson manifolds from bivector fields: in coordinates, .
Coordinate Jacobi and Schouten self-bracket criterion for Poisson bivectors: the bracket satisfies Jacobi exactly when the coordinate Jacobiator coefficients vanish.
The first-order commutator of an associative deformation is Poisson: the first-order skew part of any unital associative formal deformation of a commutative algebra is a Poisson-algebra bracket.
Counterexample
On with coordinates , take the smooth bivector By [F1], its coordinate brackets are , , and .
Using the biderivation rule, its Jacobiator on these coordinate functions is At this is nonzero; by [F2], is not Poisson.
If a unital associative formal deformation had this first-order skew bracket, [F3] would force that bracket to satisfy Jacobi, contradicting step 2.1. Therefore this smooth bivector is not the first-order antisymmetric commutator of any such deformation, refuting the universal claim.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
7 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.