P. 512 of Theorem List - Metamath Proof Explorer

Theorem List for Metamath Proof Explorer - 51101-51156   *Has distinct variable group(s)

Type	Label	Description
Statement
21.55.14  Miscellaneous Miscellaneous proofs.
Theorem	5m4e1 51101	Prove that 5 - 4 = 1. (Contributed by David A. Wheeler, 31-Jan-2017.)
⊢ (5 − 4) = 1
Theorem	2p2ne5 51102	Prove that 2 + 2 ≠ 5. In George Orwell's "1984", Part One, Chapter Seven, the protagonist Winston notes that, "In the end the Party would announce that two and two made five, and you would have to believe it." http://www.sparknotes.com/lit/1984/section4.rhtml. More generally, the phrase 2 + 2 = 5 has come to represent an obviously false dogma one may be required to believe. See the Wikipedia article for more about this: https://en.wikipedia.org/wiki/2_%2B_2_%3D_5. Unsurprisingly, we can easily prove that this claim is false. (Contributed by David A. Wheeler, 31-Jan-2017.)
⊢ (2 + 2) ≠ 5
Theorem	resolution 51103	Resolution rule. This is the primary inference rule in some automated theorem provers such as prover9. The resolution rule can be traced back to Davis and Putnam (1960). (Contributed by David A. Wheeler, 9-Feb-2017.)
⊢ (((𝜑 ∧ 𝜓) ∨ (¬ 𝜑 ∧ 𝜒)) → (𝜓 ∨ 𝜒))
Theorem	testable 51104	In classical logic all wffs are testable, that is, it is always true that (¬ 𝜑 ∨ ¬ ¬ 𝜑). This is not necessarily true in intuitionistic logic. In intuitionistic logic, if this statement is true for some 𝜑, then 𝜑 is testable. The proof is trivial because it's simply a special case of the law of the excluded middle, which is true in classical logic but not necessarily true in intuitionisic logic. (Contributed by David A. Wheeler, 5-Dec-2018.)
⊢ (¬ 𝜑 ∨ ¬ ¬ 𝜑)
21.55.15  Theorems about algebraic numbers
Theorem	aacllem 51105*	Lemma for other theorems about 𝔸. (Contributed by Brendan Leahy, 3-Jan-2020.) (Revised by Alexander van der Vekens and David A. Wheeler, 25-Apr-2020.)
⊢ (𝜑 → 𝐴 ∈ ℂ)    &   ⊢ (𝜑 → 𝑁 ∈ ℕ0)    &   ⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → 𝑋 ∈ ℂ)    &   ⊢ ((𝜑 ∧ 𝑘 ∈ (0...𝑁) ∧ 𝑛 ∈ (1...𝑁)) → 𝐶 ∈ ℚ)    &   ⊢ ((𝜑 ∧ 𝑘 ∈ (0...𝑁)) → (𝐴↑𝑘) = Σ𝑛 ∈ (1...𝑁)(𝐶 · 𝑋))    ⇒   ⊢ (𝜑 → 𝐴 ∈ 𝔸)
21.56  Mathbox for Mingli Yuan
Theorem	wrdf1d 51106	A one-to-one word maps its domain into its alphabet. (Contributed by Mingli Yuan, 11-Aug-2026.)
⊢ (𝜑 → 𝑊 ∈ Word 𝐷)    &   ⊢ (𝜑 → Fun ◡𝑊)    ⇒   ⊢ (𝜑 → 𝑊:dom 𝑊–1-1→𝐷)
21.57  Mathbox for Jiamin Zhao
21.57.1  Cross product and scalar triple product in RR^3
Theorem	1ne3 51107	1 is not equal to 3. (Contributed by Jiamin Zhao, 1-Aug-2026.)
⊢ 1 ≠ 3
Theorem	2ne3 51108	2 is not equal to 3. (Contributed by Jiamin Zhao, 1-Aug-2026.)
⊢ 2 ≠ 3
Theorem	1elfz13 51109	Membership of 1 in the integer interval ( 1 ... 3 ). (Suggested by avekens.) (Contributed by Jiamin Zhao, 1-Aug-2026.) (Proof shortened by Jiamin Zhao, 13-Aug-2026.)
⊢ 1 ∈ (1...3)
Theorem	2elfz13 51110	Membership of 2 in the integer interval ( 1 ... 3 ). (Suggested by tirix.) (Contributed by Jiamin Zhao, 1-Aug-2026.) (Proof shortened by Jiamin Zhao, 13-Aug-2026.)
⊢ 2 ∈ (1...3)
Theorem	3elfz13 51111	Membership of 3 in the integer interval ( 1 ... 3 ). (Contributed by Jiamin Zhao, 1-Aug-2026.)
⊢ 3 ∈ (1...3)
Theorem	rr3fvcl 51112	The components of a 3-dimensional real coordinate vector are real numbers. (Contributed by Jiamin Zhao, 31-Jul-2026.)
⊢ (𝐴 ∈ (ℝ ↑m (1...3)) → ((𝐴‘1) ∈ ℝ ∧ (𝐴‘2) ∈ ℝ ∧ (𝐴‘3) ∈ ℝ))
Theorem	rr3fv1cld 51113	First component of a 3-dimensional real coordinate vector is real. (Contributed by Jiamin Zhao, 10-Aug-2026.)
⊢ (𝜑 → 𝐴 ∈ (ℝ ↑m (1...3)))    ⇒   ⊢ (𝜑 → (𝐴‘1) ∈ ℝ)
Theorem	rr3fv2cld 51114	Second component of a 3-dimensional real coordinate vector is real. (Contributed by Jiamin Zhao, 10-Aug-2026.)
⊢ (𝜑 → 𝐴 ∈ (ℝ ↑m (1...3)))    ⇒   ⊢ (𝜑 → (𝐴‘2) ∈ ℝ)
Theorem	rr3fv3cld 51115	Third component of a 3-dimensional real coordinate vector is real. (Contributed by Jiamin Zhao, 10-Aug-2026.)
⊢ (𝜑 → 𝐴 ∈ (ℝ ↑m (1...3)))    ⇒   ⊢ (𝜑 → (𝐴‘3) ∈ ℝ)
Syntax	ccrossp 51116	Extend class notation to include the cross product operation. (Contributed by Jiamin Zhao, 31-Jul-2026.)
class ⊠
Definition	df-crossp 51117*	Define the cross product of two 3-dimensional real coordinate vectors. Vectors are represented as functions on (1...3). (Contributed by Jiamin Zhao, 31-Jul-2026.)
⊢ ⊠ = (𝑢 ∈ (ℝ ↑m (1...3)), 𝑣 ∈ (ℝ ↑m (1...3)) ↦ (𝑘 ∈ (1...3) ↦ if(𝑘 = 1, (((𝑢‘2) · (𝑣‘3)) − ((𝑢‘3) · (𝑣‘2))), if(𝑘 = 2, (((𝑢‘3) · (𝑣‘1)) − ((𝑢‘1) · (𝑣‘3))), (((𝑢‘1) · (𝑣‘2)) − ((𝑢‘2) · (𝑣‘1)))))))
Syntax	ctripp 51118	Extend class notation to include the scalar triple product of 3-dimensional real coordinate vectors. (Contributed by Jiamin Zhao, 31-Jul-2026.)
class tripp
Definition	df-tripp 51119*	Define the scalar triple product of three 3-dimensional real coordinate vectors as the dot product of the first vector 𝑥 with the cross product of the other two (𝑦 and 𝑧). Apply as (𝑦(tripp‘𝑥)𝑧). Vectors are represented as functions on (1...3). (Contributed by Jiamin Zhao, 31-Jul-2026.)
⊢ tripp = (𝑥 ∈ (ℝ ↑m (1...3)) ↦ (𝑦 ∈ (ℝ ↑m (1...3)), 𝑧 ∈ (ℝ ↑m (1...3)) ↦ (ℝfld Σg (𝑘 ∈ (1...3) ↦ ((𝑥‘𝑘) · ((𝑦⊠𝑧)‘𝑘))))))
Theorem	crosspval 51120*	Value of the cross product of two 3-dimensional real coordinate vectors as a function on (1...3). (Contributed by Jiamin Zhao, 31-Jul-2026.)
⊢ ((𝐴 ∈ (ℝ ↑m (1...3)) ∧ 𝐵 ∈ (ℝ ↑m (1...3))) → (𝐴⊠𝐵) = (𝑘 ∈ (1...3) ↦ if(𝑘 = 1, (((𝐴‘2) · (𝐵‘3)) − ((𝐴‘3) · (𝐵‘2))), if(𝑘 = 2, (((𝐴‘3) · (𝐵‘1)) − ((𝐴‘1) · (𝐵‘3))), (((𝐴‘1) · (𝐵‘2)) − ((𝐴‘2) · (𝐵‘1)))))))
Theorem	crosspcle1d 51121	Closure of the first component of the cross product's coordinate formula. (Contributed by Jiamin Zhao, 11-Aug-2026.)
⊢ (𝜑 → 𝐴 ∈ (ℝ ↑m (1...3)))    &   ⊢ (𝜑 → 𝐵 ∈ (ℝ ↑m (1...3)))    ⇒   ⊢ (𝜑 → (((𝐴‘2) · (𝐵‘3)) − ((𝐴‘3) · (𝐵‘2))) ∈ ℝ)
Theorem	crosspcle2d 51122	Closure of the second component of the cross product's coordinate formula. (Contributed by Jiamin Zhao, 11-Aug-2026.)
⊢ (𝜑 → 𝐴 ∈ (ℝ ↑m (1...3)))    &   ⊢ (𝜑 → 𝐵 ∈ (ℝ ↑m (1...3)))    ⇒   ⊢ (𝜑 → (((𝐴‘3) · (𝐵‘1)) − ((𝐴‘1) · (𝐵‘3))) ∈ ℝ)
Theorem	crosspcle3d 51123	Closure of the third component of the cross product's coordinate formula. (Contributed by Jiamin Zhao, 11-Aug-2026.)
⊢ (𝜑 → 𝐴 ∈ (ℝ ↑m (1...3)))    &   ⊢ (𝜑 → 𝐵 ∈ (ℝ ↑m (1...3)))    ⇒   ⊢ (𝜑 → (((𝐴‘1) · (𝐵‘2)) − ((𝐴‘2) · (𝐵‘1))) ∈ ℝ)
Theorem	crosspclem 51124	Lemma for crosspcld 51125. Closure of the three-way coordinate case split used in the cross product's mapping rule. (Contributed by Jiamin Zhao, 11-Aug-2026.)
⊢ (𝜑 → 𝐴 ∈ (ℝ ↑m (1...3)))    &   ⊢ (𝜑 → 𝐵 ∈ (ℝ ↑m (1...3)))    ⇒   ⊢ (𝜑 → if(𝑘 = 1, (((𝐴‘2) · (𝐵‘3)) − ((𝐴‘3) · (𝐵‘2))), if(𝑘 = 2, (((𝐴‘3) · (𝐵‘1)) − ((𝐴‘1) · (𝐵‘3))), (((𝐴‘1) · (𝐵‘2)) − ((𝐴‘2) · (𝐵‘1))))) ∈ ℝ)
Theorem	crosspcld 51125	Closure of the cross product: the cross product of two 3-dimensional real coordinate vectors is again such a vector. (Contributed by Jiamin Zhao, 12-Aug-2026.)
⊢ (𝜑 → 𝐴 ∈ (ℝ ↑m (1...3)))    &   ⊢ (𝜑 → 𝐵 ∈ (ℝ ↑m (1...3)))    ⇒   ⊢ (𝜑 → (𝐴⊠𝐵) ∈ (ℝ ↑m (1...3)))
Theorem	crosspv1d 51126	Value of the first component of the cross product. (Contributed by Jiamin Zhao, 12-Aug-2026.)
⊢ (𝜑 → 𝐴 ∈ (ℝ ↑m (1...3)))    &   ⊢ (𝜑 → 𝐵 ∈ (ℝ ↑m (1...3)))    ⇒   ⊢ (𝜑 → ((𝐴⊠𝐵)‘1) = (((𝐴‘2) · (𝐵‘3)) − ((𝐴‘3) · (𝐵‘2))))
Theorem	crosspv2d 51127	Value of the second component of the cross product. (Contributed by Jiamin Zhao, 12-Aug-2026.)
⊢ (𝜑 → 𝐴 ∈ (ℝ ↑m (1...3)))    &   ⊢ (𝜑 → 𝐵 ∈ (ℝ ↑m (1...3)))    ⇒   ⊢ (𝜑 → ((𝐴⊠𝐵)‘2) = (((𝐴‘3) · (𝐵‘1)) − ((𝐴‘1) · (𝐵‘3))))
Theorem	crosspv3d 51128	Value of the third component of the cross product. (Contributed by Jiamin Zhao, 12-Aug-2026.)
⊢ (𝜑 → 𝐴 ∈ (ℝ ↑m (1...3)))    &   ⊢ (𝜑 → 𝐵 ∈ (ℝ ↑m (1...3)))    ⇒   ⊢ (𝜑 → ((𝐴⊠𝐵)‘3) = (((𝐴‘1) · (𝐵‘2)) − ((𝐴‘2) · (𝐵‘1))))
Theorem	crosspdot0lem 51129*	Lemma for crosspdotd 51131. Unfold the curried scalar triple product application into an explicit group sum. (Contributed by Jiamin Zhao, 12-Aug-2026.)
⊢ (𝜑 → 𝐴 ∈ (ℝ ↑m (1...3)))    &   ⊢ (𝜑 → 𝐵 ∈ (ℝ ↑m (1...3)))    &   ⊢ (𝜑 → 𝐶 ∈ (ℝ ↑m (1...3)))    ⇒   ⊢ (𝜑 → (𝐵(tripp‘𝐴)𝐶) = (ℝfld Σg (𝑘 ∈ (1...3) ↦ ((𝐴‘𝑘) · ((𝐵⊠𝐶)‘𝑘)))))
Theorem	crosspdotsumlem 51130*	Lemma for crosspdotd 51131. Expand the group sum over (1...3) into an explicit three-term sum. (Contributed by Jiamin Zhao, 12-Aug-2026.)
⊢ (𝜑 → 𝐴 ∈ (ℝ ↑m (1...3)))    &   ⊢ (𝜑 → 𝐵 ∈ (ℝ ↑m (1...3)))    &   ⊢ (𝜑 → 𝐶 ∈ (ℝ ↑m (1...3)))    ⇒   ⊢ (𝜑 → (ℝfld Σg (𝑘 ∈ (1...3) ↦ ((𝐴‘𝑘) · ((𝐵⊠𝐶)‘𝑘)))) = (((𝐴‘1) · ((𝐵⊠𝐶)‘1)) + (((𝐴‘2) · ((𝐵⊠𝐶)‘2)) + ((𝐴‘3) · ((𝐵⊠𝐶)‘3)))))
Theorem	crosspdotd 51131	Value of the scalar triple product, expanded into the standard six-term Sarrus polynomial. (Contributed by Jiamin Zhao, 12-Aug-2026.)
⊢ (𝜑 → 𝐴 ∈ (ℝ ↑m (1...3)))    &   ⊢ (𝜑 → 𝐵 ∈ (ℝ ↑m (1...3)))    &   ⊢ (𝜑 → 𝐶 ∈ (ℝ ↑m (1...3)))    ⇒   ⊢ (𝜑 → (𝐵(tripp‘𝐴)𝐶) = (((((𝐴‘1) · (𝐵‘2)) · (𝐶‘3)) − (((𝐴‘1) · (𝐵‘3)) · (𝐶‘2))) + (((((𝐴‘2) · (𝐵‘3)) · (𝐶‘1)) − (((𝐴‘2) · (𝐵‘1)) · (𝐶‘3))) + ((((𝐴‘3) · (𝐵‘1)) · (𝐶‘2)) − (((𝐴‘3) · (𝐵‘2)) · (𝐶‘1))))))
Theorem	crosspaltd 51132*	Antisymmetry of the cross product: swapping the two vectors negates the result. (Contributed by Jiamin Zhao, 12-Aug-2026.)
⊢ (𝜑 → 𝐴 ∈ (ℝ ↑m (1...3)))    &   ⊢ (𝜑 → 𝐵 ∈ (ℝ ↑m (1...3)))    ⇒   ⊢ (𝜑 → (𝐴⊠𝐵) = (𝑘 ∈ (1...3) ↦ -((𝐵⊠𝐴)‘𝑘)))
Theorem	crossp3d 51133*	The vector triple product expansion (BAC-CAB rule): the cross product of 𝑋 with (𝑌⊠𝑍) equals 𝑌 scaled by the dot product of 𝑋 and 𝑍, minus 𝑍 scaled by the dot product of 𝑋 and 𝑌. The dot products are written out as explicit three-term sums of component products, matching the pointwise style of df-crossp 51117 rather than introducing a separate dot product operator. (Contributed by Jiamin Zhao, 12-Aug-2026.)
⊢ (𝜑 → 𝑋 ∈ (ℝ ↑m (1...3)))    &   ⊢ (𝜑 → 𝑌 ∈ (ℝ ↑m (1...3)))    &   ⊢ (𝜑 → 𝑍 ∈ (ℝ ↑m (1...3)))    ⇒   ⊢ (𝜑 → (𝑋⊠(𝑌⊠𝑍)) = (𝑘 ∈ (1...3) ↦ ((((((𝑋‘1) · (𝑍‘1)) + ((𝑋‘2) · (𝑍‘2))) + ((𝑋‘3) · (𝑍‘3))) · (𝑌‘𝑘)) − (((((𝑋‘1) · (𝑌‘1)) + ((𝑋‘2) · (𝑌‘2))) + ((𝑋‘3) · (𝑌‘3))) · (𝑍‘𝑘)))))
21.57.2  Veronese map and linear dependence
Syntax	cveronese 51134	Extend class notation to include the quadratic Veronese map on real 3-vectors. (Contributed by Jiamin Zhao, 14-Aug-2026.)
class veronese
Definition	df-veronese 51135*	Define the quadratic Veronese map on real 3-vectors, with coordinates ordered as ( x^2 , y^2 , z^2 , x y , y z , z x ). (Contributed by Jiamin Zhao, 14-Aug-2026.)
⊢ veronese = (𝑞 ∈ (ℝ ↑m (1...3)) ↦ (𝑘 ∈ (1...6) ↦ (((if(𝑘 = 1, ((𝑞‘1)↑2), 0) + if(𝑘 = 2, ((𝑞‘2)↑2), 0)) + if(𝑘 = 3, ((𝑞‘3)↑2), 0)) + ((if(𝑘 = 4, ((𝑞‘1) · (𝑞‘2)), 0) + if(𝑘 = 5, ((𝑞‘2) · (𝑞‘3)), 0)) + if(𝑘 = 6, ((𝑞‘3) · (𝑞‘1)), 0)))))
Theorem	nellindf 51136	A nonzero coefficient vector whose weighted combination of 𝐹 sums to the zero vector implies that 𝐹 is not linearly independent. (Contributed by Jiamin Zhao, 27-Aug-2026.)
⊢ 𝐵 = (Base‘𝑊)    &   ⊢ 𝑅 = (Scalar‘𝑊)    &   ⊢ · = ( ·𝑠 ‘𝑊)    &   ⊢ 0 = (0g‘𝑊)    &   ⊢ 𝑌 = (0g‘𝑅)    &   ⊢ 𝐿 = (Base‘(𝑅 freeLMod 𝐼))    ⇒   ⊢ (((𝑊 ∈ LMod ∧ 𝐼 ∈ V ∧ 𝐹:𝐼⟶𝐵) ∧ (𝐾 ∈ 𝐿 ∧ 𝐾 ≠ (𝐼 × {𝑌}) ∧ (𝑊 Σg (𝐾 ∘f · 𝐹)) = 0 )) → ¬ 𝐹 LIndF 𝑊)
Theorem	veronesevald 51137*	Value of the Veronese map at a point, expressed as a maps-to function on the six coordinates. (Contributed by Jiamin Zhao, 14-Aug-2026.)
⊢ (𝜑 → 𝑃 ∈ (ℝ ↑m (1...3)))    ⇒   ⊢ (𝜑 → (veronese‘𝑃) = (𝑘 ∈ (1...6) ↦ (((if(𝑘 = 1, ((𝑃‘1)↑2), 0) + if(𝑘 = 2, ((𝑃‘2)↑2), 0)) + if(𝑘 = 3, ((𝑃‘3)↑2), 0)) + ((if(𝑘 = 4, ((𝑃‘1) · (𝑃‘2)), 0) + if(𝑘 = 5, ((𝑃‘2) · (𝑃‘3)), 0)) + if(𝑘 = 6, ((𝑃‘3) · (𝑃‘1)), 0)))))
Theorem	veronesefvcl 51138	Every coordinate of the Veronese map of a real 3-vector is real. (Contributed by Jiamin Zhao, 19-Aug-2026.)
⊢ ((𝑄 ∈ (ℝ ↑m (1...3)) ∧ 𝐾 ∈ (1...6)) → ((veronese‘𝑄)‘𝐾) ∈ ℝ)
Theorem	veronesev1lem 51139	Lemma for veronesevrowd 51145. Value of the first coordinate of the Veronese map at a point. (Contributed by Jiamin Zhao, 15-Aug-2026.)
⊢ (𝜑 → 𝑃 ∈ (ℝ ↑m (1...3)))    ⇒   ⊢ (𝜑 → ((veronese‘𝑃)‘1) = ((𝑃‘1)↑2))
Theorem	veronesev2lem 51140	Lemma for veronesevrowd 51145. Value of the second coordinate of the Veronese map at a point. (Contributed by Jiamin Zhao, 16-Aug-2026.)
⊢ (𝜑 → 𝑃 ∈ (ℝ ↑m (1...3)))    ⇒   ⊢ (𝜑 → ((veronese‘𝑃)‘2) = ((𝑃‘2)↑2))
Theorem	veronesev3lem 51141	Lemma for veronesevrowd 51145. Value of the third coordinate of the Veronese map at a point. (Contributed by Jiamin Zhao, 17-Aug-2026.)
⊢ (𝜑 → 𝑃 ∈ (ℝ ↑m (1...3)))    ⇒   ⊢ (𝜑 → ((veronese‘𝑃)‘3) = ((𝑃‘3)↑2))
Theorem	veronesev4lem 51142	Lemma for veronesevrowd 51145. Value of the fourth coordinate of the Veronese map at a point. (Contributed by Jiamin Zhao, 17-Aug-2026.)
⊢ (𝜑 → 𝑃 ∈ (ℝ ↑m (1...3)))    ⇒   ⊢ (𝜑 → ((veronese‘𝑃)‘4) = ((𝑃‘1) · (𝑃‘2)))
Theorem	veronesev5lem 51143	Lemma for veronesevrowd 51145. Value of the fifth coordinate of the Veronese map at a point. (Contributed by Jiamin Zhao, 17-Aug-2026.)
⊢ (𝜑 → 𝑃 ∈ (ℝ ↑m (1...3)))    ⇒   ⊢ (𝜑 → ((veronese‘𝑃)‘5) = ((𝑃‘2) · (𝑃‘3)))
Theorem	veronesev6lem 51144	Lemma for veronesevrowd 51145. Value of the sixth coordinate of the Veronese map at a point. (Contributed by Jiamin Zhao, 17-Aug-2026.)
⊢ (𝜑 → 𝑃 ∈ (ℝ ↑m (1...3)))    ⇒   ⊢ (𝜑 → ((veronese‘𝑃)‘6) = ((𝑃‘3) · (𝑃‘1)))
Theorem	veronesevrowd 51145*	The Veronese map at a point, expressed explicitly as a piecewise maps-to function on the six coordinates. (Contributed by Jiamin Zhao, 17-Aug-2026.)
⊢ (𝜑 → 𝑃 ∈ (ℝ ↑m (1...3)))    ⇒   ⊢ (𝜑 → (veronese‘𝑃) = (𝑘 ∈ (1...6) ↦ if(𝑘 = 1, ((𝑃‘1)↑2), if(𝑘 = 2, ((𝑃‘2)↑2), if(𝑘 = 3, ((𝑃‘3)↑2), if(𝑘 = 4, ((𝑃‘1) · (𝑃‘2)), if(𝑘 = 5, ((𝑃‘2) · (𝑃‘3)), ((𝑃‘3) · (𝑃‘1)))))))))
Theorem	veronesematbasd 51146*	The matrix whose 𝑖-th row is the Veronese image of 𝐴‘𝑖 belongs to the base set of (1...6) Mat ℝfld. (Contributed by Jiamin Zhao, 19-Aug-2026.)
⊢ 𝑉 = (𝑖 ∈ (1...6), 𝑗 ∈ (1...6) ↦ ((veronese‘(𝐴‘𝑖))‘𝑗))    &   ⊢ (𝜑 → 𝐴:(1...6)⟶(ℝ ↑m (1...3)))    ⇒   ⊢ (𝜑 → 𝑉 ∈ (Base‘((1...6) Mat ℝfld)))
Theorem	veronesematrowd 51147*	Currying the Veronese matrix gives the indexed family of Veronese images of the points 𝐴‘𝑖. (Contributed by Jiamin Zhao, 19-Aug-2026.)
⊢ 𝑉 = (𝑖 ∈ (1...6), 𝑗 ∈ (1...6) ↦ ((veronese‘(𝐴‘𝑖))‘𝑗))    &   ⊢ (𝜑 → 𝐴:(1...6)⟶(ℝ ↑m (1...3)))    ⇒   ⊢ (𝜑 → curry 𝑉 = (𝑖 ∈ (1...6) ↦ (veronese‘(𝐴‘𝑖))))
Theorem	veronesematrowexpd 51148*	Currying the Veronese matrix gives the indexed family of Veronese images, with each image expressed explicitly by coordinates. (Contributed by Jiamin Zhao, 19-Aug-2026.)
⊢ 𝑉 = (𝑖 ∈ (1...6), 𝑗 ∈ (1...6) ↦ ((veronese‘(𝐴‘𝑖))‘𝑗))    &   ⊢ (𝜑 → 𝐴:(1...6)⟶(ℝ ↑m (1...3)))    ⇒   ⊢ (𝜑 → curry 𝑉 = (𝑖 ∈ (1...6) ↦ (𝑘 ∈ (1...6) ↦ if(𝑘 = 1, (((𝐴‘𝑖)‘1)↑2), if(𝑘 = 2, (((𝐴‘𝑖)‘2)↑2), if(𝑘 = 3, (((𝐴‘𝑖)‘3)↑2), if(𝑘 = 4, (((𝐴‘𝑖)‘1) · ((𝐴‘𝑖)‘2)), if(𝑘 = 5, (((𝐴‘𝑖)‘2) · ((𝐴‘𝑖)‘3)), (((𝐴‘𝑖)‘3) · ((𝐴‘𝑖)‘1))))))))))
Theorem	veroquadgsumlem 51149*	Lemma for veroquadmodzerod 51150. Express the common homogeneous quadratic equation in ℝfld Σg form using the Veronese matrix 𝑉. (Contributed by Jiamin Zhao, 19-Aug-2026.)
⊢ 𝑉 = (𝑖 ∈ (1...6), 𝑗 ∈ (1...6) ↦ ((veronese‘(𝐴‘𝑖))‘𝑗))    &   ⊢ (𝜑 → 𝐴:(1...6)⟶(ℝ ↑m (1...3)))    &   ⊢ (𝜑 → 𝐾:(1...6)⟶ℝ)    &   ⊢ ((𝜑 ∧ 𝑖 ∈ (1...6)) → (((((𝐾‘1) · (((𝐴‘𝑖)‘1)↑2)) + ((𝐾‘2) · (((𝐴‘𝑖)‘2)↑2))) + ((𝐾‘3) · (((𝐴‘𝑖)‘3)↑2))) + ((((𝐾‘4) · (((𝐴‘𝑖)‘1) · ((𝐴‘𝑖)‘2))) + ((𝐾‘5) · (((𝐴‘𝑖)‘2) · ((𝐴‘𝑖)‘3)))) + ((𝐾‘6) · (((𝐴‘𝑖)‘3) · ((𝐴‘𝑖)‘1))))) = 0)    ⇒   ⊢ ((𝜑 ∧ 𝑖 ∈ (1...6)) → (ℝfld Σg (𝑗 ∈ (1...6) ↦ ((𝐾‘𝑗) · ((curry 𝑉‘𝑖)‘𝑗)))) = 0)
Theorem	veroquadmodzerod 51150*	The columns of the Veronese matrix, weighted by the coefficients 𝐾, sum to the zero vector of ℝfld freeLMod (1...6). (Contributed by Jiamin Zhao, 19-Aug-2026.)
⊢ 𝑉 = (𝑖 ∈ (1...6), 𝑗 ∈ (1...6) ↦ ((veronese‘(𝐴‘𝑖))‘𝑗))    &   ⊢ (𝜑 → 𝐴:(1...6)⟶(ℝ ↑m (1...3)))    &   ⊢ (𝜑 → 𝐾:(1...6)⟶ℝ)    &   ⊢ ((𝜑 ∧ 𝑖 ∈ (1...6)) → (((((𝐾‘1) · (((𝐴‘𝑖)‘1)↑2)) + ((𝐾‘2) · (((𝐴‘𝑖)‘2)↑2))) + ((𝐾‘3) · (((𝐴‘𝑖)‘3)↑2))) + ((((𝐾‘4) · (((𝐴‘𝑖)‘1) · ((𝐴‘𝑖)‘2))) + ((𝐾‘5) · (((𝐴‘𝑖)‘2) · ((𝐴‘𝑖)‘3)))) + ((𝐾‘6) · (((𝐴‘𝑖)‘3) · ((𝐴‘𝑖)‘1))))) = 0)    ⇒   ⊢ (𝜑 → ((ℝfld freeLMod (1...6)) Σg (𝐾 ∘f ( ·𝑠 ‘(ℝfld freeLMod (1...6)))curry tpos 𝑉)) = (0g‘(ℝfld freeLMod (1...6))))
Theorem	veroquadnolindfd 51151*	A nonzero homogeneous quadratic equation satisfied by all six points gives a linear dependence among the columns of the Veronese matrix. (Contributed by Jiamin Zhao, 27-Aug-2026.)
⊢ 𝑉 = (𝑖 ∈ (1...6), 𝑗 ∈ (1...6) ↦ ((veronese‘(𝐴‘𝑖))‘𝑗))    &   ⊢ (𝜑 → 𝐴:(1...6)⟶(ℝ ↑m (1...3)))    &   ⊢ (𝜑 → 𝐾:(1...6)⟶ℝ)    &   ⊢ ((𝜑 ∧ 𝑖 ∈ (1...6)) → (((((𝐾‘1) · (((𝐴‘𝑖)‘1)↑2)) + ((𝐾‘2) · (((𝐴‘𝑖)‘2)↑2))) + ((𝐾‘3) · (((𝐴‘𝑖)‘3)↑2))) + ((((𝐾‘4) · (((𝐴‘𝑖)‘1) · ((𝐴‘𝑖)‘2))) + ((𝐾‘5) · (((𝐴‘𝑖)‘2) · ((𝐴‘𝑖)‘3)))) + ((𝐾‘6) · (((𝐴‘𝑖)‘3) · ((𝐴‘𝑖)‘1))))) = 0)    &   ⊢ (𝜑 → 𝐾 ≠ ((1...6) × {0}))    ⇒   ⊢ (𝜑 → ¬ curry tpos 𝑉 LIndF (ℝfld freeLMod (1...6)))
Theorem	veroquaddetzerod 51152*	The Veronese matrix of six points satisfying a common nonzero homogeneous quadratic equation has determinant zero. (Contributed by Jiamin Zhao, 27-Aug-2026.)
⊢ 𝑉 = (𝑖 ∈ (1...6), 𝑗 ∈ (1...6) ↦ ((veronese‘(𝐴‘𝑖))‘𝑗))    &   ⊢ (𝜑 → 𝐴:(1...6)⟶(ℝ ↑m (1...3)))    &   ⊢ (𝜑 → 𝐾:(1...6)⟶ℝ)    &   ⊢ ((𝜑 ∧ 𝑖 ∈ (1...6)) → (((((𝐾‘1) · (((𝐴‘𝑖)‘1)↑2)) + ((𝐾‘2) · (((𝐴‘𝑖)‘2)↑2))) + ((𝐾‘3) · (((𝐴‘𝑖)‘3)↑2))) + ((((𝐾‘4) · (((𝐴‘𝑖)‘1) · ((𝐴‘𝑖)‘2))) + ((𝐾‘5) · (((𝐴‘𝑖)‘2) · ((𝐴‘𝑖)‘3)))) + ((𝐾‘6) · (((𝐴‘𝑖)‘3) · ((𝐴‘𝑖)‘1))))) = 0)    &   ⊢ (𝜑 → 𝐾 ≠ ((1...6) × {0}))    ⇒   ⊢ (𝜑 → (((1...6) maDet ℝfld)‘𝑉) = 0)
21.58  Mathbox for Kunhao Zheng
21.58.1  Weighted AM-GM inequality
Theorem	amgmwlem 51153	Weighted version of amgmlem 27319. (Contributed by Kunhao Zheng, 19-Jun-2021.)
⊢ 𝑀 = (mulGrp‘ℂfld)    &   ⊢ (𝜑 → 𝐴 ∈ Fin)    &   ⊢ (𝜑 → 𝐴 ≠ ∅)    &   ⊢ (𝜑 → 𝐹:𝐴⟶ℝ+)    &   ⊢ (𝜑 → 𝑊:𝐴⟶ℝ+)    &   ⊢ (𝜑 → (ℂfld Σg 𝑊) = 1)    ⇒   ⊢ (𝜑 → (𝑀 Σg (𝐹 ∘f ↑𝑐𝑊)) ≤ (ℂfld Σg (𝐹 ∘f · 𝑊)))
Theorem	amgmlemALT 51154	Alternate proof of amgmlem 27319 using amgmwlem 51153. (Contributed by Kunhao Zheng, 20-Jun-2021.) (Proof modification is discouraged.) (New usage is discouraged.)
⊢ 𝑀 = (mulGrp‘ℂfld)    &   ⊢ (𝜑 → 𝐴 ∈ Fin)    &   ⊢ (𝜑 → 𝐴 ≠ ∅)    &   ⊢ (𝜑 → 𝐹:𝐴⟶ℝ+)    ⇒   ⊢ (𝜑 → ((𝑀 Σg 𝐹)↑𝑐(1 / (♯‘𝐴))) ≤ ((ℂfld Σg 𝐹) / (♯‘𝐴)))
Theorem	amgmw2d 51155	Weighted arithmetic-geometric mean inequality for 𝑛 = 2 (compare amgm2d 45289). (Contributed by Kunhao Zheng, 20-Jun-2021.)
⊢ (𝜑 → 𝐴 ∈ ℝ+)    &   ⊢ (𝜑 → 𝑃 ∈ ℝ+)    &   ⊢ (𝜑 → 𝐵 ∈ ℝ+)    &   ⊢ (𝜑 → 𝑄 ∈ ℝ+)    &   ⊢ (𝜑 → (𝑃 + 𝑄) = 1)    ⇒   ⊢ (𝜑 → ((𝐴↑𝑐𝑃) · (𝐵↑𝑐𝑄)) ≤ ((𝐴 · 𝑃) + (𝐵 · 𝑄)))
Theorem	young2d 51156	Young's inequality for 𝑛 = 2, a direct application of amgmw2d 51155. (Contributed by Kunhao Zheng, 6-Jul-2021.)
⊢ (𝜑 → 𝐴 ∈ ℝ+)    &   ⊢ (𝜑 → 𝑃 ∈ ℝ+)    &   ⊢ (𝜑 → 𝐵 ∈ ℝ+)    &   ⊢ (𝜑 → 𝑄 ∈ ℝ+)    &   ⊢ (𝜑 → ((1 / 𝑃) + (1 / 𝑄)) = 1)    ⇒   ⊢ (𝜑 → (𝐴 · 𝐵) ≤ (((𝐴↑𝑐𝑃) / 𝑃) + ((𝐵↑𝑐𝑄) / 𝑄)))

< Previous  Wrap >