Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedverified 2026-11-04 (gpt-6.1-sol)
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.

Specified mathematical mirror datum

Definition

A specified mathematical mirror datum is a typed record. It includes (i) declared categories CA,CB in which the two family arrows pA:XA→BA and pB:XB→BB live, together with the chosen complex, symplectic, or other structures on their objects and arrows and the axioms those structures satisfy; (ii) a declared category U containing the selected parameter objects UA,UB, specified inclusions jA:UA↪BA and jB:UB↪BB in the respective base categories, and a specified morphism φ:UA→UB in U; (iii) coefficient rings RA,RB, specified completions or filtrations on them, a comparison ring R, and ring homomorphisms RA→R and RB→R (or a specified ring isomorphism when the rings are identified); (iv) for every category whose objects are designated as branes in the instance, its objects and morphisms, grading, and local-system conventions; and (v) either a functor, specified by its object and morphism assignments, between the declared categories or invariant functors from them to a common declared target category, together with the objects and comparison morphism to be compared. Every symbol in the record therefore has an ambient type, and every additional structure is accompanied by its defining axioms. The selected categories, bases, and structures may vary by instance; the tuple does not select them implicitly.

Here a functor F:C→D consists of an assignment x↦F(x) on objects and maps Fx,y:Hom⁡C(x,y)→Hom⁡D(F(x),F(y)) satisfying F(id⁡x)=id⁡F(x) and F(g∘f)=F(g)∘F(f) for every composable pair f,g. These requirements apply to each functor in (v), including invariant functors.

The datum makes a later comparison proposition well-formed; it does not assert that φ is an isomorphism or that the functor or invariant is an equivalence. An A-side is required to be symplectic only when that is part of the selected datum. Compact Calabi–Yau hypotheses are instance-specific and are not built into this generic definition. If a symplectic form is selected, use the convention in Symplectic form and symplectic manifold.

Depends on

Dependency tree · 2 levels

Sources