Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

Reduced real rational representations are unique up to scale

Statement

Call a pair (p,q) of real polynomials reduced when q≠0 and no nonconstant polynomial divides both entries. We identify p/q and p′/q′ as the same rational function exactly when pq′=p′q. Every quotient with nonzero denominator has a reduced representation, and any two reduced representations of the same nonzero rational function differ by a common nonzero real scalar. The zero rational function has reduced pair (0,1) up to a nonzero scalar. For q(x)=∑j=0dqjxj, define ∥q∥coef,2:=(∑j=0dqj2)1/2, unchanged by appending zero coefficients. If I is a nonempty interval, two reduced representations of the same rational function with denominators strictly positive on I and coefficient norm 1 are equal.

Facts & Assumptions

Given: Real polynomials p,q with q≠0.

[F1]

Bézout identity and the Euclidean algorithm for polynomials over a field: polynomial division over R gives a monic gcd d and polynomials A,B with Ap+Bq=d; d divides both inputs, and every common divisor divides d.

Proof

1.1givenF1constructalgebra

For a nonzero quotient, let d=gcd⁡(p,q) from [F1] and put p0=p/d, q0=q/d. Then Ap+Bq=d implies Ap0+Bq0=1, so no nonconstant polynomial divides both p0 and q0. For the zero quotient, p=0 and division by the monic gcd⁡(0,q) gives (0,lc⁡(q)); scaling by 1/lc⁡(q) gives (0,1). Any reduced pair representing zero has zero numerator and a nonzero constant denominator.

2.1F1step 1.1algebra

Suppose p0/q0=p1/q1 are nonzero reduced representations. By the stated equality convention, p0q1=p1q0. The Bézout identity Ap0+Bq0=1 from step 1.1, multiplied by p1, shows p0 divides p1; multiplying the same identity by q1 shows q0∣q1. Write p1=hp0 and q1=kq0. The nonzero real leading coefficients of p0 and q0 have nonzero product, so p0q0≠0; cross-multiplication then gives (h−k)p0q0=0 and hence h=k. If h were nonconstant, it would divide both p1 and q1, contradicting reduction. Thus h=k is a nonzero real constant. The zero case is the reduced pair already identified in step 1.1.

3.1givenstep 2.1algebra∎

Since I is nonempty, choose x∈I. If the common scalar from step 2.1 is c, then q1(x)=cq0(x) and both denominators are positive, so c>0. Homogeneity of the coefficient norm and ∥q0∥coef,2=∥q1∥coef,2=1 give c=1, so the numerators agree as well.

Depends on

Used by

Dependency tree · two levels

3 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