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

Canonical comparisons between standard graph tensor products

Definition

Setting. Keep R=Q[x1,…,xn] with deg⁡xi=2 and the standard graph bimodules Rw of Standard graph bimodules, support filtrations and characters: for w∈Sn the graded (R,R)-bimodule Rw equals R as a graded Q-vector space with f⋅x=fx and x⋅g=w(g)x, where w(g)(λ)=g(w−1λ), generated by the element 1 of degree 0. Recall the degree-zero isomorphism of graded (R,R)-bimodules μw,v:Rw⊗RRv⟶Rwv,a⊗b⟼a w(b), for w,v∈Sn, with inverse 1↦1⊗1 (the composition remark of that item, where the assignment is checked to be balanced, R-linear on both sides and surjective between free rank-one left R-modules). Here the internal shifts are those of Associative graded algebras, bimodules, and internal shifts: μ is homogeneous of degree zero.

Word comparisons. Let t=(x1,…,xr) and u=(y1,…,ys) be finite words in Sn (the empty word allowed) with the same product x1⋯xr=y1⋯ys=w. Fix the left-to-right iteration of μ and write μt:Rx1⊗R⋯⊗RRxr⟶Rw,a1⊗⋯⊗ar⟼a1 x1(a2) (x1x2)(a3)⋯(x1⋯xr−1)(ar), the composite of the binary multiplications μx1,x2,μx1x2,x3,…; for r=0 the source is the unit bimodule R=Re and μt=idR, and for r=1 it is idRx1. Each μt is a degree-zero isomorphism of graded (R,R)-bimodules with inverse 1↦1⊗1⊗⋯⊗1. The canonical comparison between the two word tensors is ct,u:=μu−1∘μt:Rx1⊗R⋯⊗RRxr⟶Ry1⊗R⋯⊗RRys.

Basic properties. The comparisons form a transitive system: ct,t=id for every word t, and for three words t,u,v with the same product cu,v∘ct,u=ct,v, because μv−1μuμu−1μt=μv−1μt. In particular ct,u is inverse to cu,t. When one of the words has length one the comparison is the corresponding display: for r=1, t=(x1), one has ct,u=μu−1; for s=1, ct,u=μt. The identifications are associative in the sense that for a threefold product the two iterated comparisons built from the binary μ's coincide, this being the equality of the explicit formula above under any rebracketing.

Homogeneity of the Hom spaces. For w,w′∈Sn, Hom⁡‾Re(Rw,Rw′)={≅R,w=w′,0,w≠w′, where the underlined Hom is the direct sum over all homogeneous internal degrees. For w=w′ the identification sends a homogeneous map φ to φ(1)∈R and the internal degree of φ is the degree of φ(1); hence the internal degree-zero part is one-dimensional over Q, spanned by idRw. The vanishing for w≠w′ is the statement that the supports Gr(w)≠Gr(w′) are distinct graphs, and the description for w=w′ is the map remark of Standard graph bimodules, support filtrations and characters.

Small cases. If r=s=0 then w=e and ct,u=idR; if t and u are both words for w, the comparison ct,u is the isomorphism used to compare the two word models of the same standard bimodule Rw. No choice is made: μt is the unique degree-zero bimodule isomorphism with μt(1⊗⋯⊗1)=1, and ct,u is determined by t and u alone.

Depends on

Used by

Dependency tree · two levels

11 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