HomeHome Metamath Proof Explorer
Theorem List (p. 205 of 425)
< 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  Metamath Proof Explorer
(1-26947)
  Hilbert Space Explorer  Hilbert Space Explorer
(26948-28472)
  Users' Mathboxes  Users' Mathboxes
(28473-42426)
 

Theorem List for Metamath Proof Explorer - 20401-20500   *Has distinct variable group(s)
TypeLabelDescription
Statement
 
TheoremcpmadugsumlemB 20401* Lemma B for cpmadugsum 20405. (Contributed by AV, 2-Nov-2019.)
𝐴 = (𝑁 Mat 𝑅)    &   𝐵 = (Base‘𝐴)    &   𝑃 = (Poly1𝑅)    &   𝑌 = (𝑁 Mat 𝑃)    &   𝑇 = (𝑁 matToPolyMat 𝑅)    &   𝑋 = (var1𝑅)    &    = (.g‘(mulGrp‘𝑃))    &    · = ( ·𝑠𝑌)    &    × = (.r𝑌)    &    1 = (1r𝑌)       (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) ∧ (𝑠 ∈ ℕ0𝑏 ∈ (𝐵𝑚 (0...𝑠)))) → ((𝑋 · 1 ) × (𝑌 Σg (𝑖 ∈ (0...𝑠) ↦ ((𝑖 𝑋) · (𝑇‘(𝑏𝑖)))))) = (𝑌 Σg (𝑖 ∈ (0...𝑠) ↦ (((𝑖 + 1) 𝑋) · (𝑇‘(𝑏𝑖))))))
 
TheoremcpmadugsumlemC 20402* Lemma C for cpmadugsum 20405. (Contributed by AV, 2-Nov-2019.)
𝐴 = (𝑁 Mat 𝑅)    &   𝐵 = (Base‘𝐴)    &   𝑃 = (Poly1𝑅)    &   𝑌 = (𝑁 Mat 𝑃)    &   𝑇 = (𝑁 matToPolyMat 𝑅)    &   𝑋 = (var1𝑅)    &    = (.g‘(mulGrp‘𝑃))    &    · = ( ·𝑠𝑌)    &    × = (.r𝑌)    &    1 = (1r𝑌)       (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) ∧ (𝑠 ∈ ℕ0𝑏 ∈ (𝐵𝑚 (0...𝑠)))) → ((𝑇𝑀) × (𝑌 Σg (𝑖 ∈ (0...𝑠) ↦ ((𝑖 𝑋) · (𝑇‘(𝑏𝑖)))))) = (𝑌 Σg (𝑖 ∈ (0...𝑠) ↦ ((𝑖 𝑋) · ((𝑇𝑀) × (𝑇‘(𝑏𝑖)))))))
 
TheoremcpmadugsumlemF 20403* Lemma F for cpmadugsum 20405. (Contributed by AV, 7-Nov-2019.)
𝐴 = (𝑁 Mat 𝑅)    &   𝐵 = (Base‘𝐴)    &   𝑃 = (Poly1𝑅)    &   𝑌 = (𝑁 Mat 𝑃)    &   𝑇 = (𝑁 matToPolyMat 𝑅)    &   𝑋 = (var1𝑅)    &    = (.g‘(mulGrp‘𝑃))    &    · = ( ·𝑠𝑌)    &    × = (.r𝑌)    &    1 = (1r𝑌)    &    + = (+g𝑌)    &    = (-g𝑌)       (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵𝑚 (0...𝑠)))) → (((𝑋 · 1 ) × (𝑌 Σg (𝑖 ∈ (0...𝑠) ↦ ((𝑖 𝑋) · (𝑇‘(𝑏𝑖)))))) ((𝑇𝑀) × (𝑌 Σg (𝑖 ∈ (0...𝑠) ↦ ((𝑖 𝑋) · (𝑇‘(𝑏𝑖))))))) = ((𝑌 Σg (𝑖 ∈ (1...𝑠) ↦ ((𝑖 𝑋) · ((𝑇‘(𝑏‘(𝑖 − 1))) ((𝑇𝑀) × (𝑇‘(𝑏𝑖))))))) + ((((𝑠 + 1) 𝑋) · (𝑇‘(𝑏𝑠))) ((𝑇𝑀) × (𝑇‘(𝑏‘0))))))
 
Theoremcpmadugsumfi 20404* The product of the characteristic matrix of a given matrix and its adjunct represented as finite sum. (Contributed by AV, 7-Nov-2019.) (Proof shortened by AV, 29-Nov-2019.)
𝐴 = (𝑁 Mat 𝑅)    &   𝐵 = (Base‘𝐴)    &   𝑃 = (Poly1𝑅)    &   𝑌 = (𝑁 Mat 𝑃)    &   𝑇 = (𝑁 matToPolyMat 𝑅)    &   𝑋 = (var1𝑅)    &    = (.g‘(mulGrp‘𝑃))    &    · = ( ·𝑠𝑌)    &    × = (.r𝑌)    &    1 = (1r𝑌)    &    + = (+g𝑌)    &    = (-g𝑌)    &   𝐼 = ((𝑋 · 1 ) (𝑇𝑀))    &   𝐽 = (𝑁 maAdju 𝑃)       ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) → ∃𝑠 ∈ ℕ ∃𝑏 ∈ (𝐵𝑚 (0...𝑠))(𝐼 × (𝐽𝐼)) = ((𝑌 Σg (𝑖 ∈ (1...𝑠) ↦ ((𝑖 𝑋) · ((𝑇‘(𝑏‘(𝑖 − 1))) ((𝑇𝑀) × (𝑇‘(𝑏𝑖))))))) + ((((𝑠 + 1) 𝑋) · (𝑇‘(𝑏𝑠))) ((𝑇𝑀) × (𝑇‘(𝑏‘0))))))
 
Theoremcpmadugsum 20405* The product of the characteristic matrix of a given matrix and its adjunct represented as an infinite sum. (Contributed by AV, 10-Nov-2019.)
𝐴 = (𝑁 Mat 𝑅)    &   𝐵 = (Base‘𝐴)    &   𝑃 = (Poly1𝑅)    &   𝑌 = (𝑁 Mat 𝑃)    &   𝑇 = (𝑁 matToPolyMat 𝑅)    &   𝑋 = (var1𝑅)    &    = (.g‘(mulGrp‘𝑃))    &    · = ( ·𝑠𝑌)    &    × = (.r𝑌)    &    1 = (1r𝑌)    &    + = (+g𝑌)    &    = (-g𝑌)    &   𝐼 = ((𝑋 · 1 ) (𝑇𝑀))    &   𝐽 = (𝑁 maAdju 𝑃)    &    0 = (0g𝑌)    &   𝐺 = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( 0 ((𝑇𝑀) × (𝑇‘(𝑏‘0)))), if(𝑛 = (𝑠 + 1), (𝑇‘(𝑏𝑠)), if((𝑠 + 1) < 𝑛, 0 , ((𝑇‘(𝑏‘(𝑛 − 1))) ((𝑇𝑀) × (𝑇‘(𝑏𝑛))))))))       ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) → ∃𝑠 ∈ ℕ ∃𝑏 ∈ (𝐵𝑚 (0...𝑠))(𝐼 × (𝐽𝐼)) = (𝑌 Σg (𝑖 ∈ ℕ0 ↦ ((𝑖 𝑋) · (𝐺𝑖)))))
 
Theoremcpmidgsum2 20406* Representation of the identity matrix multiplied with the characteristic polynomial of a matrix as another group sum. (Contributed by AV, 10-Nov-2019.)
𝐴 = (𝑁 Mat 𝑅)    &   𝐵 = (Base‘𝐴)    &   𝑃 = (Poly1𝑅)    &   𝑌 = (𝑁 Mat 𝑃)    &   𝑇 = (𝑁 matToPolyMat 𝑅)    &   𝑋 = (var1𝑅)    &    = (.g‘(mulGrp‘𝑃))    &    · = ( ·𝑠𝑌)    &    × = (.r𝑌)    &    1 = (1r𝑌)    &    + = (+g𝑌)    &    = (-g𝑌)    &   𝐼 = ((𝑋 · 1 ) (𝑇𝑀))    &   𝐽 = (𝑁 maAdju 𝑃)    &    0 = (0g𝑌)    &   𝐺 = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( 0 ((𝑇𝑀) × (𝑇‘(𝑏‘0)))), if(𝑛 = (𝑠 + 1), (𝑇‘(𝑏𝑠)), if((𝑠 + 1) < 𝑛, 0 , ((𝑇‘(𝑏‘(𝑛 − 1))) ((𝑇𝑀) × (𝑇‘(𝑏𝑛))))))))    &   𝐶 = (𝑁 CharPlyMat 𝑅)    &   𝐾 = (𝐶𝑀)    &   𝐻 = (𝐾 · 1 )       ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) → ∃𝑠 ∈ ℕ ∃𝑏 ∈ (𝐵𝑚 (0...𝑠))𝐻 = (𝑌 Σg (𝑖 ∈ ℕ0 ↦ ((𝑖 𝑋) · (𝐺𝑖)))))
 
Theoremcpmidg2sum 20407* Equality of two sums representing the identity matrix multiplied with the characteristic polynomial of a matrix. (Contributed by AV, 11-Nov-2019.)
𝐴 = (𝑁 Mat 𝑅)    &   𝐵 = (Base‘𝐴)    &   𝑃 = (Poly1𝑅)    &   𝑌 = (𝑁 Mat 𝑃)    &   𝑇 = (𝑁 matToPolyMat 𝑅)    &   𝑋 = (var1𝑅)    &    = (.g‘(mulGrp‘𝑃))    &    · = ( ·𝑠𝑌)    &    × = (.r𝑌)    &    1 = (1r𝑌)    &    + = (+g𝑌)    &    = (-g𝑌)    &   𝐼 = ((𝑋 · 1 ) (𝑇𝑀))    &   𝐽 = (𝑁 maAdju 𝑃)    &    0 = (0g𝑌)    &   𝐺 = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( 0 ((𝑇𝑀) × (𝑇‘(𝑏‘0)))), if(𝑛 = (𝑠 + 1), (𝑇‘(𝑏𝑠)), if((𝑠 + 1) < 𝑛, 0 , ((𝑇‘(𝑏‘(𝑛 − 1))) ((𝑇𝑀) × (𝑇‘(𝑏𝑛))))))))    &   𝐶 = (𝑁 CharPlyMat 𝑅)    &   𝐾 = (𝐶𝑀)    &   𝑈 = (algSc‘𝑃)       ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) → ∃𝑠 ∈ ℕ ∃𝑏 ∈ (𝐵𝑚 (0...𝑠))(𝑌 Σg (𝑖 ∈ ℕ0 ↦ ((𝑖 𝑋) · ((𝑈‘((coe1𝐾)‘𝑖)) · 1 )))) = (𝑌 Σg (𝑖 ∈ ℕ0 ↦ ((𝑖 𝑋) · (𝐺𝑖)))))
 
Theoremcpmadumatpolylem1 20408* Lemma 1 for cpmadumatpoly 20410. (Contributed by AV, 20-Nov-2019.) (Revised by AV, 15-Dec-2019.)
𝐴 = (𝑁 Mat 𝑅)    &   𝐵 = (Base‘𝐴)    &   𝑃 = (Poly1𝑅)    &   𝑌 = (𝑁 Mat 𝑃)    &   𝑇 = (𝑁 matToPolyMat 𝑅)    &    × = (.r𝑌)    &    = (-g𝑌)    &    0 = (0g𝑌)    &   𝐺 = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( 0 ((𝑇𝑀) × (𝑇‘(𝑏‘0)))), if(𝑛 = (𝑠 + 1), (𝑇‘(𝑏𝑠)), if((𝑠 + 1) < 𝑛, 0 , ((𝑇‘(𝑏‘(𝑛 − 1))) ((𝑇𝑀) × (𝑇‘(𝑏𝑛))))))))    &   𝑆 = (𝑁 ConstPolyMat 𝑅)    &    · = ( ·𝑠𝑌)    &    1 = (1r𝑌)    &   𝑍 = (var1𝑅)    &   𝐷 = ((𝑍 · 1 ) (𝑇𝑀))    &   𝐽 = (𝑁 maAdju 𝑃)    &   𝑊 = (Base‘𝑌)    &   𝑄 = (Poly1𝐴)    &   𝑋 = (var1𝐴)    &    = ( ·𝑠𝑄)    &    = (.g‘(mulGrp‘𝑄))    &   𝑈 = (𝑁 cPolyMatToMat 𝑅)       ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) ∧ 𝑠 ∈ ℕ) ∧ 𝑏 ∈ (𝐵𝑚 (0...𝑠))) → (𝑈𝐺) ∈ (𝐵𝑚0))
 
Theoremcpmadumatpolylem2 20409* Lemma 2 for cpmadumatpoly 20410. (Contributed by AV, 20-Nov-2019.) (Revised by AV, 15-Dec-2019.)
𝐴 = (𝑁 Mat 𝑅)    &   𝐵 = (Base‘𝐴)    &   𝑃 = (Poly1𝑅)    &   𝑌 = (𝑁 Mat 𝑃)    &   𝑇 = (𝑁 matToPolyMat 𝑅)    &    × = (.r𝑌)    &    = (-g𝑌)    &    0 = (0g𝑌)    &   𝐺 = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( 0 ((𝑇𝑀) × (𝑇‘(𝑏‘0)))), if(𝑛 = (𝑠 + 1), (𝑇‘(𝑏𝑠)), if((𝑠 + 1) < 𝑛, 0 , ((𝑇‘(𝑏‘(𝑛 − 1))) ((𝑇𝑀) × (𝑇‘(𝑏𝑛))))))))    &   𝑆 = (𝑁 ConstPolyMat 𝑅)    &    · = ( ·𝑠𝑌)    &    1 = (1r𝑌)    &   𝑍 = (var1𝑅)    &   𝐷 = ((𝑍 · 1 ) (𝑇𝑀))    &   𝐽 = (𝑁 maAdju 𝑃)    &   𝑊 = (Base‘𝑌)    &   𝑄 = (Poly1𝐴)    &   𝑋 = (var1𝐴)    &    = ( ·𝑠𝑄)    &    = (.g‘(mulGrp‘𝑄))    &   𝑈 = (𝑁 cPolyMatToMat 𝑅)       ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) ∧ 𝑠 ∈ ℕ) ∧ 𝑏 ∈ (𝐵𝑚 (0...𝑠))) → (𝑈𝐺) finSupp (0g𝐴))
 
Theoremcpmadumatpoly 20410* The product of the characteristic matrix of a given matrix and its adjunct represented as a polynomial over matrices. (Contributed by AV, 20-Nov-2019.) (Revised by AV, 7-Dec-2019.)
𝐴 = (𝑁 Mat 𝑅)    &   𝐵 = (Base‘𝐴)    &   𝑃 = (Poly1𝑅)    &   𝑌 = (𝑁 Mat 𝑃)    &   𝑇 = (𝑁 matToPolyMat 𝑅)    &    × = (.r𝑌)    &    = (-g𝑌)    &    0 = (0g𝑌)    &   𝐺 = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( 0 ((𝑇𝑀) × (𝑇‘(𝑏‘0)))), if(𝑛 = (𝑠 + 1), (𝑇‘(𝑏𝑠)), if((𝑠 + 1) < 𝑛, 0 , ((𝑇‘(𝑏‘(𝑛 − 1))) ((𝑇𝑀) × (𝑇‘(𝑏𝑛))))))))    &   𝑆 = (𝑁 ConstPolyMat 𝑅)    &    · = ( ·𝑠𝑌)    &    1 = (1r𝑌)    &   𝑍 = (var1𝑅)    &   𝐷 = ((𝑍 · 1 ) (𝑇𝑀))    &   𝐽 = (𝑁 maAdju 𝑃)    &   𝑊 = (Base‘𝑌)    &   𝑄 = (Poly1𝐴)    &   𝑋 = (var1𝐴)    &    = ( ·𝑠𝑄)    &    = (.g‘(mulGrp‘𝑄))    &   𝑈 = (𝑁 cPolyMatToMat 𝑅)    &   𝐼 = (𝑁 pMatToMatPoly 𝑅)       ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) → ∃𝑠 ∈ ℕ ∃𝑏 ∈ (𝐵𝑚 (0...𝑠))(𝐼‘(𝐷 × (𝐽𝐷))) = (𝑄 Σg (𝑛 ∈ ℕ0 ↦ ((𝑈‘(𝐺𝑛)) (𝑛 𝑋)))))
 
Theoremcayhamlem2 20411 Lemma for cayhamlem3 20414. (Contributed by AV, 24-Nov-2019.)
𝐾 = (Base‘𝑅)    &   𝐴 = (𝑁 Mat 𝑅)    &   𝐵 = (Base‘𝐴)    &    1 = (1r𝐴)    &    = ( ·𝑠𝐴)    &    = (.g‘(mulGrp‘𝐴))    &    · = (.r𝐴)       (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) ∧ (𝐻 ∈ (𝐾𝑚0) ∧ 𝐿 ∈ ℕ0)) → ((𝐻𝐿) (𝐿 𝑀)) = ((𝐿 𝑀) · ((𝐻𝐿) 1 )))
 
Theoremchcoeffeqlem 20412* Lemma for chcoeffeq 20413. (Contributed by AV, 21-Nov-2019.) (Proof shortened by AV, 7-Dec-2019.) (Revised by AV, 15-Dec-2019.)
𝐴 = (𝑁 Mat 𝑅)    &   𝐵 = (Base‘𝐴)    &   𝑃 = (Poly1𝑅)    &   𝑌 = (𝑁 Mat 𝑃)    &    × = (.r𝑌)    &    = (-g𝑌)    &    0 = (0g𝑌)    &   𝑇 = (𝑁 matToPolyMat 𝑅)    &   𝐶 = (𝑁 CharPlyMat 𝑅)    &   𝐾 = (𝐶𝑀)    &   𝐺 = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( 0 ((𝑇𝑀) × (𝑇‘(𝑏‘0)))), if(𝑛 = (𝑠 + 1), (𝑇‘(𝑏𝑠)), if((𝑠 + 1) < 𝑛, 0 , ((𝑇‘(𝑏‘(𝑛 − 1))) ((𝑇𝑀) × (𝑇‘(𝑏𝑛))))))))    &   𝑊 = (Base‘𝑌)    &    1 = (1r𝐴)    &    = ( ·𝑠𝐴)    &   𝑈 = (𝑁 cPolyMatToMat 𝑅)       (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵𝑚 (0...𝑠)))) → (((Poly1𝐴) Σg (𝑛 ∈ ℕ0 ↦ ((𝑈‘(𝐺𝑛))( ·𝑠 ‘(Poly1𝐴))(𝑛(.g‘(mulGrp‘(Poly1𝐴)))(var1𝐴))))) = ((Poly1𝐴) Σg (𝑛 ∈ ℕ0 ↦ ((((coe1𝐾)‘𝑛) 1 )( ·𝑠 ‘(Poly1𝐴))(𝑛(.g‘(mulGrp‘(Poly1𝐴)))(var1𝐴))))) → ∀𝑛 ∈ ℕ0 (𝑈‘(𝐺𝑛)) = (((coe1𝐾)‘𝑛) 1 )))
 
Theoremchcoeffeq 20413* The coefficients of the characteristic polynomial multiplied with the identity matrix represented by (transformed) ring elements obtained from the adjunct of the characteristic matrix. (Contributed by AV, 21-Nov-2019.) (Proof shortened by AV, 8-Dec-2019.) (Revised by AV, 15-Dec-2019.)
𝐴 = (𝑁 Mat 𝑅)    &   𝐵 = (Base‘𝐴)    &   𝑃 = (Poly1𝑅)    &   𝑌 = (𝑁 Mat 𝑃)    &    × = (.r𝑌)    &    = (-g𝑌)    &    0 = (0g𝑌)    &   𝑇 = (𝑁 matToPolyMat 𝑅)    &   𝐶 = (𝑁 CharPlyMat 𝑅)    &   𝐾 = (𝐶𝑀)    &   𝐺 = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( 0 ((𝑇𝑀) × (𝑇‘(𝑏‘0)))), if(𝑛 = (𝑠 + 1), (𝑇‘(𝑏𝑠)), if((𝑠 + 1) < 𝑛, 0 , ((𝑇‘(𝑏‘(𝑛 − 1))) ((𝑇𝑀) × (𝑇‘(𝑏𝑛))))))))    &   𝑊 = (Base‘𝑌)    &    1 = (1r𝐴)    &    = ( ·𝑠𝐴)    &   𝑈 = (𝑁 cPolyMatToMat 𝑅)       ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) → ∃𝑠 ∈ ℕ ∃𝑏 ∈ (𝐵𝑚 (0...𝑠))∀𝑛 ∈ ℕ0 (𝑈‘(𝐺𝑛)) = (((coe1𝐾)‘𝑛) 1 ))
 
Theoremcayhamlem3 20414* Lemma for cayhamlem4 20415. (Contributed by AV, 24-Nov-2019.) (Revised by AV, 15-Dec-2019.)
𝐴 = (𝑁 Mat 𝑅)    &   𝐵 = (Base‘𝐴)    &   𝑃 = (Poly1𝑅)    &   𝑌 = (𝑁 Mat 𝑃)    &    × = (.r𝑌)    &    = (-g𝑌)    &    0 = (0g𝑌)    &   𝑇 = (𝑁 matToPolyMat 𝑅)    &   𝐶 = (𝑁 CharPlyMat 𝑅)    &   𝐾 = (𝐶𝑀)    &   𝐺 = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( 0 ((𝑇𝑀) × (𝑇‘(𝑏‘0)))), if(𝑛 = (𝑠 + 1), (𝑇‘(𝑏𝑠)), if((𝑠 + 1) < 𝑛, 0 , ((𝑇‘(𝑏‘(𝑛 − 1))) ((𝑇𝑀) × (𝑇‘(𝑏𝑛))))))))    &   𝑊 = (Base‘𝑌)    &    1 = (1r𝐴)    &    = ( ·𝑠𝐴)    &   𝑈 = (𝑁 cPolyMatToMat 𝑅)    &    = (.g‘(mulGrp‘𝐴))    &    · = (.r𝐴)       ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) → ∃𝑠 ∈ ℕ ∃𝑏 ∈ (𝐵𝑚 (0...𝑠))(𝐴 Σg (𝑛 ∈ ℕ0 ↦ (((coe1𝐾)‘𝑛) (𝑛 𝑀)))) = (𝐴 Σg (𝑛 ∈ ℕ0 ↦ ((𝑛 𝑀) · (𝑈‘(𝐺𝑛))))))
 
Theoremcayhamlem4 20415* Lemma for cayleyhamilton 20417. (Contributed by AV, 25-Nov-2019.) (Revised by AV, 15-Dec-2019.)
𝐴 = (𝑁 Mat 𝑅)    &   𝐵 = (Base‘𝐴)    &   𝑃 = (Poly1𝑅)    &   𝑌 = (𝑁 Mat 𝑃)    &    × = (.r𝑌)    &    = (-g𝑌)    &    0 = (0g𝑌)    &   𝑇 = (𝑁 matToPolyMat 𝑅)    &   𝐶 = (𝑁 CharPlyMat 𝑅)    &   𝐾 = (𝐶𝑀)    &   𝐺 = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( 0 ((𝑇𝑀) × (𝑇‘(𝑏‘0)))), if(𝑛 = (𝑠 + 1), (𝑇‘(𝑏𝑠)), if((𝑠 + 1) < 𝑛, 0 , ((𝑇‘(𝑏‘(𝑛 − 1))) ((𝑇𝑀) × (𝑇‘(𝑏𝑛))))))))    &   𝑊 = (Base‘𝑌)    &    1 = (1r𝐴)    &    = ( ·𝑠𝐴)    &   𝑈 = (𝑁 cPolyMatToMat 𝑅)    &    = (.g‘(mulGrp‘𝐴))    &   𝐸 = (.g‘(mulGrp‘𝑌))       ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) → ∃𝑠 ∈ ℕ ∃𝑏 ∈ (𝐵𝑚 (0...𝑠))(𝐴 Σg (𝑛 ∈ ℕ0 ↦ (((coe1𝐾)‘𝑛) (𝑛 𝑀)))) = (𝑈‘(𝑌 Σg (𝑛 ∈ ℕ0 ↦ ((𝑛𝐸(𝑇𝑀)) × (𝐺𝑛))))))
 
Theoremcayleyhamilton0 20416* The Cayley-Hamilton theorem: A matrix over a commutative ring "satisfies its own characteristic equation". This version of cayleyhamilton 20417 provides definitions not used in the theorem itself, but in its proof to make it clearer, more readable and shorter compared with a proof without them (see cayleyhamiltonALT 20418)! (Contributed by AV, 25-Nov-2019.) (Revised by AV, 15-Dec-2019.)
𝐴 = (𝑁 Mat 𝑅)    &   𝐵 = (Base‘𝐴)    &    0 = (0g𝐴)    &    1 = (1r𝐴)    &    = ( ·𝑠𝐴)    &    = (.g‘(mulGrp‘𝐴))    &   𝐶 = (𝑁 CharPlyMat 𝑅)    &   𝐾 = (coe1‘(𝐶𝑀))    &   𝑃 = (Poly1𝑅)    &   𝑌 = (𝑁 Mat 𝑃)    &    × = (.r𝑌)    &    = (-g𝑌)    &   𝑍 = (0g𝑌)    &   𝑊 = (Base‘𝑌)    &   𝐸 = (.g‘(mulGrp‘𝑌))    &   𝑇 = (𝑁 matToPolyMat 𝑅)    &   𝐺 = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, (𝑍 ((𝑇𝑀) × (𝑇‘(𝑏‘0)))), if(𝑛 = (𝑠 + 1), (𝑇‘(𝑏𝑠)), if((𝑠 + 1) < 𝑛, 𝑍, ((𝑇‘(𝑏‘(𝑛 − 1))) ((𝑇𝑀) × (𝑇‘(𝑏𝑛))))))))    &   𝑈 = (𝑁 cPolyMatToMat 𝑅)       ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) → (𝐴 Σg (𝑛 ∈ ℕ0 ↦ ((𝐾𝑛) (𝑛 𝑀)))) = 0 )
 
Theoremcayleyhamilton 20417* The Cayley-Hamilton theorem: A matrix over a commutative ring "satisfies its own characteristic equation", see theorem 7.8 in [Roman] p. 170 (without proof!), or theorem 3.1 in [Lang] p. 561. In other words, a matrix over a commutative ring "inserted" into its characteristic polynomial results in zero. This is Metamath 100 proof #49. (Contributed by Alexander van der Vekens, 25-Nov-2019.)
𝐴 = (𝑁 Mat 𝑅)    &   𝐵 = (Base‘𝐴)    &    0 = (0g𝐴)    &   𝐶 = (𝑁 CharPlyMat 𝑅)    &   𝐾 = (coe1‘(𝐶𝑀))    &    = ( ·𝑠𝐴)    &    = (.g‘(mulGrp‘𝐴))       ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) → (𝐴 Σg (𝑛 ∈ ℕ0 ↦ ((𝐾𝑛) (𝑛 𝑀)))) = 0 )
 
TheoremcayleyhamiltonALT 20418* Alternate proof of cayleyhamilton 20417, the Cayley-Hamilton theorem. This proof does not use cayleyhamilton0 20416 directly, but has the same structure as the proof of cayleyhamilton0 20416. In contrast to the proof of cayleyhamilton0 20416, only the definitions required to formulate the theorem itself are used, causing the definitions used in the lemmas being expanded, which makes the proof longer and more difficult to read. (Contributed by AV, 25-Nov-2019.) (New usage is discouraged.) (Proof modification is discouraged.)
𝐴 = (𝑁 Mat 𝑅)    &   𝐵 = (Base‘𝐴)    &    0 = (0g𝐴)    &   𝐶 = (𝑁 CharPlyMat 𝑅)    &   𝐾 = (coe1‘(𝐶𝑀))    &    = ( ·𝑠𝐴)    &    = (.g‘(mulGrp‘𝐴))       ((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) → (𝐴 Σg (𝑛 ∈ ℕ0 ↦ ((𝐾𝑛) (𝑛 𝑀)))) = 0 )
 
Theoremcayleyhamilton1 20419* The Cayley-Hamilton theorem: A matrix over a commutative ring "satisfies its own characteristic equation", or, in other words, a matrix over a commutative ring "inserted" into its characteristic polynomial results in zero. In this variant of cayleyhamilton 20417, the meaning of "inserted" is made more transparent: If the characteristic polynomial is a polynomial with coefficients (𝐹𝑛), then a matrix over a commutative ring "inserted" into its characteristic polynomial is the sum of these coefficients multiplied with the corresponding power of the matrix. (Contributed by AV, 25-Nov-2019.)
𝐴 = (𝑁 Mat 𝑅)    &   𝐵 = (Base‘𝐴)    &    0 = (0g𝐴)    &   𝐶 = (𝑁 CharPlyMat 𝑅)    &   𝐾 = (coe1‘(𝐶𝑀))    &    = ( ·𝑠𝐴)    &    = (.g‘(mulGrp‘𝐴))    &   𝐿 = (Base‘𝑅)    &   𝑋 = (var1𝑅)    &   𝑃 = (Poly1𝑅)    &    · = ( ·𝑠𝑃)    &   𝐸 = (.g‘(mulGrp‘𝑃))    &   𝑍 = (0g𝑅)       (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) ∧ (𝐹 ∈ (𝐿𝑚0) ∧ 𝐹 finSupp 𝑍)) → ((𝐶𝑀) = (𝑃 Σg (𝑛 ∈ ℕ0 ↦ ((𝐹𝑛) · (𝑛𝐸𝑋)))) → (𝐴 Σg (𝑛 ∈ ℕ0 ↦ ((𝐹𝑛) (𝑛 𝑀)))) = 0 ))
 
PART 12  BASIC TOPOLOGY
 
12.1  Topology
 
12.1.1  Topological spaces
 
Syntaxctop 20420 Extend class notation with the class of all topologies.
class Top
 
Syntaxctopon 20421 The class function of all topologies over a base set.
class TopOn
 
Syntaxctps 20422 Extend class notation with the class of all topological spaces.
class TopSp
 
Syntaxctb 20423 Extend class notation with the class of all topological bases.
class TopBases
 
Definitiondf-top 20424* Define the (proper) class of all topologies. See istop2g 20429 for an alternate way to express finite intersection.

The final form of the definition is due to Bourbaki (Def. 1 of [BourbakiTop1] p. I.1), while the idea of defining a topology in terms of its open sets is due to Aleksandrov. For the convoluted history of the definitions of these notions, see

Gregory H. Moore, The emergence of open sets, closed sets, and limit points in analysis and topology, Historia Mathematica 35 (2008) 220--241.

(Contributed by NM, 3-Mar-2006.) (Revised by BJ, 20-Oct-2018.)

Top = {𝑥 ∣ (∀𝑦 ∈ 𝒫 𝑥 𝑦𝑥 ∧ ∀𝑦𝑥𝑧𝑥 (𝑦𝑧) ∈ 𝑥)}
 
Definitiondf-bases 20425* Define the class of all topological bases. Equivalent to definition of basis in [Munkres] p. 78 (see isbasis2g 20466). Note that "bases" is the plural of "basis." (Contributed by NM, 17-Jul-2006.)
TopBases = {𝑥 ∣ ∀𝑦𝑥𝑧𝑥 (𝑦𝑧) ⊆ (𝑥 ∩ 𝒫 (𝑦𝑧))}
 
Definitiondf-topon 20426* Define the set of topologies with a given base set. (Contributed by Stefan O'Rear, 31-Jan-2015.)
TopOn = (𝑏 ∈ V ↦ {𝑗 ∈ Top ∣ 𝑏 = 𝑗})
 
Definitiondf-topsp 20427 Define the class of all topological spaces (structures). (Contributed by Stefan O'Rear, 13-Aug-2015.)
TopSp = {𝑓 ∣ (TopOpen‘𝑓) ∈ (TopOn‘(Base‘𝑓))}
 
Theoremistopg 20428* Express the predicate "𝐽 is a topology." Note: In the literature, a topology is often represented by a script letter T, which resembles the letter J. This confusion may have led to J being used by some authors - e.g. K. D. Joshi, Introduction to General Topology (1983), p. 114 - and it is convenient for us since we later use 𝑇 to represent linear transformations (operators). (Contributed by Stefan Allan, 3-Mar-2006.) (Revised by Mario Carneiro, 11-Nov-2013.)
(𝐽𝐴 → (𝐽 ∈ Top ↔ (∀𝑥(𝑥𝐽 𝑥𝐽) ∧ ∀𝑥𝐽𝑦𝐽 (𝑥𝑦) ∈ 𝐽)))
 
Theoremistop2g 20429* Express the predicate "𝐽 is a topology," using "the intersection of the elements of any finite subcollection" instead of the intersection of any two elements. (Contributed by NM, 19-Jul-2006.)
(𝐽𝐴 → (𝐽 ∈ Top ↔ (∀𝑥(𝑥𝐽 𝑥𝐽) ∧ ∀𝑥((𝑥𝐽𝑥 ≠ ∅ ∧ 𝑥 ∈ Fin) → 𝑥𝐽))))
 
Theoremuniopn 20430 The union of a subset of a topology is an open set. (Contributed by Stefan Allan, 27-Feb-2006.)
((𝐽 ∈ Top ∧ 𝐴𝐽) → 𝐴𝐽)
 
Theoremiunopn 20431* The indexed union of a subset of a topology is an open set. (Contributed by NM, 5-Oct-2006.)
((𝐽 ∈ Top ∧ ∀𝑥𝐴 𝐵𝐽) → 𝑥𝐴 𝐵𝐽)
 
Theoreminopn 20432 The intersection of two open sets of a topology is also an open set. (Contributed by NM, 17-Jul-2006.)
((𝐽 ∈ Top ∧ 𝐴𝐽𝐵𝐽) → (𝐴𝐵) ∈ 𝐽)
 
Theoremfitop 20433 A topology is closed under finite intersections. (Contributed by Jeff Hankins, 7-Oct-2009.)
(𝐽 ∈ Top → (fi‘𝐽) = 𝐽)
 
Theoremfiinopn 20434 The intersection of a nonempty finite family of open sets is open. (Contributed by FL, 20-Apr-2012.)
(𝐽 ∈ Top → ((𝐴𝐽𝐴 ≠ ∅ ∧ 𝐴 ∈ Fin) → 𝐴𝐽))
 
Theoremiinopn 20435* The intersection of a nonempty finite family of open sets is open. (Contributed by Mario Carneiro, 14-Sep-2014.)
((𝐽 ∈ Top ∧ (𝐴 ∈ Fin ∧ 𝐴 ≠ ∅ ∧ ∀𝑥𝐴 𝐵𝐽)) → 𝑥𝐴 𝐵𝐽)
 
Theoremunopn 20436 The union of two open sets is open. (Contributed by Jeff Madsen, 2-Sep-2009.)
((𝐽 ∈ Top ∧ 𝐴𝐽𝐵𝐽) → (𝐴𝐵) ∈ 𝐽)
 
Theorem0opn 20437 The empty set is an open subset of a topology. (Contributed by Stefan Allan, 27-Feb-2006.)
(𝐽 ∈ Top → ∅ ∈ 𝐽)
 
Theorem0ntop 20438 The empty set is not a topology. (Contributed by FL, 1-Jun-2008.)
¬ ∅ ∈ Top
 
Theoremtopopn 20439 The underlying set of a topology is an open set. (Contributed by NM, 17-Jul-2006.)
𝑋 = 𝐽       (𝐽 ∈ Top → 𝑋𝐽)
 
Theoremeltopss 20440 A member of a topology is a subset of its underlying set. (Contributed by NM, 12-Sep-2006.)
𝑋 = 𝐽       ((𝐽 ∈ Top ∧ 𝐴𝐽) → 𝐴𝑋)
 
Theoremriinopn 20441* A finite indexed relative intersection of open sets is open. (Contributed by Mario Carneiro, 22-Aug-2015.)
𝑋 = 𝐽       ((𝐽 ∈ Top ∧ 𝐴 ∈ Fin ∧ ∀𝑥𝐴 𝐵𝐽) → (𝑋 𝑥𝐴 𝐵) ∈ 𝐽)
 
Theoremrintopn 20442 A finite relative intersection of open sets is open. (Contributed by Mario Carneiro, 22-Aug-2015.)
𝑋 = 𝐽       ((𝐽 ∈ Top ∧ 𝐴𝐽𝐴 ∈ Fin) → (𝑋 𝐴) ∈ 𝐽)
 
Theoremistopon 20443 Property of being a topology with a given base set. (Contributed by Stefan O'Rear, 31-Jan-2015.) (Revised by Mario Carneiro, 13-Aug-2015.)
(𝐽 ∈ (TopOn‘𝐵) ↔ (𝐽 ∈ Top ∧ 𝐵 = 𝐽))
 
Theoremtopontop 20444 A topology on a given base set is a topology. (Contributed by Mario Carneiro, 13-Aug-2015.)
(𝐽 ∈ (TopOn‘𝐵) → 𝐽 ∈ Top)
 
Theoremtoponuni 20445 The base set of a topology on a given base set. (Contributed by Mario Carneiro, 13-Aug-2015.)
(𝐽 ∈ (TopOn‘𝐵) → 𝐵 = 𝐽)
 
Theoremtoponmax 20446 The base set of a topology is an open set. (Contributed by Mario Carneiro, 13-Aug-2015.)
(𝐽 ∈ (TopOn‘𝐵) → 𝐵𝐽)
 
Theoremtoponss 20447 A member of a topology is a subset of its underlying set. (Contributed by Mario Carneiro, 21-Aug-2015.)
((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴𝐽) → 𝐴𝑋)
 
Theoremtoponcom 20448 If 𝐾 is a topology on the base set of topology 𝐽, then 𝐽 is a topology on the base of 𝐾. (Contributed by Mario Carneiro, 22-Aug-2015.)
((𝐽 ∈ Top ∧ 𝐾 ∈ (TopOn‘ 𝐽)) → 𝐽 ∈ (TopOn‘ 𝐾))
 
Theoremtopontopi 20449 A topology on a given base set is a topology. (Contributed by Mario Carneiro, 13-Aug-2015.)
𝐽 ∈ (TopOn‘𝐵)       𝐽 ∈ Top
 
Theoremtoponunii 20450 The base set of a topology on a given base set. (Contributed by Mario Carneiro, 13-Aug-2015.)
𝐽 ∈ (TopOn‘𝐵)       𝐵 = 𝐽
 
Theoremtoptopon 20451 Alternative definition of Top in terms of TopOn. (Contributed by Mario Carneiro, 13-Aug-2015.)
𝑋 = 𝐽       (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘𝑋))
 
Theoremtopgele 20452 The topologies over the same set have the greatest element (the discrete topology) and the least element (the indiscrete topology). (Contributed by FL, 18-Apr-2010.) (Revised by Mario Carneiro, 16-Sep-2015.)
(𝐽 ∈ (TopOn‘𝑋) → ({∅, 𝑋} ⊆ 𝐽𝐽 ⊆ 𝒫 𝑋))
 
Theoremtopsn 20453 The only topology on a singleton is the discrete topology (which is also the indiscrete topology by pwsn 4264). (Contributed by FL, 5-Jan-2009.) (Revised by Mario Carneiro, 16-Sep-2015.)
(𝐽 ∈ (TopOn‘{𝐴}) → 𝐽 = 𝒫 {𝐴})
 
Theoremistps 20454 Express the predicate "is a topological space." (Contributed by Mario Carneiro, 13-Aug-2015.)
𝐴 = (Base‘𝐾)    &   𝐽 = (TopOpen‘𝐾)       (𝐾 ∈ TopSp ↔ 𝐽 ∈ (TopOn‘𝐴))
 
Theoremistps2 20455 Express the predicate "is a topological space." (Contributed by NM, 20-Oct-2012.)
𝐴 = (Base‘𝐾)    &   𝐽 = (TopOpen‘𝐾)       (𝐾 ∈ TopSp ↔ (𝐽 ∈ Top ∧ 𝐴 = 𝐽))
 
Theoremtpsuni 20456 The base set of a topological space. (Contributed by FL, 27-Jun-2014.)
𝐴 = (Base‘𝐾)    &   𝐽 = (TopOpen‘𝐾)       (𝐾 ∈ TopSp → 𝐴 = 𝐽)
 
Theoremtpstop 20457 The topology extractor on a topological space is a topology. (Contributed by FL, 27-Jun-2014.)
𝐽 = (TopOpen‘𝐾)       (𝐾 ∈ TopSp → 𝐽 ∈ Top)
 
Theoremtpspropd 20458 A topological space depends only on the base and topology components. (Contributed by NM, 18-Jul-2006.) (Revised by Mario Carneiro, 13-Aug-2015.)
(𝜑 → (Base‘𝐾) = (Base‘𝐿))    &   (𝜑 → (TopOpen‘𝐾) = (TopOpen‘𝐿))       (𝜑 → (𝐾 ∈ TopSp ↔ 𝐿 ∈ TopSp))
 
Theoremtpsprop2d 20459 A topological space depends only on the base and topology components. (Contributed by Mario Carneiro, 13-Aug-2015.)
(𝜑 → (Base‘𝐾) = (Base‘𝐿))    &   (𝜑 → (TopSet‘𝐾) = (TopSet‘𝐿))       (𝜑 → (𝐾 ∈ TopSp ↔ 𝐿 ∈ TopSp))
 
Theoremtopontopn 20460 Express the predicate "is a topological space." (Contributed by Mario Carneiro, 13-Aug-2015.)
𝐴 = (Base‘𝐾)    &   𝐽 = (TopSet‘𝐾)       (𝐽 ∈ (TopOn‘𝐴) → 𝐽 = (TopOpen‘𝐾))
 
Theoremtsettps 20461 If the topology component is already correctly truncated, then it forms a topological space (with the topology extractor function coming out the same as the component). (Contributed by Mario Carneiro, 13-Aug-2015.)
𝐴 = (Base‘𝐾)    &   𝐽 = (TopSet‘𝐾)       (𝐽 ∈ (TopOn‘𝐴) → 𝐾 ∈ TopSp)
 
Theoremistpsi 20462 Properties that determine a topological space. (Contributed by NM, 20-Oct-2012.)
(Base‘𝐾) = 𝐴    &   (TopOpen‘𝐾) = 𝐽    &   𝐴 = 𝐽    &   𝐽 ∈ Top       𝐾 ∈ TopSp
 
Theoremeltpsg 20463 Properties that determine a topological space from a construction (using no explicit indices). (Contributed by Mario Carneiro, 13-Aug-2015.)
𝐾 = {⟨(Base‘ndx), 𝐴⟩, ⟨(TopSet‘ndx), 𝐽⟩}       (𝐽 ∈ (TopOn‘𝐴) → 𝐾 ∈ TopSp)
 
Theoremeltpsi 20464 Properties that determine a topological space from a construction (using no explicit indices). (Contributed by NM, 20-Oct-2012.) (Revised by Mario Carneiro, 13-Aug-2015.)
𝐾 = {⟨(Base‘ndx), 𝐴⟩, ⟨(TopSet‘ndx), 𝐽⟩}    &   𝐴 = 𝐽    &   𝐽 ∈ Top       𝐾 ∈ TopSp
 
12.1.2  TopBases for topologies
 
Theoremisbasisg 20465* Express the predicate "𝐵 is a basis for a topology." (Contributed by NM, 17-Jul-2006.)
(𝐵𝐶 → (𝐵 ∈ TopBases ↔ ∀𝑥𝐵𝑦𝐵 (𝑥𝑦) ⊆ (𝐵 ∩ 𝒫 (𝑥𝑦))))
 
Theoremisbasis2g 20466* Express the predicate "𝐵 is a basis for a topology." (Contributed by NM, 17-Jul-2006.)
(𝐵𝐶 → (𝐵 ∈ TopBases ↔ ∀𝑥𝐵𝑦𝐵𝑧 ∈ (𝑥𝑦)∃𝑤𝐵 (𝑧𝑤𝑤 ⊆ (𝑥𝑦))))
 
Theoremisbasis3g 20467* Express the predicate "𝐵 is a basis for a topology." Definition of basis in [Munkres] p. 78. (Contributed by NM, 17-Jul-2006.)
(𝐵𝐶 → (𝐵 ∈ TopBases ↔ (∀𝑥𝐵 𝑥 𝐵 ∧ ∀𝑥 𝐵𝑦𝐵 𝑥𝑦 ∧ ∀𝑥𝐵𝑦𝐵𝑧 ∈ (𝑥𝑦)∃𝑤𝐵 (𝑧𝑤𝑤 ⊆ (𝑥𝑦)))))
 
Theorembasis1 20468 Property of a basis. (Contributed by NM, 16-Jul-2006.)
((𝐵 ∈ TopBases ∧ 𝐶𝐵𝐷𝐵) → (𝐶𝐷) ⊆ (𝐵 ∩ 𝒫 (𝐶𝐷)))
 
Theorembasis2 20469* Property of a basis. (Contributed by NM, 17-Jul-2006.)
(((𝐵 ∈ TopBases ∧ 𝐶𝐵) ∧ (𝐷𝐵𝐴 ∈ (𝐶𝐷))) → ∃𝑥𝐵 (𝐴𝑥𝑥 ⊆ (𝐶𝐷)))
 
Theoremfiinbas 20470* If a set is closed under finite intersection, then it is a basis for a topology. (Contributed by Jeff Madsen, 2-Sep-2009.)
((𝐵𝐶 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥𝑦) ∈ 𝐵) → 𝐵 ∈ TopBases)
 
Theorembasdif0 20471 A basis is not affected by the addition or removal of the empty set. (Contributed by Mario Carneiro, 28-Aug-2015.)
((𝐵 ∖ {∅}) ∈ TopBases ↔ 𝐵 ∈ TopBases)
 
Theorembaspartn 20472* A disjoint system of sets is a basis for a topology. (Contributed by Stefan O'Rear, 22-Feb-2015.)
((𝑃𝑉 ∧ ∀𝑥𝑃𝑦𝑃 (𝑥 = 𝑦 ∨ (𝑥𝑦) = ∅)) → 𝑃 ∈ TopBases)
 
Theoremtgval 20473* The topology generated by a basis. (Contributed by NM, 16-Jul-2006.) (Revised by Mario Carneiro, 10-Jan-2015.)
(𝐵𝑉 → (topGen‘𝐵) = {𝑥𝑥 (𝐵 ∩ 𝒫 𝑥)})
 
Theoremtgval2 20474* Definition of a topology generated by a basis in [Munkres] p. 78. Later we show (in tgcl 20487) that (topGen‘𝐵) is indeed a topology (on 𝐵; see unitg 20485). (Contributed by NM, 15-Jul-2006.) (Revised by Mario Carneiro, 10-Jan-2015.)
(𝐵𝑉 → (topGen‘𝐵) = {𝑥 ∣ (𝑥 𝐵 ∧ ∀𝑦𝑥𝑧𝐵 (𝑦𝑧𝑧𝑥))})
 
Theoremeltg 20475 Membership in a topology generated by a basis. (Contributed by NM, 16-Jul-2006.) (Revised by Mario Carneiro, 10-Jan-2015.)
(𝐵𝑉 → (𝐴 ∈ (topGen‘𝐵) ↔ 𝐴 (𝐵 ∩ 𝒫 𝐴)))
 
Theoremeltg2 20476* Membership in a topology generated by a basis. (Contributed by NM, 15-Jul-2006.) (Revised by Mario Carneiro, 10-Jan-2015.)
(𝐵𝑉 → (𝐴 ∈ (topGen‘𝐵) ↔ (𝐴 𝐵 ∧ ∀𝑥𝐴𝑦𝐵 (𝑥𝑦𝑦𝐴))))
 
Theoremeltg2b 20477* Membership in a topology generated by a basis. (Contributed by Mario Carneiro, 17-Jun-2014.) (Revised by Mario Carneiro, 10-Jan-2015.)
(𝐵𝑉 → (𝐴 ∈ (topGen‘𝐵) ↔ ∀𝑥𝐴𝑦𝐵 (𝑥𝑦𝑦𝐴)))
 
Theoremeltg4i 20478 An open set in a topology generated by a basis is the union of all basic open sets contained in it. (Contributed by Stefan O'Rear, 22-Feb-2015.)
(𝐴 ∈ (topGen‘𝐵) → 𝐴 = (𝐵 ∩ 𝒫 𝐴))
 
Theoremeltg3i 20479 The union of a set of basic open sets is in the generated topology. (Contributed by Mario Carneiro, 30-Aug-2015.)
((𝐵𝑉𝐴𝐵) → 𝐴 ∈ (topGen‘𝐵))
 
Theoremeltg3 20480* Membership in a topology generated by a basis. (Contributed by NM, 15-Jul-2006.) (Proof shortened by Mario Carneiro, 30-Aug-2015.)
(𝐵𝑉 → (𝐴 ∈ (topGen‘𝐵) ↔ ∃𝑥(𝑥𝐵𝐴 = 𝑥)))
 
Theoremtgval3 20481* Alternate expression for the topology generated by a basis. Lemma 2.1 of [Munkres] p. 80. (Contributed by NM, 17-Jul-2006.) (Revised by Mario Carneiro, 30-Aug-2015.)
(𝐵𝑉 → (topGen‘𝐵) = {𝑥 ∣ ∃𝑦(𝑦𝐵𝑥 = 𝑦)})
 
Theoremtg1 20482 Property of a member of a topology generated by a basis. (Contributed by NM, 20-Jul-2006.)
(𝐴 ∈ (topGen‘𝐵) → 𝐴 𝐵)
 
Theoremtg2 20483* Property of a member of a topology generated by a basis. (Contributed by NM, 20-Jul-2006.)
((𝐴 ∈ (topGen‘𝐵) ∧ 𝐶𝐴) → ∃𝑥𝐵 (𝐶𝑥𝑥𝐴))
 
Theorembastg 20484 A member of a basis is a subset of the topology it generates. (Contributed by NM, 16-Jul-2006.) (Revised by Mario Carneiro, 10-Jan-2015.)
(𝐵𝑉𝐵 ⊆ (topGen‘𝐵))
 
Theoremunitg 20485 The topology generated by a basis 𝐵 is a topology on 𝐵. Importantly, this theorem means that we don't have to specify separately the base set for the topological space generated by a basis. In other words, any member of the class TopBases completely specifies the basis it corresponds to. (Contributed by NM, 16-Jul-2006.) (Proof shortened by OpenAI, 30-Mar-2020.)
(𝐵𝑉 (topGen‘𝐵) = 𝐵)
 
Theoremtgss 20486 Subset relation for generated topologies. (Contributed by NM, 7-May-2007.)
((𝐶𝑉𝐵𝐶) → (topGen‘𝐵) ⊆ (topGen‘𝐶))
 
Theoremtgcl 20487 Show that a basis generates a topology. Remark in [Munkres] p. 79. (Contributed by NM, 17-Jul-2006.)
(𝐵 ∈ TopBases → (topGen‘𝐵) ∈ Top)
 
Theoremtgclb 20488 The property tgcl 20487 can be reversed: if the topology generated by 𝐵 is actually a topology, then 𝐵 must be a topological basis. This yields an alternative definition of TopBases. (Contributed by Mario Carneiro, 2-Sep-2015.)
(𝐵 ∈ TopBases ↔ (topGen‘𝐵) ∈ Top)
 
Theoremtgtopon 20489 A basis generates a topology on 𝐵. (Contributed by Mario Carneiro, 14-Aug-2015.)
(𝐵 ∈ TopBases → (topGen‘𝐵) ∈ (TopOn‘ 𝐵))
 
Theoremtopbas 20490 A topology is its own basis. (Contributed by NM, 17-Jul-2006.)
(𝐽 ∈ Top → 𝐽 ∈ TopBases)
 
Theoremtgtop 20491 A topology is its own basis. (Contributed by NM, 18-Jul-2006.)
(𝐽 ∈ Top → (topGen‘𝐽) = 𝐽)
 
Theoremeltop 20492 Membership in a topology, expressed without quantifiers. (Contributed by NM, 19-Jul-2006.)
(𝐽 ∈ Top → (𝐴𝐽𝐴 (𝐽 ∩ 𝒫 𝐴)))
 
Theoremeltop2 20493* Membership in a topology. (Contributed by NM, 19-Jul-2006.)
(𝐽 ∈ Top → (𝐴𝐽 ↔ ∀𝑥𝐴𝑦𝐽 (𝑥𝑦𝑦𝐴)))
 
Theoremeltop3 20494* Membership in a topology. (Contributed by NM, 19-Jul-2006.)
(𝐽 ∈ Top → (𝐴𝐽 ↔ ∃𝑥(𝑥𝐽𝐴 = 𝑥)))
 
Theoremfibas 20495 A collection of finite intersections is a basis. The initial set is a subbasis for the topology. (Contributed by Jeff Hankins, 25-Aug-2009.) (Revised by Mario Carneiro, 24-Nov-2013.)
(fi‘𝐴) ∈ TopBases
 
Theoremtgdom 20496 A space has no more open sets than subsets of a basis. (Contributed by Stefan O'Rear, 22-Feb-2015.) (Revised by Mario Carneiro, 9-Apr-2015.)
(𝐵𝑉 → (topGen‘𝐵) ≼ 𝒫 𝐵)
 
Theoremtgiun 20497* The indexed union of a set of basic open sets is in the generated topology. (Contributed by Mario Carneiro, 2-Sep-2015.)
((𝐵𝑉 ∧ ∀𝑥𝐴 𝐶𝐵) → 𝑥𝐴 𝐶 ∈ (topGen‘𝐵))
 
Theoremtgidm 20498 The topology generator function is idempotent. (Contributed by NM, 18-Jul-2006.) (Revised by Mario Carneiro, 2-Sep-2015.)
(𝐵𝑉 → (topGen‘(topGen‘𝐵)) = (topGen‘𝐵))
 
Theorembastop 20499 Two ways to express that a basis is a topology. (Contributed by NM, 18-Jul-2006.)
(𝐵 ∈ TopBases → (𝐵 ∈ Top ↔ (topGen‘𝐵) = 𝐵))
 
Theoremtgtop11 20500 The topology generation function is one-to-one when applied to completed topologies. (Contributed by NM, 18-Jul-2006.)
((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ (topGen‘𝐽) = (topGen‘𝐾)) → 𝐽 = 𝐾)
    < Previous  Next >

Page List
Jump to page: Contents  1 1-100 2 101-200 3 201-300 4 301-400 5 401-500 6 501-600 7 601-700 8 701-800 9 801-900 10 901-1000 11 1001-1100 12 1101-1200 13 1201-1300 14 1301-1400 15 1401-1500 16 1501-1600 17 1601-1700 18 1701-1800 19 1801-1900 20 1901-2000 21 2001-2100 22 2101-2200 23 2201-2300 24 2301-2400 25 2401-2500 26 2501-2600 27 2601-2700 28 2701-2800 29 2801-2900 30 2901-3000 31 3001-3100 32 3101-3200 33 3201-3300 34 3301-3400 35 3401-3500 36 3501-3600 37 3601-3700 38 3701-3800 39 3801-3900 40 3901-4000 41 4001-4100 42 4101-4200 43 4201-4300 44 4301-4400 45 4401-4500 46 4501-4600 47 4601-4700 48 4701-4800 49 4801-4900 50 4901-5000 51 5001-5100 52 5101-5200 53 5201-5300 54 5301-5400 55 5401-5500 56 5501-5600 57 5601-5700 58 5701-5800 59 5801-5900 60 5901-6000 61 6001-6100 62 6101-6200 63 6201-6300 64 6301-6400 65 6401-6500 66 6501-6600 67 6601-6700 68 6701-6800 69 6801-6900 70 6901-7000 71 7001-7100 72 7101-7200 73 7201-7300 74 7301-7400 75 7401-7500 76 7501-7600 77 7601-7700 78 7701-7800 79 7801-7900 80 7901-8000 81 8001-8100 82 8101-8200 83 8201-8300 84 8301-8400 85 8401-8500 86 8501-8600 87 8601-8700 88 8701-8800 89 8801-8900 90 8901-9000 91 9001-9100 92 9101-9200 93 9201-9300 94 9301-9400 95 9401-9500 96 9501-9600 97 9601-9700 98 9701-9800 99 9801-9900 100 9901-10000 101 10001-10100 102 10101-10200 103 10201-10300 104 10301-10400 105 10401-10500 106 10501-10600 107 10601-10700 108 10701-10800 109 10801-10900 110 10901-11000 111 11001-11100 112 11101-11200 113 11201-11300 114 11301-11400 115 11401-11500 116 11501-11600 117 11601-11700 118 11701-11800 119 11801-11900 120 11901-12000 121 12001-12100 122 12101-12200 123 12201-12300 124 12301-12400 125 12401-12500 126 12501-12600 127 12601-12700 128 12701-12800 129 12801-12900 130 12901-13000 131 13001-13100 132 13101-13200 133 13201-13300 134 13301-13400 135 13401-13500 136 13501-13600 137 13601-13700 138 13701-13800 139 13801-13900 140 13901-14000 141 14001-14100 142 14101-14200 143 14201-14300 144 14301-14400 145 14401-14500 146 14501-14600 147 14601-14700 148 14701-14800 149 14801-14900 150 14901-15000 151 15001-15100 152 15101-15200 153 15201-15300 154 15301-15400 155 15401-15500 156 15501-15600 157 15601-15700 158 15701-15800 159 15801-15900 160 15901-16000 161 16001-16100 162 16101-16200 163 16201-16300 164 16301-16400 165 16401-16500 166 16501-16600 167 16601-16700 168 16701-16800 169 16801-16900 170 16901-17000 171 17001-17100 172 17101-17200 173 17201-17300 174 17301-17400 175 17401-17500 176 17501-17600 177 17601-17700 178 17701-17800 179 17801-17900 180 17901-18000 181 18001-18100 182 18101-18200 183 18201-18300 184 18301-18400 185 18401-18500 186 18501-18600 187 18601-18700 188 18701-18800 189 18801-18900 190 18901-19000 191 19001-19100 192 19101-19200 193 19201-19300 194 19301-19400 195 19401-19500 196 19501-19600 197 19601-19700 198 19701-19800 199 19801-19900 200 19901-20000 201 20001-20100 202 20101-20200 203 20201-20300 204 20301-20400 205 20401-20500 206 20501-20600 207 20601-20700 208 20701-20800 209 20801-20900 210 20901-21000 211 21001-21100 212 21101-21200 213 21201-21300 214 21301-21400 215 21401-21500 216 21501-21600 217 21601-21700 218 21701-21800 219 21801-21900 220 21901-22000 221 22001-22100 222 22101-22200 223 22201-22300 224 22301-22400 225 22401-22500 226 22501-22600 227 22601-22700 228 22701-22800 229 22801-22900 230 22901-23000 231 23001-23100 232 23101-23200 233 23201-23300 234 23301-23400 235 23401-23500 236 23501-23600 237 23601-23700 238 23701-23800 239 23801-23900 240 23901-24000 241 24001-24100 242 24101-24200 243 24201-24300 244 24301-24400 245 24401-24500 246 24501-24600 247 24601-24700 248 24701-24800 249 24801-24900 250 24901-25000 251 25001-25100 252 25101-25200 253 25201-25300 254 25301-25400 255 25401-25500 256 25501-25600 257 25601-25700 258 25701-25800 259 25801-25900 260 25901-26000 261 26001-26100 262 26101-26200 263 26201-26300 264 26301-26400 265 26401-26500 266 26501-26600 267 26601-26700 268 26701-26800 269 26801-26900 270 26901-27000 271 27001-27100 272 27101-27200 273 27201-27300 274 27301-27400 275 27401-27500 276 27501-27600 277 27601-27700 278 27701-27800 279 27801-27900 280 27901-28000 281 28001-28100 282 28101-28200 283 28201-28300 284 28301-28400 285 28401-28500 286 28501-28600 287 28601-28700 288 28701-28800 289 28801-28900 290 28901-29000 291 29001-29100 292 29101-29200 293 29201-29300 294 29301-29400 295 29401-29500 296 29501-29600 297 29601-29700 298 29701-29800 299 29801-29900 300 29901-30000 301 30001-30100 302 30101-30200 303 30201-30300 304 30301-30400 305 30401-30500 306 30501-30600 307 30601-30700 308 30701-30800 309 30801-30900 310 30901-31000 311 31001-31100 312 31101-31200 313 31201-31300 314 31301-31400 315 31401-31500 316 31501-31600 317 31601-31700 318 31701-31800 319 31801-31900 320 31901-32000 321 32001-32100 322 32101-32200 323 32201-32300 324 32301-32400 325 32401-32500 326 32501-32600 327 32601-32700 328 32701-32800 329 32801-32900 330 32901-33000 331 33001-33100 332 33101-33200 333 33201-33300 334 33301-33400 335 33401-33500 336 33501-33600 337 33601-33700 338 33701-33800 339 33801-33900 340 33901-34000 341 34001-34100 342 34101-34200 343 34201-34300 344 34301-34400 345 34401-34500 346 34501-34600 347 34601-34700 348 34701-34800 349 34801-34900 350 34901-35000 351 35001-35100 352 35101-35200 353 35201-35300 354 35301-35400 355 35401-35500 356 35501-35600 357 35601-35700 358 35701-35800 359 35801-35900 360 35901-36000 361 36001-36100 362 36101-36200 363 36201-36300 364 36301-36400 365 36401-36500 366 36501-36600 367 36601-36700 368 36701-36800 369 36801-36900 370 36901-37000 371 37001-37100 372 37101-37200 373 37201-37300 374 37301-37400 375 37401-37500 376 37501-37600 377 37601-37700 378 37701-37800 379 37801-37900 380 37901-38000 381 38001-38100 382 38101-38200 383 38201-38300 384 38301-38400 385 38401-38500 386 38501-38600 387 38601-38700 388 38701-38800 389 38801-38900 390 38901-39000 391 39001-39100 392 39101-39200 393 39201-39300 394 39301-39400 395 39401-39500 396 39501-39600 397 39601-39700 398 39701-39800 399 39801-39900 400 39901-40000 401 40001-40100 402 40101-40200 403 40201-40300 404 40301-40400 405 40401-40500 406 40501-40600 407 40601-40700 408 40701-40800 409 40801-40900 410 40901-41000 411 41001-41100 412 41101-41200 413 41201-41300 414 41301-41400 415 41401-41500 416 41501-41600 417 41601-41700 418 41701-41800 419 41801-41900 420 41901-42000 421 42001-42100 422 42101-42200 423 42201-42300 424 42301-42400 425 42401-42426
  Copyright terms: Public domain < Previous  Next >