Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generated
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.

Coefficientwise formal associative deformations

Definition

Let A be a commutative unital algebra over R, with multiplication m(f,g)=fg. Write A⟦ℏ⟧ for the real formal power-series module with coefficients in A; its underlying coefficient and Cauchy-product conventions are those of Formal power series over a commutative ring and the coefficient-extraction functional [xn]. The ℏ-adic topology is the coefficient-prefix topology of Order of a formal series, congruence modulo xN, and the x-adic notions of convergence and Cauchy sequence: two series are close modulo ℏN when their coefficients agree in degrees below N.

A formal associative deformation of A is specified by real-bilinear maps Br:A×A→A for r≥1, with B0:=m, and the product (∑i≥0ℏifi)⋆(∑j≥0ℏjgj)=∑N≥0ℏN∑i,j,r≥0i+j+r=NBr(fi,gj). For each fixed N the inner sum is finite, so this formula defines a coefficientwise-continuous, R⟦ℏ⟧-bilinear product. It is required to be associative and unital with unit 1. The unit requirement is equivalent to Br(1,f)=Br(f,1)=0 for r≥1. Reduction modulo ℏ is the original product m.

This definition alone asserts no differential-order condition, no specified first-order bracket, no convergence at a numerical value of ℏ, and no existence or classification theorem.

Depends on

Used by

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.

Sources