Transforming Triangle in 3 Space with z = 1-x-y

  • Thread starter Thread starter albert281
  • Start date Start date
  • Tags Tags
    Transform Triangle
albert281
Messages
13
Reaction score
0
I am trying to transform a triangle in 3 space with the constraint that z = 1-x-y. At this point I have the following transformation matrix A, and three vector equations:

| a1 a2 a3 |
A = | a4 a5 a6 |
| a7 a8 a9 |



A*x1 = k1*y1
A*x2 = k2*y2
A*x3 = k3*y3




I know the vertices of both triangles, before and after the transformation. The problem is that I can't put the above description in a manner that is solveable...without some input to clarify the issue.

The transformed triangle points can move in a manner to suggest stretching and translation, but not rotation. Given that z is dependent on x and y, how can I constrain this problem such that I can generate n equations in n unknowns?
 
Physics news on Phys.org
I figured out how to solve for a7, a8 and a9 by using the constraint x+y+z=1 and solving for 3 equations in 3 unknowns. I found k1=k2=k3=1. I only have 6 equations in 6 unknowns left! Yay!
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top