Home | Metamath
Proof Explorer Theorem List (p. 204 of 449) | < Previous Next > |
Bad symbols? Try the
GIF version. |
||
Mirrors > Metamath Home Page > MPE Home Page > Theorem List Contents > Recent Proofs This page: Page List |
Color key: | Metamath Proof Explorer
(1-28623) |
Hilbert Space Explorer
(28624-30146) |
Users' Mathboxes
(30147-44804) |
Type | Label | Description |
---|---|---|
Statement | ||
Theorem | ply1bascl 20301 | A univariate polynomial is a univariate power series. (Contributed by Stefan O'Rear, 25-Mar-2015.) |
⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 𝐵 = (Base‘𝑃) ⇒ ⊢ (𝐹 ∈ 𝐵 → 𝐹 ∈ (Base‘(PwSer1‘𝑅))) | ||
Theorem | ply1bascl2 20302 | A univariate polynomial is a multivariate polynomial on one index. (Contributed by Stefan O'Rear, 25-Mar-2015.) |
⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 𝐵 = (Base‘𝑃) ⇒ ⊢ (𝐹 ∈ 𝐵 → 𝐹 ∈ (Base‘(1o mPoly 𝑅))) | ||
Theorem | coe1fval 20303* | Value of the univariate polynomial coefficient function. (Contributed by Stefan O'Rear, 21-Mar-2015.) |
⊢ 𝐴 = (coe1‘𝐹) ⇒ ⊢ (𝐹 ∈ 𝑉 → 𝐴 = (𝑛 ∈ ℕ0 ↦ (𝐹‘(1o × {𝑛})))) | ||
Theorem | coe1fv 20304 | Value of an evaluated coefficient in a polynomial coefficient vector. (Contributed by Stefan O'Rear, 21-Mar-2015.) |
⊢ 𝐴 = (coe1‘𝐹) ⇒ ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑁 ∈ ℕ0) → (𝐴‘𝑁) = (𝐹‘(1o × {𝑁}))) | ||
Theorem | fvcoe1 20305 | Value of a multivariate coefficient in terms of the coefficient vector. (Contributed by Stefan O'Rear, 21-Mar-2015.) |
⊢ 𝐴 = (coe1‘𝐹) ⇒ ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑋 ∈ (ℕ0 ↑m 1o)) → (𝐹‘𝑋) = (𝐴‘(𝑋‘∅))) | ||
Theorem | coe1fval3 20306* | Univariate power series coefficient vectors expressed as a function composition. (Contributed by Stefan O'Rear, 25-Mar-2015.) |
⊢ 𝐴 = (coe1‘𝐹) & ⊢ 𝐵 = (Base‘𝑃) & ⊢ 𝑃 = (PwSer1‘𝑅) & ⊢ 𝐺 = (𝑦 ∈ ℕ0 ↦ (1o × {𝑦})) ⇒ ⊢ (𝐹 ∈ 𝐵 → 𝐴 = (𝐹 ∘ 𝐺)) | ||
Theorem | coe1f2 20307 | Functionality of univariate power series coefficient vectors. (Contributed by Stefan O'Rear, 25-Mar-2015.) |
⊢ 𝐴 = (coe1‘𝐹) & ⊢ 𝐵 = (Base‘𝑃) & ⊢ 𝑃 = (PwSer1‘𝑅) & ⊢ 𝐾 = (Base‘𝑅) ⇒ ⊢ (𝐹 ∈ 𝐵 → 𝐴:ℕ0⟶𝐾) | ||
Theorem | coe1fval2 20308* | Univariate polynomial coefficient vectors expressed as a function composition. (Contributed by Stefan O'Rear, 21-Mar-2015.) |
⊢ 𝐴 = (coe1‘𝐹) & ⊢ 𝐵 = (Base‘𝑃) & ⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 𝐺 = (𝑦 ∈ ℕ0 ↦ (1o × {𝑦})) ⇒ ⊢ (𝐹 ∈ 𝐵 → 𝐴 = (𝐹 ∘ 𝐺)) | ||
Theorem | coe1f 20309 | Functionality of univariate polynomial coefficient vectors. (Contributed by Stefan O'Rear, 21-Mar-2015.) |
⊢ 𝐴 = (coe1‘𝐹) & ⊢ 𝐵 = (Base‘𝑃) & ⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 𝐾 = (Base‘𝑅) ⇒ ⊢ (𝐹 ∈ 𝐵 → 𝐴:ℕ0⟶𝐾) | ||
Theorem | coe1fvalcl 20310 | A coefficient of a univariate polynomial over a class/ring is an element of this class/ring. (Contributed by AV, 9-Oct-2019.) |
⊢ 𝐴 = (coe1‘𝐹) & ⊢ 𝐵 = (Base‘𝑃) & ⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 𝐾 = (Base‘𝑅) ⇒ ⊢ ((𝐹 ∈ 𝐵 ∧ 𝑁 ∈ ℕ0) → (𝐴‘𝑁) ∈ 𝐾) | ||
Theorem | coe1sfi 20311 | Finite support of univariate polynomial coefficient vectors. (Contributed by Stefan O'Rear, 21-Mar-2015.) (Revised by AV, 19-Jul-2019.) |
⊢ 𝐴 = (coe1‘𝐹) & ⊢ 𝐵 = (Base‘𝑃) & ⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 0 = (0g‘𝑅) ⇒ ⊢ (𝐹 ∈ 𝐵 → 𝐴 finSupp 0 ) | ||
Theorem | coe1fsupp 20312* | The coefficient vector of a univariate polynomial is a finitely supported mapping from the nonnegative integers to the elements of the coefficient class/ring for the polynomial. (Contributed by AV, 3-Oct-2019.) |
⊢ 𝐴 = (coe1‘𝐹) & ⊢ 𝐵 = (Base‘𝑃) & ⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 0 = (0g‘𝑅) & ⊢ 𝐾 = (Base‘𝑅) ⇒ ⊢ (𝐹 ∈ 𝐵 → 𝐴 ∈ {𝑔 ∈ (𝐾 ↑m ℕ0) ∣ 𝑔 finSupp 0 }) | ||
Theorem | mptcoe1fsupp 20313* | A mapping involving coefficients of polynomials is finitely supported. (Contributed by AV, 12-Oct-2019.) |
⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 𝐵 = (Base‘𝑃) & ⊢ 0 = (0g‘𝑅) ⇒ ⊢ ((𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) → (𝑘 ∈ ℕ0 ↦ ((coe1‘𝑀)‘𝑘)) finSupp 0 ) | ||
Theorem | coe1ae0 20314* | The coefficient vector of a univariate polynomial is 0 almost everywhere. (Contributed by AV, 19-Oct-2019.) |
⊢ 𝐴 = (coe1‘𝐹) & ⊢ 𝐵 = (Base‘𝑃) & ⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 0 = (0g‘𝑅) ⇒ ⊢ (𝐹 ∈ 𝐵 → ∃𝑠 ∈ ℕ0 ∀𝑛 ∈ ℕ0 (𝑠 < 𝑛 → (𝐴‘𝑛) = 0 )) | ||
Theorem | vr1cl 20315 | The generator of a univariate polynomial algebra is contained in the base set. (Contributed by Stefan O'Rear, 19-Mar-2015.) |
⊢ 𝑋 = (var1‘𝑅) & ⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 𝐵 = (Base‘𝑃) ⇒ ⊢ (𝑅 ∈ Ring → 𝑋 ∈ 𝐵) | ||
Theorem | opsr0 20316 | Zero in the ordered power series ring. (Contributed by Stefan O'Rear, 23-Mar-2015.) (Revised by Mario Carneiro, 2-Oct-2015.) |
⊢ 𝑆 = (𝐼 mPwSer 𝑅) & ⊢ 𝑂 = ((𝐼 ordPwSer 𝑅)‘𝑇) & ⊢ (𝜑 → 𝑇 ⊆ (𝐼 × 𝐼)) ⇒ ⊢ (𝜑 → (0g‘𝑆) = (0g‘𝑂)) | ||
Theorem | opsr1 20317 | One in the ordered power series ring. (Contributed by Stefan O'Rear, 23-Mar-2015.) (Revised by Mario Carneiro, 2-Oct-2015.) |
⊢ 𝑆 = (𝐼 mPwSer 𝑅) & ⊢ 𝑂 = ((𝐼 ordPwSer 𝑅)‘𝑇) & ⊢ (𝜑 → 𝑇 ⊆ (𝐼 × 𝐼)) ⇒ ⊢ (𝜑 → (1r‘𝑆) = (1r‘𝑂)) | ||
Theorem | mplplusg 20318 | Value of addition in a polynomial ring. (Contributed by Stefan O'Rear, 21-Mar-2015.) (Revised by Mario Carneiro, 2-Oct-2015.) |
⊢ 𝑌 = (𝐼 mPoly 𝑅) & ⊢ 𝑆 = (𝐼 mPwSer 𝑅) & ⊢ + = (+g‘𝑌) ⇒ ⊢ + = (+g‘𝑆) | ||
Theorem | mplmulr 20319 | Value of multiplication in a polynomial ring. (Contributed by Stefan O'Rear, 21-Mar-2015.) (Revised by Mario Carneiro, 2-Oct-2015.) |
⊢ 𝑌 = (𝐼 mPoly 𝑅) & ⊢ 𝑆 = (𝐼 mPwSer 𝑅) & ⊢ · = (.r‘𝑌) ⇒ ⊢ · = (.r‘𝑆) | ||
Theorem | psr1plusg 20320 | Value of addition in a univariate power series ring. (Contributed by Stefan O'Rear, 21-Mar-2015.) (Revised by Mario Carneiro, 2-Oct-2015.) |
⊢ 𝑌 = (PwSer1‘𝑅) & ⊢ 𝑆 = (1o mPwSer 𝑅) & ⊢ + = (+g‘𝑌) ⇒ ⊢ + = (+g‘𝑆) | ||
Theorem | psr1vsca 20321 | Value of scalar multiplication in a univariate power series ring. (Contributed by Stefan O'Rear, 21-Mar-2015.) (Revised by Mario Carneiro, 2-Oct-2015.) |
⊢ 𝑌 = (PwSer1‘𝑅) & ⊢ 𝑆 = (1o mPwSer 𝑅) & ⊢ · = ( ·𝑠 ‘𝑌) ⇒ ⊢ · = ( ·𝑠 ‘𝑆) | ||
Theorem | psr1mulr 20322 | Value of multiplication in a univariate power series ring. (Contributed by Stefan O'Rear, 21-Mar-2015.) (Revised by Mario Carneiro, 2-Oct-2015.) |
⊢ 𝑌 = (PwSer1‘𝑅) & ⊢ 𝑆 = (1o mPwSer 𝑅) & ⊢ · = (.r‘𝑌) ⇒ ⊢ · = (.r‘𝑆) | ||
Theorem | ply1plusg 20323 | Value of addition in a univariate polynomial ring. (Contributed by Stefan O'Rear, 21-Mar-2015.) (Revised by Mario Carneiro, 4-Jul-2015.) |
⊢ 𝑌 = (Poly1‘𝑅) & ⊢ 𝑆 = (1o mPoly 𝑅) & ⊢ + = (+g‘𝑌) ⇒ ⊢ + = (+g‘𝑆) | ||
Theorem | ply1vsca 20324 | Value of scalar multiplication in a univariate polynomial ring. (Contributed by Stefan O'Rear, 21-Mar-2015.) (Revised by Mario Carneiro, 4-Jul-2015.) |
⊢ 𝑌 = (Poly1‘𝑅) & ⊢ 𝑆 = (1o mPoly 𝑅) & ⊢ · = ( ·𝑠 ‘𝑌) ⇒ ⊢ · = ( ·𝑠 ‘𝑆) | ||
Theorem | ply1mulr 20325 | Value of multiplication in a univariate polynomial ring. (Contributed by Stefan O'Rear, 21-Mar-2015.) (Revised by Mario Carneiro, 4-Jul-2015.) |
⊢ 𝑌 = (Poly1‘𝑅) & ⊢ 𝑆 = (1o mPoly 𝑅) & ⊢ · = (.r‘𝑌) ⇒ ⊢ · = (.r‘𝑆) | ||
Theorem | ressply1bas2 20326 | The base set of a restricted polynomial algebra consists of power series in the subring which are also polynomials (in the parent ring). (Contributed by Mario Carneiro, 3-Jul-2015.) |
⊢ 𝑆 = (Poly1‘𝑅) & ⊢ 𝐻 = (𝑅 ↾s 𝑇) & ⊢ 𝑈 = (Poly1‘𝐻) & ⊢ 𝐵 = (Base‘𝑈) & ⊢ (𝜑 → 𝑇 ∈ (SubRing‘𝑅)) & ⊢ 𝑊 = (PwSer1‘𝐻) & ⊢ 𝐶 = (Base‘𝑊) & ⊢ 𝐾 = (Base‘𝑆) ⇒ ⊢ (𝜑 → 𝐵 = (𝐶 ∩ 𝐾)) | ||
Theorem | ressply1bas 20327 | A restricted polynomial algebra has the same base set. (Contributed by Mario Carneiro, 3-Jul-2015.) |
⊢ 𝑆 = (Poly1‘𝑅) & ⊢ 𝐻 = (𝑅 ↾s 𝑇) & ⊢ 𝑈 = (Poly1‘𝐻) & ⊢ 𝐵 = (Base‘𝑈) & ⊢ (𝜑 → 𝑇 ∈ (SubRing‘𝑅)) & ⊢ 𝑃 = (𝑆 ↾s 𝐵) ⇒ ⊢ (𝜑 → 𝐵 = (Base‘𝑃)) | ||
Theorem | ressply1add 20328 | A restricted polynomial algebra has the same addition operation. (Contributed by Mario Carneiro, 3-Jul-2015.) |
⊢ 𝑆 = (Poly1‘𝑅) & ⊢ 𝐻 = (𝑅 ↾s 𝑇) & ⊢ 𝑈 = (Poly1‘𝐻) & ⊢ 𝐵 = (Base‘𝑈) & ⊢ (𝜑 → 𝑇 ∈ (SubRing‘𝑅)) & ⊢ 𝑃 = (𝑆 ↾s 𝐵) ⇒ ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋(+g‘𝑈)𝑌) = (𝑋(+g‘𝑃)𝑌)) | ||
Theorem | ressply1mul 20329 | A restricted polynomial algebra has the same multiplication operation. (Contributed by Mario Carneiro, 3-Jul-2015.) |
⊢ 𝑆 = (Poly1‘𝑅) & ⊢ 𝐻 = (𝑅 ↾s 𝑇) & ⊢ 𝑈 = (Poly1‘𝐻) & ⊢ 𝐵 = (Base‘𝑈) & ⊢ (𝜑 → 𝑇 ∈ (SubRing‘𝑅)) & ⊢ 𝑃 = (𝑆 ↾s 𝐵) ⇒ ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋(.r‘𝑈)𝑌) = (𝑋(.r‘𝑃)𝑌)) | ||
Theorem | ressply1vsca 20330 | A restricted power series algebra has the same scalar multiplication operation. (Contributed by Mario Carneiro, 3-Jul-2015.) |
⊢ 𝑆 = (Poly1‘𝑅) & ⊢ 𝐻 = (𝑅 ↾s 𝑇) & ⊢ 𝑈 = (Poly1‘𝐻) & ⊢ 𝐵 = (Base‘𝑈) & ⊢ (𝜑 → 𝑇 ∈ (SubRing‘𝑅)) & ⊢ 𝑃 = (𝑆 ↾s 𝐵) ⇒ ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑇 ∧ 𝑌 ∈ 𝐵)) → (𝑋( ·𝑠 ‘𝑈)𝑌) = (𝑋( ·𝑠 ‘𝑃)𝑌)) | ||
Theorem | subrgply1 20331 | A subring of the base ring induces a subring of polynomials. (Contributed by Mario Carneiro, 3-Jul-2015.) |
⊢ 𝑆 = (Poly1‘𝑅) & ⊢ 𝐻 = (𝑅 ↾s 𝑇) & ⊢ 𝑈 = (Poly1‘𝐻) & ⊢ 𝐵 = (Base‘𝑈) ⇒ ⊢ (𝑇 ∈ (SubRing‘𝑅) → 𝐵 ∈ (SubRing‘𝑆)) | ||
Theorem | gsumply1subr 20332 | Evaluate a group sum in a polynomial ring over a subring. (Contributed by AV, 22-Sep-2019.) (Proof shortened by AV, 31-Jan-2020.) |
⊢ 𝑆 = (Poly1‘𝑅) & ⊢ 𝐻 = (𝑅 ↾s 𝑇) & ⊢ 𝑈 = (Poly1‘𝐻) & ⊢ 𝐵 = (Base‘𝑈) & ⊢ (𝜑 → 𝑇 ∈ (SubRing‘𝑅)) & ⊢ (𝜑 → 𝐴 ∈ 𝑉) & ⊢ (𝜑 → 𝐹:𝐴⟶𝐵) ⇒ ⊢ (𝜑 → (𝑆 Σg 𝐹) = (𝑈 Σg 𝐹)) | ||
Theorem | psrbaspropd 20333 | Property deduction for power series base set. (Contributed by Stefan O'Rear, 27-Mar-2015.) |
⊢ (𝜑 → (Base‘𝑅) = (Base‘𝑆)) ⇒ ⊢ (𝜑 → (Base‘(𝐼 mPwSer 𝑅)) = (Base‘(𝐼 mPwSer 𝑆))) | ||
Theorem | psrplusgpropd 20334* | Property deduction for power series addition. (Contributed by Stefan O'Rear, 27-Mar-2015.) (Revised by Mario Carneiro, 3-Oct-2015.) |
⊢ (𝜑 → 𝐵 = (Base‘𝑅)) & ⊢ (𝜑 → 𝐵 = (Base‘𝑆)) & ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+g‘𝑅)𝑦) = (𝑥(+g‘𝑆)𝑦)) ⇒ ⊢ (𝜑 → (+g‘(𝐼 mPwSer 𝑅)) = (+g‘(𝐼 mPwSer 𝑆))) | ||
Theorem | mplbaspropd 20335* | Property deduction for polynomial base set. (Contributed by Stefan O'Rear, 27-Mar-2015.) (Proof shortened by AV, 19-Jul-2019.) |
⊢ (𝜑 → 𝐵 = (Base‘𝑅)) & ⊢ (𝜑 → 𝐵 = (Base‘𝑆)) & ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+g‘𝑅)𝑦) = (𝑥(+g‘𝑆)𝑦)) ⇒ ⊢ (𝜑 → (Base‘(𝐼 mPoly 𝑅)) = (Base‘(𝐼 mPoly 𝑆))) | ||
Theorem | psropprmul 20336 | Reversing multiplication in a ring reverses multiplication in the power series ring. (Contributed by Stefan O'Rear, 27-Mar-2015.) |
⊢ 𝑌 = (𝐼 mPwSer 𝑅) & ⊢ 𝑆 = (oppr‘𝑅) & ⊢ 𝑍 = (𝐼 mPwSer 𝑆) & ⊢ · = (.r‘𝑌) & ⊢ ∙ = (.r‘𝑍) & ⊢ 𝐵 = (Base‘𝑌) ⇒ ⊢ ((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵) → (𝐹 ∙ 𝐺) = (𝐺 · 𝐹)) | ||
Theorem | ply1opprmul 20337 | Reversing multiplication in a ring reverses multiplication in the univariate polynomial ring. (Contributed by Stefan O'Rear, 27-Mar-2015.) |
⊢ 𝑌 = (Poly1‘𝑅) & ⊢ 𝑆 = (oppr‘𝑅) & ⊢ 𝑍 = (Poly1‘𝑆) & ⊢ · = (.r‘𝑌) & ⊢ ∙ = (.r‘𝑍) & ⊢ 𝐵 = (Base‘𝑌) ⇒ ⊢ ((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵) → (𝐹 ∙ 𝐺) = (𝐺 · 𝐹)) | ||
Theorem | 00ply1bas 20338 | Lemma for ply1basfvi 20339 and deg1fvi 24608. (Contributed by Stefan O'Rear, 28-Mar-2015.) |
⊢ ∅ = (Base‘(Poly1‘∅)) | ||
Theorem | ply1basfvi 20339 | Protection compatibility of the univariate polynomial base set. (Contributed by Stefan O'Rear, 27-Mar-2015.) |
⊢ (Base‘(Poly1‘𝑅)) = (Base‘(Poly1‘( I ‘𝑅))) | ||
Theorem | ply1plusgfvi 20340 | Protection compatibility of the univariate polynomial addition. (Contributed by Stefan O'Rear, 27-Mar-2015.) |
⊢ (+g‘(Poly1‘𝑅)) = (+g‘(Poly1‘( I ‘𝑅))) | ||
Theorem | ply1baspropd 20341* | Property deduction for univariate polynomial base set. (Contributed by Stefan O'Rear, 27-Mar-2015.) |
⊢ (𝜑 → 𝐵 = (Base‘𝑅)) & ⊢ (𝜑 → 𝐵 = (Base‘𝑆)) & ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+g‘𝑅)𝑦) = (𝑥(+g‘𝑆)𝑦)) ⇒ ⊢ (𝜑 → (Base‘(Poly1‘𝑅)) = (Base‘(Poly1‘𝑆))) | ||
Theorem | ply1plusgpropd 20342* | Property deduction for univariate polynomial addition. (Contributed by Stefan O'Rear, 27-Mar-2015.) |
⊢ (𝜑 → 𝐵 = (Base‘𝑅)) & ⊢ (𝜑 → 𝐵 = (Base‘𝑆)) & ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+g‘𝑅)𝑦) = (𝑥(+g‘𝑆)𝑦)) ⇒ ⊢ (𝜑 → (+g‘(Poly1‘𝑅)) = (+g‘(Poly1‘𝑆))) | ||
Theorem | opsrring 20343 | Ordered power series form a ring. (Contributed by Stefan O'Rear, 22-Mar-2015.) |
⊢ 𝑂 = ((𝐼 ordPwSer 𝑅)‘𝑇) & ⊢ (𝜑 → 𝐼 ∈ 𝑉) & ⊢ (𝜑 → 𝑅 ∈ Ring) & ⊢ (𝜑 → 𝑇 ⊆ (𝐼 × 𝐼)) ⇒ ⊢ (𝜑 → 𝑂 ∈ Ring) | ||
Theorem | opsrlmod 20344 | Ordered power series form a left module. (Contributed by Stefan O'Rear, 26-Mar-2015.) |
⊢ 𝑂 = ((𝐼 ordPwSer 𝑅)‘𝑇) & ⊢ (𝜑 → 𝐼 ∈ 𝑉) & ⊢ (𝜑 → 𝑅 ∈ Ring) & ⊢ (𝜑 → 𝑇 ⊆ (𝐼 × 𝐼)) ⇒ ⊢ (𝜑 → 𝑂 ∈ LMod) | ||
Theorem | psr1ring 20345 | Univariate power series form a ring. (Contributed by Stefan O'Rear, 22-Mar-2015.) |
⊢ 𝑆 = (PwSer1‘𝑅) ⇒ ⊢ (𝑅 ∈ Ring → 𝑆 ∈ Ring) | ||
Theorem | ply1ring 20346 | Univariate polynomials form a ring. (Contributed by Stefan O'Rear, 22-Mar-2015.) |
⊢ 𝑃 = (Poly1‘𝑅) ⇒ ⊢ (𝑅 ∈ Ring → 𝑃 ∈ Ring) | ||
Theorem | psr1lmod 20347 | Univariate power series form a left module. (Contributed by Stefan O'Rear, 26-Mar-2015.) |
⊢ 𝑃 = (PwSer1‘𝑅) ⇒ ⊢ (𝑅 ∈ Ring → 𝑃 ∈ LMod) | ||
Theorem | psr1sca 20348 | Scalars of a univariate power series ring. (Contributed by Stefan O'Rear, 4-Jul-2015.) |
⊢ 𝑃 = (PwSer1‘𝑅) ⇒ ⊢ (𝑅 ∈ 𝑉 → 𝑅 = (Scalar‘𝑃)) | ||
Theorem | psr1sca2 20349 | Scalars of a univariate power series ring. (Contributed by Stefan O'Rear, 26-Mar-2015.) (Revised by Mario Carneiro, 4-Jul-2015.) |
⊢ 𝑃 = (PwSer1‘𝑅) ⇒ ⊢ ( I ‘𝑅) = (Scalar‘𝑃) | ||
Theorem | ply1lmod 20350 | Univariate polynomials form a left module. (Contributed by Stefan O'Rear, 26-Mar-2015.) |
⊢ 𝑃 = (Poly1‘𝑅) ⇒ ⊢ (𝑅 ∈ Ring → 𝑃 ∈ LMod) | ||
Theorem | ply1sca 20351 | Scalars of a univariate polynomial ring. (Contributed by Stefan O'Rear, 26-Mar-2015.) |
⊢ 𝑃 = (Poly1‘𝑅) ⇒ ⊢ (𝑅 ∈ 𝑉 → 𝑅 = (Scalar‘𝑃)) | ||
Theorem | ply1sca2 20352 | Scalars of a univariate polynomial ring. (Contributed by Stefan O'Rear, 26-Mar-2015.) |
⊢ 𝑃 = (Poly1‘𝑅) ⇒ ⊢ ( I ‘𝑅) = (Scalar‘𝑃) | ||
Theorem | ply1mpl0 20353 | The univariate polynomial ring has the same zero as the corresponding multivariate polynomial ring. (Contributed by Stefan O'Rear, 23-Mar-2015.) (Revised by Mario Carneiro, 3-Oct-2015.) |
⊢ 𝑀 = (1o mPoly 𝑅) & ⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 0 = (0g‘𝑃) ⇒ ⊢ 0 = (0g‘𝑀) | ||
Theorem | ply10s0 20354 | Zero times a univariate polynomial is the zero polynomial (lmod0vs 19598 analog.) (Contributed by AV, 2-Dec-2019.) |
⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 𝐵 = (Base‘𝑃) & ⊢ ∗ = ( ·𝑠 ‘𝑃) & ⊢ 0 = (0g‘𝑅) ⇒ ⊢ ((𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) → ( 0 ∗ 𝑀) = (0g‘𝑃)) | ||
Theorem | ply1mpl1 20355 | The univariate polynomial ring has the same one as the corresponding multivariate polynomial ring. (Contributed by Stefan O'Rear, 23-Mar-2015.) (Revised by Mario Carneiro, 3-Oct-2015.) |
⊢ 𝑀 = (1o mPoly 𝑅) & ⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 1 = (1r‘𝑃) ⇒ ⊢ 1 = (1r‘𝑀) | ||
Theorem | ply1ascl 20356 | The univariate polynomial ring inherits the multivariate ring's scalar function. (Contributed by Stefan O'Rear, 28-Mar-2015.) (Proof shortened by Fan Zheng, 26-Jun-2016.) |
⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 𝐴 = (algSc‘𝑃) ⇒ ⊢ 𝐴 = (algSc‘(1o mPoly 𝑅)) | ||
Theorem | subrg1ascl 20357 | The scalar injection function in a subring algebra is the same up to a restriction to the subring. (Contributed by Mario Carneiro, 4-Jul-2015.) |
⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 𝐴 = (algSc‘𝑃) & ⊢ 𝐻 = (𝑅 ↾s 𝑇) & ⊢ 𝑈 = (Poly1‘𝐻) & ⊢ (𝜑 → 𝑇 ∈ (SubRing‘𝑅)) & ⊢ 𝐶 = (algSc‘𝑈) ⇒ ⊢ (𝜑 → 𝐶 = (𝐴 ↾ 𝑇)) | ||
Theorem | subrg1asclcl 20358 | The scalars in a polynomial algebra are in the subring algebra iff the scalar value is in the subring. (Contributed by Mario Carneiro, 4-Jul-2015.) |
⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 𝐴 = (algSc‘𝑃) & ⊢ 𝐻 = (𝑅 ↾s 𝑇) & ⊢ 𝑈 = (Poly1‘𝐻) & ⊢ (𝜑 → 𝑇 ∈ (SubRing‘𝑅)) & ⊢ 𝐵 = (Base‘𝑈) & ⊢ 𝐾 = (Base‘𝑅) & ⊢ (𝜑 → 𝑋 ∈ 𝐾) ⇒ ⊢ (𝜑 → ((𝐴‘𝑋) ∈ 𝐵 ↔ 𝑋 ∈ 𝑇)) | ||
Theorem | subrgvr1 20359 | The variables in a subring polynomial algebra are the same as the original ring. (Contributed by Mario Carneiro, 5-Jul-2015.) |
⊢ 𝑋 = (var1‘𝑅) & ⊢ (𝜑 → 𝑇 ∈ (SubRing‘𝑅)) & ⊢ 𝐻 = (𝑅 ↾s 𝑇) ⇒ ⊢ (𝜑 → 𝑋 = (var1‘𝐻)) | ||
Theorem | subrgvr1cl 20360 | The variables in a polynomial algebra are contained in every subring algebra. (Contributed by Mario Carneiro, 5-Jul-2015.) |
⊢ 𝑋 = (var1‘𝑅) & ⊢ (𝜑 → 𝑇 ∈ (SubRing‘𝑅)) & ⊢ 𝐻 = (𝑅 ↾s 𝑇) & ⊢ 𝑈 = (Poly1‘𝐻) & ⊢ 𝐵 = (Base‘𝑈) ⇒ ⊢ (𝜑 → 𝑋 ∈ 𝐵) | ||
Theorem | coe1z 20361 | The coefficient vector of 0. (Contributed by Stefan O'Rear, 23-Mar-2015.) |
⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 0 = (0g‘𝑃) & ⊢ 𝑌 = (0g‘𝑅) ⇒ ⊢ (𝑅 ∈ Ring → (coe1‘ 0 ) = (ℕ0 × {𝑌})) | ||
Theorem | coe1add 20362 | The coefficient vector of an addition. (Contributed by Stefan O'Rear, 24-Mar-2015.) |
⊢ 𝑌 = (Poly1‘𝑅) & ⊢ 𝐵 = (Base‘𝑌) & ⊢ ✚ = (+g‘𝑌) & ⊢ + = (+g‘𝑅) ⇒ ⊢ ((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵) → (coe1‘(𝐹 ✚ 𝐺)) = ((coe1‘𝐹) ∘f + (coe1‘𝐺))) | ||
Theorem | coe1addfv 20363 | A particular coefficient of an addition. (Contributed by Stefan O'Rear, 23-Mar-2015.) |
⊢ 𝑌 = (Poly1‘𝑅) & ⊢ 𝐵 = (Base‘𝑌) & ⊢ ✚ = (+g‘𝑌) & ⊢ + = (+g‘𝑅) ⇒ ⊢ (((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵) ∧ 𝑋 ∈ ℕ0) → ((coe1‘(𝐹 ✚ 𝐺))‘𝑋) = (((coe1‘𝐹)‘𝑋) + ((coe1‘𝐺)‘𝑋))) | ||
Theorem | coe1subfv 20364 | A particular coefficient of a subtraction. (Contributed by Stefan O'Rear, 23-Mar-2015.) |
⊢ 𝑌 = (Poly1‘𝑅) & ⊢ 𝐵 = (Base‘𝑌) & ⊢ − = (-g‘𝑌) & ⊢ 𝑁 = (-g‘𝑅) ⇒ ⊢ (((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵) ∧ 𝑋 ∈ ℕ0) → ((coe1‘(𝐹 − 𝐺))‘𝑋) = (((coe1‘𝐹)‘𝑋)𝑁((coe1‘𝐺)‘𝑋))) | ||
Theorem | coe1mul2lem1 20365 | An equivalence for coe1mul2 20367. (Contributed by Stefan O'Rear, 25-Mar-2015.) |
⊢ ((𝐴 ∈ ℕ0 ∧ 𝑋 ∈ (ℕ0 ↑m 1o)) → (𝑋 ∘r ≤ (1o × {𝐴}) ↔ (𝑋‘∅) ∈ (0...𝐴))) | ||
Theorem | coe1mul2lem2 20366* | An equivalence for coe1mul2 20367. (Contributed by Stefan O'Rear, 25-Mar-2015.) |
⊢ 𝐻 = {𝑑 ∈ (ℕ0 ↑m 1o) ∣ 𝑑 ∘r ≤ (1o × {𝑘})} ⇒ ⊢ (𝑘 ∈ ℕ0 → (𝑐 ∈ 𝐻 ↦ (𝑐‘∅)):𝐻–1-1-onto→(0...𝑘)) | ||
Theorem | coe1mul2 20367* | The coefficient vector of multiplication in the univariate power series ring. (Contributed by Stefan O'Rear, 25-Mar-2015.) |
⊢ 𝑆 = (PwSer1‘𝑅) & ⊢ ∙ = (.r‘𝑆) & ⊢ · = (.r‘𝑅) & ⊢ 𝐵 = (Base‘𝑆) ⇒ ⊢ ((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵) → (coe1‘(𝐹 ∙ 𝐺)) = (𝑘 ∈ ℕ0 ↦ (𝑅 Σg (𝑥 ∈ (0...𝑘) ↦ (((coe1‘𝐹)‘𝑥) · ((coe1‘𝐺)‘(𝑘 − 𝑥))))))) | ||
Theorem | coe1mul 20368* | The coefficient vector of multiplication in the univariate polynomial ring. (Contributed by Stefan O'Rear, 25-Mar-2015.) |
⊢ 𝑌 = (Poly1‘𝑅) & ⊢ ∙ = (.r‘𝑌) & ⊢ · = (.r‘𝑅) & ⊢ 𝐵 = (Base‘𝑌) ⇒ ⊢ ((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵) → (coe1‘(𝐹 ∙ 𝐺)) = (𝑘 ∈ ℕ0 ↦ (𝑅 Σg (𝑥 ∈ (0...𝑘) ↦ (((coe1‘𝐹)‘𝑥) · ((coe1‘𝐺)‘(𝑘 − 𝑥))))))) | ||
Theorem | ply1moncl 20369 | Closure of the expression for a univariate primitive monomial. (Contributed by AV, 14-Aug-2019.) |
⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 𝑋 = (var1‘𝑅) & ⊢ 𝑁 = (mulGrp‘𝑃) & ⊢ ↑ = (.g‘𝑁) & ⊢ 𝐵 = (Base‘𝑃) ⇒ ⊢ ((𝑅 ∈ Ring ∧ 𝐷 ∈ ℕ0) → (𝐷 ↑ 𝑋) ∈ 𝐵) | ||
Theorem | ply1tmcl 20370 | Closure of the expression for a univariate polynomial term. (Contributed by Stefan O'Rear, 27-Mar-2015.) (Proof shortened by AV, 25-Nov-2019.) |
⊢ 𝐾 = (Base‘𝑅) & ⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 𝑋 = (var1‘𝑅) & ⊢ · = ( ·𝑠 ‘𝑃) & ⊢ 𝑁 = (mulGrp‘𝑃) & ⊢ ↑ = (.g‘𝑁) & ⊢ 𝐵 = (Base‘𝑃) ⇒ ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∈ 𝐾 ∧ 𝐷 ∈ ℕ0) → (𝐶 · (𝐷 ↑ 𝑋)) ∈ 𝐵) | ||
Theorem | coe1tm 20371* | Coefficient vector of a polynomial term. (Contributed by Stefan O'Rear, 27-Mar-2015.) |
⊢ 0 = (0g‘𝑅) & ⊢ 𝐾 = (Base‘𝑅) & ⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 𝑋 = (var1‘𝑅) & ⊢ · = ( ·𝑠 ‘𝑃) & ⊢ 𝑁 = (mulGrp‘𝑃) & ⊢ ↑ = (.g‘𝑁) ⇒ ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∈ 𝐾 ∧ 𝐷 ∈ ℕ0) → (coe1‘(𝐶 · (𝐷 ↑ 𝑋))) = (𝑥 ∈ ℕ0 ↦ if(𝑥 = 𝐷, 𝐶, 0 ))) | ||
Theorem | coe1tmfv1 20372 | Nonzero coefficient of a polynomial term. (Contributed by Stefan O'Rear, 27-Mar-2015.) |
⊢ 0 = (0g‘𝑅) & ⊢ 𝐾 = (Base‘𝑅) & ⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 𝑋 = (var1‘𝑅) & ⊢ · = ( ·𝑠 ‘𝑃) & ⊢ 𝑁 = (mulGrp‘𝑃) & ⊢ ↑ = (.g‘𝑁) ⇒ ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ∈ 𝐾 ∧ 𝐷 ∈ ℕ0) → ((coe1‘(𝐶 · (𝐷 ↑ 𝑋)))‘𝐷) = 𝐶) | ||
Theorem | coe1tmfv2 20373 | Zero coefficient of a polynomial term. (Contributed by Stefan O'Rear, 27-Mar-2015.) |
⊢ 0 = (0g‘𝑅) & ⊢ 𝐾 = (Base‘𝑅) & ⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 𝑋 = (var1‘𝑅) & ⊢ · = ( ·𝑠 ‘𝑃) & ⊢ 𝑁 = (mulGrp‘𝑃) & ⊢ ↑ = (.g‘𝑁) & ⊢ (𝜑 → 𝑅 ∈ Ring) & ⊢ (𝜑 → 𝐶 ∈ 𝐾) & ⊢ (𝜑 → 𝐷 ∈ ℕ0) & ⊢ (𝜑 → 𝐹 ∈ ℕ0) & ⊢ (𝜑 → 𝐷 ≠ 𝐹) ⇒ ⊢ (𝜑 → ((coe1‘(𝐶 · (𝐷 ↑ 𝑋)))‘𝐹) = 0 ) | ||
Theorem | coe1tmmul2 20374* | Coefficient vector of a polynomial multiplied on the right by a term. (Contributed by Stefan O'Rear, 27-Mar-2015.) |
⊢ 0 = (0g‘𝑅) & ⊢ 𝐾 = (Base‘𝑅) & ⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 𝑋 = (var1‘𝑅) & ⊢ · = ( ·𝑠 ‘𝑃) & ⊢ 𝑁 = (mulGrp‘𝑃) & ⊢ ↑ = (.g‘𝑁) & ⊢ 𝐵 = (Base‘𝑃) & ⊢ ∙ = (.r‘𝑃) & ⊢ × = (.r‘𝑅) & ⊢ (𝜑 → 𝐴 ∈ 𝐵) & ⊢ (𝜑 → 𝑅 ∈ Ring) & ⊢ (𝜑 → 𝐶 ∈ 𝐾) & ⊢ (𝜑 → 𝐷 ∈ ℕ0) ⇒ ⊢ (𝜑 → (coe1‘(𝐴 ∙ (𝐶 · (𝐷 ↑ 𝑋)))) = (𝑥 ∈ ℕ0 ↦ if(𝐷 ≤ 𝑥, (((coe1‘𝐴)‘(𝑥 − 𝐷)) × 𝐶), 0 ))) | ||
Theorem | coe1tmmul 20375* | Coefficient vector of a polynomial multiplied on the left by a term. (Contributed by Stefan O'Rear, 29-Mar-2015.) |
⊢ 0 = (0g‘𝑅) & ⊢ 𝐾 = (Base‘𝑅) & ⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 𝑋 = (var1‘𝑅) & ⊢ · = ( ·𝑠 ‘𝑃) & ⊢ 𝑁 = (mulGrp‘𝑃) & ⊢ ↑ = (.g‘𝑁) & ⊢ 𝐵 = (Base‘𝑃) & ⊢ ∙ = (.r‘𝑃) & ⊢ × = (.r‘𝑅) & ⊢ (𝜑 → 𝐴 ∈ 𝐵) & ⊢ (𝜑 → 𝑅 ∈ Ring) & ⊢ (𝜑 → 𝐶 ∈ 𝐾) & ⊢ (𝜑 → 𝐷 ∈ ℕ0) ⇒ ⊢ (𝜑 → (coe1‘((𝐶 · (𝐷 ↑ 𝑋)) ∙ 𝐴)) = (𝑥 ∈ ℕ0 ↦ if(𝐷 ≤ 𝑥, (𝐶 × ((coe1‘𝐴)‘(𝑥 − 𝐷))), 0 ))) | ||
Theorem | coe1tmmul2fv 20376 | Function value of a right-multiplication by a term in the shifted domain. (Contributed by Stefan O'Rear, 27-Mar-2015.) |
⊢ 0 = (0g‘𝑅) & ⊢ 𝐾 = (Base‘𝑅) & ⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 𝑋 = (var1‘𝑅) & ⊢ · = ( ·𝑠 ‘𝑃) & ⊢ 𝑁 = (mulGrp‘𝑃) & ⊢ ↑ = (.g‘𝑁) & ⊢ 𝐵 = (Base‘𝑃) & ⊢ ∙ = (.r‘𝑃) & ⊢ × = (.r‘𝑅) & ⊢ (𝜑 → 𝐴 ∈ 𝐵) & ⊢ (𝜑 → 𝑅 ∈ Ring) & ⊢ (𝜑 → 𝐶 ∈ 𝐾) & ⊢ (𝜑 → 𝐷 ∈ ℕ0) & ⊢ (𝜑 → 𝑌 ∈ ℕ0) ⇒ ⊢ (𝜑 → ((coe1‘(𝐴 ∙ (𝐶 · (𝐷 ↑ 𝑋))))‘(𝐷 + 𝑌)) = (((coe1‘𝐴)‘𝑌) × 𝐶)) | ||
Theorem | coe1pwmul 20377* | Coefficient vector of a polynomial multiplied on the left by a variable power. (Contributed by Stefan O'Rear, 1-Apr-2015.) |
⊢ 0 = (0g‘𝑅) & ⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 𝑋 = (var1‘𝑅) & ⊢ 𝑁 = (mulGrp‘𝑃) & ⊢ ↑ = (.g‘𝑁) & ⊢ 𝐵 = (Base‘𝑃) & ⊢ · = (.r‘𝑃) & ⊢ (𝜑 → 𝑅 ∈ Ring) & ⊢ (𝜑 → 𝐴 ∈ 𝐵) & ⊢ (𝜑 → 𝐷 ∈ ℕ0) ⇒ ⊢ (𝜑 → (coe1‘((𝐷 ↑ 𝑋) · 𝐴)) = (𝑥 ∈ ℕ0 ↦ if(𝐷 ≤ 𝑥, ((coe1‘𝐴)‘(𝑥 − 𝐷)), 0 ))) | ||
Theorem | coe1pwmulfv 20378 | Function value of a right-multiplication by a variable power in the shifted domain. (Contributed by Stefan O'Rear, 1-Apr-2015.) |
⊢ 0 = (0g‘𝑅) & ⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 𝑋 = (var1‘𝑅) & ⊢ 𝑁 = (mulGrp‘𝑃) & ⊢ ↑ = (.g‘𝑁) & ⊢ 𝐵 = (Base‘𝑃) & ⊢ · = (.r‘𝑃) & ⊢ (𝜑 → 𝑅 ∈ Ring) & ⊢ (𝜑 → 𝐴 ∈ 𝐵) & ⊢ (𝜑 → 𝐷 ∈ ℕ0) & ⊢ (𝜑 → 𝑌 ∈ ℕ0) ⇒ ⊢ (𝜑 → ((coe1‘((𝐷 ↑ 𝑋) · 𝐴))‘(𝐷 + 𝑌)) = ((coe1‘𝐴)‘𝑌)) | ||
Theorem | ply1scltm 20379 | A scalar is a term with zero exponent. (Contributed by Stefan O'Rear, 29-Mar-2015.) |
⊢ 𝐾 = (Base‘𝑅) & ⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 𝑋 = (var1‘𝑅) & ⊢ · = ( ·𝑠 ‘𝑃) & ⊢ 𝑁 = (mulGrp‘𝑃) & ⊢ ↑ = (.g‘𝑁) & ⊢ 𝐴 = (algSc‘𝑃) ⇒ ⊢ ((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐾) → (𝐴‘𝐹) = (𝐹 · (0 ↑ 𝑋))) | ||
Theorem | coe1sclmul 20380 | Coefficient vector of a polynomial multiplied on the left by a scalar. (Contributed by Stefan O'Rear, 29-Mar-2015.) |
⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 𝐵 = (Base‘𝑃) & ⊢ 𝐾 = (Base‘𝑅) & ⊢ 𝐴 = (algSc‘𝑃) & ⊢ ∙ = (.r‘𝑃) & ⊢ · = (.r‘𝑅) ⇒ ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐾 ∧ 𝑌 ∈ 𝐵) → (coe1‘((𝐴‘𝑋) ∙ 𝑌)) = ((ℕ0 × {𝑋}) ∘f · (coe1‘𝑌))) | ||
Theorem | coe1sclmulfv 20381 | A single coefficient of a polynomial multiplied on the left by a scalar. (Contributed by Stefan O'Rear, 1-Apr-2015.) |
⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 𝐵 = (Base‘𝑃) & ⊢ 𝐾 = (Base‘𝑅) & ⊢ 𝐴 = (algSc‘𝑃) & ⊢ ∙ = (.r‘𝑃) & ⊢ · = (.r‘𝑅) ⇒ ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐾 ∧ 𝑌 ∈ 𝐵) ∧ 0 ∈ ℕ0) → ((coe1‘((𝐴‘𝑋) ∙ 𝑌))‘ 0 ) = (𝑋 · ((coe1‘𝑌)‘ 0 ))) | ||
Theorem | coe1sclmul2 20382 | Coefficient vector of a polynomial multiplied on the right by a scalar. (Contributed by Stefan O'Rear, 29-Mar-2015.) |
⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 𝐵 = (Base‘𝑃) & ⊢ 𝐾 = (Base‘𝑅) & ⊢ 𝐴 = (algSc‘𝑃) & ⊢ ∙ = (.r‘𝑃) & ⊢ · = (.r‘𝑅) ⇒ ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐾 ∧ 𝑌 ∈ 𝐵) → (coe1‘(𝑌 ∙ (𝐴‘𝑋))) = ((coe1‘𝑌) ∘f · (ℕ0 × {𝑋}))) | ||
Theorem | ply1sclf 20383 | A scalar polynomial is a polynomial. (Contributed by Stefan O'Rear, 28-Mar-2015.) |
⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 𝐴 = (algSc‘𝑃) & ⊢ 𝐾 = (Base‘𝑅) & ⊢ 𝐵 = (Base‘𝑃) ⇒ ⊢ (𝑅 ∈ Ring → 𝐴:𝐾⟶𝐵) | ||
Theorem | ply1sclcl 20384 | The value of the algebra scalars function for (univariate) polynomials applied to a scalar results in a constant polynomial. (Contributed by AV, 27-Nov-2019.) |
⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 𝐴 = (algSc‘𝑃) & ⊢ 𝐾 = (Base‘𝑅) & ⊢ 𝐵 = (Base‘𝑃) ⇒ ⊢ ((𝑅 ∈ Ring ∧ 𝑆 ∈ 𝐾) → (𝐴‘𝑆) ∈ 𝐵) | ||
Theorem | coe1scl 20385* | Coefficient vector of a scalar. (Contributed by Stefan O'Rear, 28-Mar-2015.) |
⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 𝐴 = (algSc‘𝑃) & ⊢ 𝐾 = (Base‘𝑅) & ⊢ 0 = (0g‘𝑅) ⇒ ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐾) → (coe1‘(𝐴‘𝑋)) = (𝑥 ∈ ℕ0 ↦ if(𝑥 = 0, 𝑋, 0 ))) | ||
Theorem | ply1sclid 20386 | Recover the base scalar from a scalar polynomial. (Contributed by Stefan O'Rear, 28-Mar-2015.) |
⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 𝐴 = (algSc‘𝑃) & ⊢ 𝐾 = (Base‘𝑅) ⇒ ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐾) → 𝑋 = ((coe1‘(𝐴‘𝑋))‘0)) | ||
Theorem | ply1sclf1 20387 | The polynomial scalar function is injective. (Contributed by Stefan O'Rear, 28-Mar-2015.) |
⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 𝐴 = (algSc‘𝑃) & ⊢ 𝐾 = (Base‘𝑅) & ⊢ 𝐵 = (Base‘𝑃) ⇒ ⊢ (𝑅 ∈ Ring → 𝐴:𝐾–1-1→𝐵) | ||
Theorem | ply1scl0 20388 | The zero scalar is zero. (Contributed by Stefan O'Rear, 29-Mar-2015.) |
⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 𝐴 = (algSc‘𝑃) & ⊢ 0 = (0g‘𝑅) & ⊢ 𝑌 = (0g‘𝑃) ⇒ ⊢ (𝑅 ∈ Ring → (𝐴‘ 0 ) = 𝑌) | ||
Theorem | ply1scln0 20389 | Nonzero scalars create nonzero polynomials. (Contributed by Stefan O'Rear, 29-Mar-2015.) |
⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 𝐴 = (algSc‘𝑃) & ⊢ 0 = (0g‘𝑅) & ⊢ 𝑌 = (0g‘𝑃) & ⊢ 𝐾 = (Base‘𝑅) ⇒ ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐾 ∧ 𝑋 ≠ 0 ) → (𝐴‘𝑋) ≠ 𝑌) | ||
Theorem | ply1scl1 20390 | The one scalar is the unit polynomial. (Contributed by Stefan O'Rear, 1-Apr-2015.) |
⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 𝐴 = (algSc‘𝑃) & ⊢ 1 = (1r‘𝑅) & ⊢ 𝑁 = (1r‘𝑃) ⇒ ⊢ (𝑅 ∈ Ring → (𝐴‘ 1 ) = 𝑁) | ||
Theorem | ply1idvr1 20391 | The identity of a polynomial ring expressed as power of the polynomial variable. (Contributed by AV, 14-Aug-2019.) |
⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 𝑋 = (var1‘𝑅) & ⊢ 𝑁 = (mulGrp‘𝑃) & ⊢ ↑ = (.g‘𝑁) ⇒ ⊢ (𝑅 ∈ Ring → (0 ↑ 𝑋) = (1r‘𝑃)) | ||
Theorem | cply1mul 20392* | The product of two constant polynomials is a constant polynomial. (Contributed by AV, 18-Nov-2019.) |
⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 𝐵 = (Base‘𝑃) & ⊢ 0 = (0g‘𝑅) & ⊢ × = (.r‘𝑃) ⇒ ⊢ ((𝑅 ∈ Ring ∧ (𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵)) → (∀𝑐 ∈ ℕ (((coe1‘𝐹)‘𝑐) = 0 ∧ ((coe1‘𝐺)‘𝑐) = 0 ) → ∀𝑐 ∈ ℕ ((coe1‘(𝐹 × 𝐺))‘𝑐) = 0 )) | ||
Theorem | ply1coefsupp 20393* | The decomposition of a univariate polynomial is finitely supported. Formerly part of proof for ply1coe 20394. (Contributed by Stefan O'Rear, 21-Mar-2015.) (Revised by AV, 8-Aug-2019.) |
⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 𝑋 = (var1‘𝑅) & ⊢ 𝐵 = (Base‘𝑃) & ⊢ · = ( ·𝑠 ‘𝑃) & ⊢ 𝑀 = (mulGrp‘𝑃) & ⊢ ↑ = (.g‘𝑀) & ⊢ 𝐴 = (coe1‘𝐾) ⇒ ⊢ ((𝑅 ∈ Ring ∧ 𝐾 ∈ 𝐵) → (𝑘 ∈ ℕ0 ↦ ((𝐴‘𝑘) · (𝑘 ↑ 𝑋))) finSupp (0g‘𝑃)) | ||
Theorem | ply1coe 20394* | Decompose a univariate polynomial as a sum of powers. (Contributed by Stefan O'Rear, 21-Mar-2015.) (Revised by AV, 7-Oct-2019.) |
⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 𝑋 = (var1‘𝑅) & ⊢ 𝐵 = (Base‘𝑃) & ⊢ · = ( ·𝑠 ‘𝑃) & ⊢ 𝑀 = (mulGrp‘𝑃) & ⊢ ↑ = (.g‘𝑀) & ⊢ 𝐴 = (coe1‘𝐾) ⇒ ⊢ ((𝑅 ∈ Ring ∧ 𝐾 ∈ 𝐵) → 𝐾 = (𝑃 Σg (𝑘 ∈ ℕ0 ↦ ((𝐴‘𝑘) · (𝑘 ↑ 𝑋))))) | ||
Theorem | eqcoe1ply1eq 20395* | Two polynomials over the same ring are equal if they have identical coefficients. (Contributed by AV, 7-Oct-2019.) |
⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 𝐵 = (Base‘𝑃) & ⊢ 𝐴 = (coe1‘𝐾) & ⊢ 𝐶 = (coe1‘𝐿) ⇒ ⊢ ((𝑅 ∈ Ring ∧ 𝐾 ∈ 𝐵 ∧ 𝐿 ∈ 𝐵) → (∀𝑘 ∈ ℕ0 (𝐴‘𝑘) = (𝐶‘𝑘) → 𝐾 = 𝐿)) | ||
Theorem | ply1coe1eq 20396* | Two polynomials over the same ring are equal iff they have identical coefficients. (Contributed by AV, 13-Oct-2019.) |
⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 𝐵 = (Base‘𝑃) & ⊢ 𝐴 = (coe1‘𝐾) & ⊢ 𝐶 = (coe1‘𝐿) ⇒ ⊢ ((𝑅 ∈ Ring ∧ 𝐾 ∈ 𝐵 ∧ 𝐿 ∈ 𝐵) → (∀𝑘 ∈ ℕ0 (𝐴‘𝑘) = (𝐶‘𝑘) ↔ 𝐾 = 𝐿)) | ||
Theorem | cply1coe0 20397* | All but the first coefficient of a constant polynomial ( i.e. a "lifted scalar") are zero. (Contributed by AV, 16-Nov-2019.) |
⊢ 𝐾 = (Base‘𝑅) & ⊢ 0 = (0g‘𝑅) & ⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 𝐵 = (Base‘𝑃) & ⊢ 𝐴 = (algSc‘𝑃) ⇒ ⊢ ((𝑅 ∈ Ring ∧ 𝑆 ∈ 𝐾) → ∀𝑛 ∈ ℕ ((coe1‘(𝐴‘𝑆))‘𝑛) = 0 ) | ||
Theorem | cply1coe0bi 20398* | A polynomial is constant (i.e. a "lifted scalar") iff all but the first coefficient are zero. (Contributed by AV, 16-Nov-2019.) |
⊢ 𝐾 = (Base‘𝑅) & ⊢ 0 = (0g‘𝑅) & ⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 𝐵 = (Base‘𝑃) & ⊢ 𝐴 = (algSc‘𝑃) ⇒ ⊢ ((𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) → (∃𝑠 ∈ 𝐾 𝑀 = (𝐴‘𝑠) ↔ ∀𝑛 ∈ ℕ ((coe1‘𝑀)‘𝑛) = 0 )) | ||
Theorem | coe1fzgsumdlem 20399* | Lemma for coe1fzgsumd 20400 (induction step). (Contributed by AV, 8-Oct-2019.) |
⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 𝐵 = (Base‘𝑃) & ⊢ (𝜑 → 𝑅 ∈ Ring) & ⊢ (𝜑 → 𝐾 ∈ ℕ0) ⇒ ⊢ ((𝑚 ∈ Fin ∧ ¬ 𝑎 ∈ 𝑚 ∧ 𝜑) → ((∀𝑥 ∈ 𝑚 𝑀 ∈ 𝐵 → ((coe1‘(𝑃 Σg (𝑥 ∈ 𝑚 ↦ 𝑀)))‘𝐾) = (𝑅 Σg (𝑥 ∈ 𝑚 ↦ ((coe1‘𝑀)‘𝐾)))) → (∀𝑥 ∈ (𝑚 ∪ {𝑎})𝑀 ∈ 𝐵 → ((coe1‘(𝑃 Σg (𝑥 ∈ (𝑚 ∪ {𝑎}) ↦ 𝑀)))‘𝐾) = (𝑅 Σg (𝑥 ∈ (𝑚 ∪ {𝑎}) ↦ ((coe1‘𝑀)‘𝐾)))))) | ||
Theorem | coe1fzgsumd 20400* | Value of an evaluated coefficient in a finite group sum of polynomials. (Contributed by AV, 8-Oct-2019.) |
⊢ 𝑃 = (Poly1‘𝑅) & ⊢ 𝐵 = (Base‘𝑃) & ⊢ (𝜑 → 𝑅 ∈ Ring) & ⊢ (𝜑 → 𝐾 ∈ ℕ0) & ⊢ (𝜑 → ∀𝑥 ∈ 𝑁 𝑀 ∈ 𝐵) & ⊢ (𝜑 → 𝑁 ∈ Fin) ⇒ ⊢ (𝜑 → ((coe1‘(𝑃 Σg (𝑥 ∈ 𝑁 ↦ 𝑀)))‘𝐾) = (𝑅 Σg (𝑥 ∈ 𝑁 ↦ ((coe1‘𝑀)‘𝐾)))) |
< Previous Next > |
Copyright terms: Public domain | < Previous Next > |