Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedaudited 2026-09-27
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.

Strong transcendence over a subring

Definition

Let R⊆S be an inclusion of commutative rings (Subring: a subset containing 1R and closed under addition, additive inverses and multiplication) and let x∈S. The element x is strongly transcendental over R when the implication

u (a0+a1x+⋯+akxk)=0⟹uai=0  for every i∈{0,…,k}

holds for every integer k≥0, every multiplier u∈S and all a0,a1,…,ak∈R; the polynomial a0+a1x+⋯+akxk is the evaluation in S of a polynomial over R (The polynomial ring over a commutative ring as finitely supported coefficient sequences with convolution), so the condition is a statement about all polynomial relations that hold in S between x and the elements of R.

Conventions kept here. (i) The multiplier u is retained on purpose. It records annihilators: when S has zero divisors the vanishing of a product u⋅P(x) does not force P(x) to vanish, and it is the annihilator form above, not mere linear independence of the monomials, that is used in the minimal-prime argument of this page. (ii) No finiteness or noetherian hypothesis is imposed on R, on S or on the polynomial degree; x has trivial annihilator in S: applying the condition to P(X)=X gives ux=0⇒u=0. The zero polynomial (k=0, a0=0) is included. (iii) The condition is tied to the chosen pair R⊆S and is not preserved by an arbitrary quotient: for R=k a field S=k[z]×k[y] and x=(z,y), the element x is strongly transcendental over k (a multiplier u=(u1,u2) with u⋅(P(z),P(y))=0 has u1P(z)=0 and u2P(y)=0, so if P=0 all coefficients vanish, whereas if P≠0 both P(z) and P(y) are nonzero, so the domain property forces u1=u2=0; in either case uai=0 for every i), yet in the quotient S/q by the prime q=(z−1)k[z]×k[y] the image of x is 1∈k, which is a root of the monic X−1 and therefore not transcendental at all. The descent proved on this page is consequently formulated for minimal primes of reduced rings.

Domains. If S is an integral domain (Zero divisor, and integral domain: a commutative ring with 1≠0 and no zero divisors), then strong transcendence of x over R is the same as saying that x is transcendental over the fraction field Frac⁡(R), viewed inside Frac⁡(S) (The field of fractions Frac⁡(D)=(D∖{0})−1D of an integral domain). Suppose first that x is strongly transcendental over R and let P∈Frac⁡(R)[X] be nonzero with P(x)=0; clearing denominators gives u∈R nonzero with uP∈R[X] still nonzero, and evaluating gives u⋅(uP)(x)=u⋅0=0, so strong transcendence applied to the polynomial uP and the multiplier u forces u⋅(upi)=0 for every coefficient pi of P; since S is a domain and u≠0, this gives pi=0 for all i, contradicting P≠0. Conversely, if x is transcendental over Frac⁡(R) and u(a0+⋯+akxk)=0 with u≠0, then cancelling the nonzero element u in the domain S exhibits the polynomial a0+⋯+akXk∈R[X] as vanishing at x; if some ai were nonzero that polynomial would be a nonzero element of Frac⁡(R)[X] vanishing at x, contradicting transcendence, so all ai vanish and uai=0 holds; for u=0 the conclusion is immediate. In this case the annihilator clause is automatic and the condition reduces to the classical notion. Nothing in the argument uses integrality; compare Integral elements over a commutative ring and algebraic integers, where the integral element is the opposite extreme, a root of a monic polynomial.

Depends on

Used by

Dependency tree · two levels

16 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