Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-09
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.

Galois fixed points recover finite-dimensional scalar extensions

Statement

Let E/F be finite Galois with group Γ, and let W be a finite-dimensional semilinear Γ-space. Then μ:E⊗FWΓ⟶W,e⊗w⟼ew is an E-linear isomorphism. If W is an E-algebra and the action is by semilinear algebra automorphisms, this is an algebra isomorphism. For a finite-dimensional F-space V with the canonical action on E⊗FV, (E⊗FV)Γ=1⊗V. Here v↦1⊗v is injective, so 1⊗V is a copy of V. Consequently E⊗F(E⊗FV)Γ≅E⊗FV, respecting algebra multiplication and units when V is an F-algebra.

Facts & Assumptions

[F1]

Semilinear actions and canonical tensor actions have the formulas in Semilinear Galois actions, twists, and split central idempotents.

[F2]

Finite Galois implies ∣Γ∣=[E:F] and EΓ=F: Equivalent characterizations of a finite Galois extension.

[F3]

The trace pairing of a finite separable extension is nondegenerate: The trace form of a finite extension is nondegenerate exactly when the extension is separable.

[F4]

For a separable extension, trace is the sum of the distinct embeddings: Norm and trace from embeddings, with the inseparable exponent in the norm formula. Here normality makes those embeddings precisely Γ.

[F5]

Distinct multiplicative characters of a group are linearly independent over the target field: Dedekind's linear independence theorem for distinct characters.

[F6]

Tensor products of free modules have the product basis, including empty bases: The elementary tensors of two bases form the product basis of the tensor product.

Proof

Given: E/F, Γ, and W as stated. All bases and sums used below are finite.

1.1F2F3algebra

Put n=[E:F]=∣Γ∣≥1, choose an F-basis a1,…,an of E, and form its trace Gram matrix Hij=Tr⁡(aiaj). Separability and nondegeneracy make H invertible. Set bj=∑k(H−1)kjak. Then Tr⁡(aibj)=δij. The invertible coefficient matrix also shows that (bj) is a basis.

1.2F1F2algebra

Any finite F-independent list v1,…,vr in WΓ is E-independent. Indeed, if a relation exists, select one with the least positive number of nonzero coefficients and normalize one of those coefficients to 1. Applying Tσ and subtracting produces a relation with that coefficient zero; minimality forces every other coefficient to be fixed by every σ. They all lie in F, contradicting F-independence. A one-term relation is already impossible since a nonzero scalar cannot annihilate a nonzero vector.

1.3F1F2F6algebra

For the canonical action, choose a finite F-basis (vj) of V. Each tensor has a unique expression ∑jej⊗vj: the product F-basis in F6, regrouped by the vj, proves existence and uniqueness of its coefficients in E. Such a tensor is fixed exactly when σ(ej)=ej for every σ,j, equivalently each ej∈F. It then equals 1⊗∑jejvj. Conversely every 1⊗v is fixed. This also proves that v↦1⊗v is injective, including the empty-basis case.

2.1F4F5step 1.1algebra

Let Xσi=σ(ai) and Yσj=σ(bj). A relation among the rows of X vanishes on the ai, hence by F-linearity on every x∈E; restricting to E× and using independence of the distinct automorphisms as multiplicative characters makes every coefficient zero. Thus X is invertible. The trace formula gives XTY=I, so XYT=I. Its row at 1∈Γ yields ∑iaiσ(bi)=δ1,σ.

2.2step 1.2algebra

Any tensor in the kernel is a finite sum ∑jej⊗wj. By eliminating dependent members of the finite list (wj), rewrite it as ∑k=1rfk⊗vk with the vk F-independent and invariant. Its image is ∑kfkvk=0, so step 1.2 forces every fk=0. Hence the tensor is zero and μ is injective. For W=0 the domain and codomain are zero and the same argument uses the empty list.

3.1F1step 2.1algebra

For w∈W define Pi(w)=∑σ∈Γσ(bi)Tσ(w). For τ∈Γ, semilinearity gives Tτ(Pi(w))=∑σ(τσ)(bi)Tτσ(w)=Pi(w), since σ↦τσ permutes the finite group. Moreover ∑iaiPi(w)=∑σδ1,σTσ(w)=w. Thus Pi(w)∈WΓ, and μ is onto. The formula μ(e⊗w)=ew is F-balanced and E-linear.

4.1

If W is an algebra, its fixed space is an F-subalgebra containing 1. For invariant u,v and e,f∈E, μ((e⊗u)(f⊗v))=efuv=(eu)(fv) and μ(1⊗1)=1. Distributing over finite sums proves multiplicativity on all tensors. Together with bijectivity, this proves both algebra assertions. If E=F, Γ={1} and the map is the usual multiplication F⊗FW≅W; the proof divides by no group order in any characteristic. [F1, step 3.1, step 2.2, step 1.3, algebra] QED

Remarks

The local trace-dual formula refines the evaluation-matrix proof in Zheng, Theorem 3.8.1, pp.132–133. Its injectivity argument uses finite lists, so no choice of an infinite invariant basis is needed.

Depends on

Used by

Dependency tree · two levels

36 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