Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: AI-adaptedPipeline-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.

Balanced triples over the two charts of P1 and the globalization map

Definition

Let V be a finite-dimensional vector space over Q(q), let M⊆V be an A=Z[q,q−1]-submodule spanning V, and let L0,L∞ be free full rational chart lattices over A0,A∞ (as for a based module in The bar lattice and the divided-power integral lattice of a based module). Put LZ:=M∩L0,LZ−:=M∩L∞,EZ:=M∩L0∩L∞. The integral triple (M,L0,L∞) is balanced if the canonical Z-linear map EZ⟶LZ/qLZ=(M∩L0)/(M∩qL0) is an isomorphism. Its inverse is the integral globalization map on the integral residue subgroup. Rational balancedness is the corresponding isomorphism Q⊗ZEZ→L0/qL0, after extending the integral subgroup by Q. In the applications of this page the integral subgroup is ZB for the lower global family B, and its globalization gives the lower lifts G(b).

For a balanced triple, the two-chart lemma of this page proves M≅A⊗ZEZ, LZ≅Z[q]⊗ZEZ and LZ−≅Z[q−1]⊗ZEZ. If the triple is balanced and EZ has a finite Z-basis BE whose rational residue classes are a basis of L0/qL0, these lifts give bases of M,L0,L∞ over A,A0,A∞ respectively. Thus A-freeness of M is a conclusion from integral balancedness together with a proved free integral residue basis; it is not automatic for an arbitrary not-finitely-generated Z-submodule. All definitions apply componentwise to the finite root or label spaces.

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