Skip to main content
added 998 characters in body
Source Link
Arctic Char
  • 17.2k
  • 1
  • 15
  • 26

For your concern about Kodaira embedding theorem:

This answer slot available for anyone to usefollows from the inverse function theorem and is completely local (being an analytic subvariety is an local condition).

Let $k\le n$, $U\subset \mathbb C^k$ be open and $f : U \to \mathbb C^n$ be a holomorphic map so that it is immersed at $p\in U$. By composing with a complex linear map $\mathbb C^n \to \mathbb C^n$, we assume $$ \operatorname{Im} df(p) = \mathbb C^k \times \{0\} \subset \mathbb C^n.$$

Then the function $$ F: U\times \mathbb C^{n-k} \to \mathbb C^n, \ \ \ F(z, u) = f(z) + (0,u)$$

has invertible $dF (p, 0)$. Thus there is $V\subset U \times \mathbb C^{n-k}$, W\subset \mathbb C^n$ so that $F : V \to W$ is a biholomorphism, and in particular,

\begin{align} \operatorname{Im} f (U\cap V) &= \{ F(z, u) : u_1 = \cdots u_{n-k} = 0\}\\ &= \{ w \in W : F^{-1}\circ u_1 = \cdots =F^{-1}\circ u_{n-k} = 0\}. \end{align}

and $F^{-1} \circ u_i$ are holomorphic functions on $W$. Thus the image is an analytic subvariety.

If your concern is why

This answer slot available for anyone to use.

For your concern about Kodaira embedding theorem:

This follows from the inverse function theorem and is completely local (being an analytic subvariety is an local condition).

Let $k\le n$, $U\subset \mathbb C^k$ be open and $f : U \to \mathbb C^n$ be a holomorphic map so that it is immersed at $p\in U$. By composing with a complex linear map $\mathbb C^n \to \mathbb C^n$, we assume $$ \operatorname{Im} df(p) = \mathbb C^k \times \{0\} \subset \mathbb C^n.$$

Then the function $$ F: U\times \mathbb C^{n-k} \to \mathbb C^n, \ \ \ F(z, u) = f(z) + (0,u)$$

has invertible $dF (p, 0)$. Thus there is $V\subset U \times \mathbb C^{n-k}$, W\subset \mathbb C^n$ so that $F : V \to W$ is a biholomorphism, and in particular,

\begin{align} \operatorname{Im} f (U\cap V) &= \{ F(z, u) : u_1 = \cdots u_{n-k} = 0\}\\ &= \{ w \in W : F^{-1}\circ u_1 = \cdots =F^{-1}\circ u_{n-k} = 0\}. \end{align}

and $F^{-1} \circ u_i$ are holomorphic functions on $W$. Thus the image is an analytic subvariety.

If your concern is why

Post Undeleted by user2661923
Post Deleted by user2661923
Post Undeleted by user2661923
Post Deleted by user2661923
added 46 characters in body
Source Link
user2661923
  • 43.1k
  • 12
  • 15

Solve alphanumeric puzzle $(HE) \times (EH) = (WHEW).$

This is a self-answer query. I came across a recent mathSE query that presented an interesting problem, and took some time solving it. When I lookedanswer slot available for the query to respond, I couldn't find it. I suspect that the problem may have been closed or deleted.

The real challenge is to avoid brute force and to present a completely analytical solution. That is why I think it is worthwhile to present the problem and solution.

Problem
In the multiplication problem below, the letter $H$ is used to symbolize the same digit (one of the values $0$ through $9$) throughout the problem.
Similarly, the letter $E$ symbolizes a specific digit throughout the problem, and the letter $W$ symbolizes a specific digit throughout the problem.

The letters $H,E,W$ symbolize different digits from each other. No number is allowedanyone to have its leftmost digit $= 0$. Therefore, you know immediately that none of $H,E,$ or $W$ can equal $0$.

\begin{array}{ r r r r} & & H & E \\ \times & & E & H \\ \hline W & H & E & W \\ \end{array}

Determine the values for $H,E,$ and $W$use.

======

Answer:

! Since $H \times E \equiv W \pmod{10},$ and $H,E,W$ are all distinct, you know that neither $H$ nor $E$ can equal $1$. Similarly, since $W \neq 0$, you know that neither $H$ nor $E$ can equal $5$. Therefore, you also know that $W \neq 5$.
!
! So, at this point, you know that $H,E \in \{2,3,4,6,7,8,9\}$ and
! that $W \in \{1,2,3,4,6,7,8,9\}.$
! ! You also know that $W = 9$ is impossible, because that would prevent either $H$ or $E$ from equaling $9$. Then, the largest possible product would be $(87 \times 78) < 9000$, which would violate the constraint that the leftmost digit of the product is $W = 9$.
!
! Similarly, $W$ can't equal $8$, because $97 \times 79 < 8000.$ ! ! So, at this point, you know that $W \in \{1,2,3,4,6,7\}.$
! ! If $W = 3$, then $H \times E \equiv W = 3\pmod{10}$.
! Therefore, $H$ and $E$ must both be \in {3,7,9}.$ >! The only possibility here, $H,E$ = 7,9$, in some order, is impossible because $(79) \times (97) > 3999.$ !
! So, at this point, you know that $W \in \{1,2,4,6,7\}.$ !
! $W = 1$ is impossible, because that would require $H,E = 7,3$,
! some order, and $(37) \times (73) > 1999.$ ! ! So, at this point, you know that $W \in \{2,4,6,7\}.$ ! ! $W = 7$ is impossible, because that would require $H,E = 9,3$,
! in some order, and $(39) \times (93) < 7000.$ ! ! So, at this point, you know that $W \in \{2,4,6\}.$ ! ! Suppose that $(10)H + E$ \equiv k \pmod{9} ~:~ k \in {1,2,\cdots,9}.$ >! By [Casting out 9's](https://en.wikipedia.org/wiki/Casting_out_nines) you know that $(10)E + H$ and $(E + H)$ are each also $\equiv k\pmod{9}$. >! >! This implies that $(2W) + H + E \equiv k^2 \pmod{9} \implies $ >! $2W \equiv (k^2 - k) = k(k-1) \pmod{9}.$ >! >! As $k$ ranges from $1$ through $9$, $k(K-1)$ is never equal to either $8$ or $4$ \pmod{9}.$ ! ! From this you know that $w$ can't equal either $2$ or $4$, so $w = 6$
! and $H,E \in \{2,3,4,7,8,9\}$. ! ! Further, since $59 times 95 < 6000$, you know that
! $H,E \in \{7,8,9\}.$ ! ! Therefore, $H,E$ = $7,8$, in some order.
! Since $78 \times 87 = 6786$, you know that $H,E = 7,8.$ respectively.

Solve alphanumeric puzzle $(HE) \times (EH) = (WHEW).$

This is a self-answer query. I came across a recent mathSE query that presented an interesting problem, and took some time solving it. When I looked for the query to respond, I couldn't find it. I suspect that the problem may have been closed or deleted.

The real challenge is to avoid brute force and to present a completely analytical solution. That is why I think it is worthwhile to present the problem and solution.

Problem
In the multiplication problem below, the letter $H$ is used to symbolize the same digit (one of the values $0$ through $9$) throughout the problem.
Similarly, the letter $E$ symbolizes a specific digit throughout the problem, and the letter $W$ symbolizes a specific digit throughout the problem.

The letters $H,E,W$ symbolize different digits from each other. No number is allowed to have its leftmost digit $= 0$. Therefore, you know immediately that none of $H,E,$ or $W$ can equal $0$.

\begin{array}{ r r r r} & & H & E \\ \times & & E & H \\ \hline W & H & E & W \\ \end{array}

Determine the values for $H,E,$ and $W$.

======

Answer:

! Since $H \times E \equiv W \pmod{10},$ and $H,E,W$ are all distinct, you know that neither $H$ nor $E$ can equal $1$. Similarly, since $W \neq 0$, you know that neither $H$ nor $E$ can equal $5$. Therefore, you also know that $W \neq 5$.
!
! So, at this point, you know that $H,E \in \{2,3,4,6,7,8,9\}$ and
! that $W \in \{1,2,3,4,6,7,8,9\}.$
! ! You also know that $W = 9$ is impossible, because that would prevent either $H$ or $E$ from equaling $9$. Then, the largest possible product would be $(87 \times 78) < 9000$, which would violate the constraint that the leftmost digit of the product is $W = 9$.
!
! Similarly, $W$ can't equal $8$, because $97 \times 79 < 8000.$ ! ! So, at this point, you know that $W \in \{1,2,3,4,6,7\}.$
! ! If $W = 3$, then $H \times E \equiv W = 3\pmod{10}$.
! Therefore, $H$ and $E$ must both be \in {3,7,9}.$ >! The only possibility here, $H,E$ = 7,9$, in some order, is impossible because $(79) \times (97) > 3999.$ !
! So, at this point, you know that $W \in \{1,2,4,6,7\}.$ !
! $W = 1$ is impossible, because that would require $H,E = 7,3$,
! some order, and $(37) \times (73) > 1999.$ ! ! So, at this point, you know that $W \in \{2,4,6,7\}.$ ! ! $W = 7$ is impossible, because that would require $H,E = 9,3$,
! in some order, and $(39) \times (93) < 7000.$ ! ! So, at this point, you know that $W \in \{2,4,6\}.$ ! ! Suppose that $(10)H + E$ \equiv k \pmod{9} ~:~ k \in {1,2,\cdots,9}.$ >! By [Casting out 9's](https://en.wikipedia.org/wiki/Casting_out_nines) you know that $(10)E + H$ and $(E + H)$ are each also $\equiv k\pmod{9}$. >! >! This implies that $(2W) + H + E \equiv k^2 \pmod{9} \implies $ >! $2W \equiv (k^2 - k) = k(k-1) \pmod{9}.$ >! >! As $k$ ranges from $1$ through $9$, $k(K-1)$ is never equal to either $8$ or $4$ \pmod{9}.$ ! ! From this you know that $w$ can't equal either $2$ or $4$, so $w = 6$
! and $H,E \in \{2,3,4,7,8,9\}$. ! ! Further, since $59 times 95 < 6000$, you know that
! $H,E \in \{7,8,9\}.$ ! ! Therefore, $H,E$ = $7,8$, in some order.
! Since $78 \times 87 = 6786$, you know that $H,E = 7,8.$ respectively.

This answer slot available for anyone to use.

added 6 characters in body
Source Link
user2661923
  • 43.1k
  • 12
  • 15

! Since $H \times E \equiv W \pmod{10}, and $H$H \times E \equiv W \pmod{10},$ and $H,E,W$ are all distinct,E you know that neither $H$ nor $E$ can equal $1$. Similarly,W$ are all distinct, you know that neither $H$ nor $E$ can equal $1$. Similarly, since $W \neq 0$, you know that neither $H$ nor $E$ can equal $5$. Therefore, you also know that $W \neq 5$. !> !> So, at this point, you know that $H since $W \neq 0$,E \in you know that neither {2$H$ nor $E$ can equal $5$. Therefore,3 you also know that $W \neq 5$.
!
! So,4 at this point,6 you know that $H,E \in \{2,3,4,6,7,8,9\}$ and
! that $W \in \{1,2,3,4,6,7,8,9\}.$
! ! You also know that $W = 9$ is impossible,7 because that would prevent either $H$ or $E$ from equaling $9$. Then,8 the largest possible product would be $(87 \times 78) < 9000$,9}$ and !> that $W \in which would violate the constraint that the leftmost digit of the product is {1$W = 9$.
!
! Similarly,2 $W$ can't equal $8$,3 because $97 \times 79 < 8000.$ ! ! So,4 at this point,6 you know that $W \in \{1,2,3,4,6,7\}.$
! ! If $W = 3$,7 then $H \times E \equiv W = 3\pmod{10}$.
! Therefore,8 $H$ and $E$ must both be \in {3,7,9}.$ !> !> You also know that $W = 9$ is impossible, because that would prevent either $$ >! The only possibility here, $H$ or $,E$ from equaling $9$. Then, the largest possible product would be $(87 \times 78) < 9000$, which would violate the constraint that the leftmost digit of the product is $W = 9$. !> !> Similarly, $W$ can't equal $8$, because $97 \times 79 < 8000.$ !> !> So, at this point, you know that $W \in$ = 7,9$, in some order, is impossible because {1$(79) \times (97) > 3999.$ !
! So,2 at this point,3 you know that $W \in \{1,2,4,6,7\}.$ !
! $W = 1$ is impossible,4 because that would require $H,E = 7,3$,6
! some order,7}.$ !> !> If $W = 3$, then $H \times E \equiv W = 3\pmod{10}$. !> Therefore, $H$ and $E$ must both be \in \{3,7,9\}.$ and $(37) \times (73) > 1999.$ ! ! So, at this point, you know that $W \in \{2,4,6,7\}.$ ! ! $W = 7$ is impossible, because that would require $H,E = 9,3$,
!> The only possibility here in some order, and $H,E$ = 7$(39) \times (93) < 7000.$ ! ! So,9$, in some order, is impossible because $(79) \times at this point, you know that (97) > 3999.$ !> !> So, at this point, you know that $W$W \in \{2,4,6\}.$ ! ! Suppose that $(10)H + E$ \equiv k \pmod{9} ~:~ k \in {1,2,4,6\cdots,79}.$ !> !> $W = 1$ is impossible, because that would require $H,E = 7,3$, !> some order, and $$ >! By [Casting out 9's](https://en.wikipedia.org/wiki/Casting_out_nines) you know that $(3710) \times E + H$ and $(73E + H) > 1999.$ !> !> So, at this point, you know that $W \in $ are each also $\equiv k\pmod{2,4,6,79}.$ !> !> $W = 7$ is impossible, because that would require $H,E = 9,3$, !> in some order, and $$. >! >! This implies that $(392W) \times+ H + E \equiv k^2 \pmod{9} \implies $ >! $2W \equiv (93) < 7000.$ !> !> So, at this point, you know that $W \ink^2 - k) = k(k-1) \pmod{2,4,69}.$ !> !> Suppose that $$ >! >! As $k$ ranges from $1$ through $9$, $k(10K-1)H + E$ \equiv k \pmod{9} ~:~ k \in \{1,2,\cdots,9\}.$$ is never equal to either $8$ or $4$ \pmod{9}.$ By Casting out 9's! ! From this you know that that $(10)E + H$ and$w$ can't equal either $(E + H)$ are each also$2$ or $\equiv k\pmod{9}$$4$, so $w = 6$
! and $H,E \in \{2,3,4,7,8,9\}$. !> !> This implies that Further, since $(2W) + H + E \equiv k^2 \pmod{9} \implies $$59 times 95 < 6000$, you know that
$2W \equiv (k^2 - k) = k(k-1) \pmod{9}.$! $H,E \in \{7,8,9\}.$ !> !> As $k$ ranges from $1$ through $9$ Therefore, $k(K-1)$ is never equal to either $8$ or $4$ \pmod{9}.$ !> !> From this you know that $w$ can't equal either $2$ or $4$, so $w$H,E$ = 6$ <br> and $H,E \in {2,3,4,7,8,9}$. !> !> Further, since $59 times 95 < 6000$, you know that !> $H,E \in {7,8$7,8$,9} in some order.$ !> !> Therefore, $H,E$ = $7,8$, in some order. !> Since $78 \times 87 = 6786$, you know that $H,E = 7
! Since $78 \times 87 = 6786$,8.$ you know that $H,E = 7,8.$ respectively.

! Since $H \times E \equiv W \pmod{10}, and $H,E,W$ are all distinct, you know that neither $H$ nor $E$ can equal $1$. Similarly, since $W \neq 0$, you know that neither $H$ nor $E$ can equal $5$. Therefore, you also know that $W \neq 5$. !> !> So, at this point, you know that $H,E \in {2,3,4,6,7,8,9}$ and !> that $W \in {1,2,3,4,6,7,8,9}.$ !> !> You also know that $W = 9$ is impossible, because that would prevent either $H$ or $E$ from equaling $9$. Then, the largest possible product would be $(87 \times 78) < 9000$, which would violate the constraint that the leftmost digit of the product is $W = 9$. !> !> Similarly, $W$ can't equal $8$, because $97 \times 79 < 8000.$ !> !> So, at this point, you know that $W \in {1,2,3,4,6,7}.$ !> !> If $W = 3$, then $H \times E \equiv W = 3\pmod{10}$. !> Therefore, $H$ and $E$ must both be \in \{3,7,9\}.$
!> The only possibility here, $H,E$ = 7,9$, in some order, is impossible because $(79) \times (97) > 3999.$ !> !> So, at this point, you know that $W \in {1,2,4,6,7}.$ !> !> $W = 1$ is impossible, because that would require $H,E = 7,3$, !> some order, and $(37) \times (73) > 1999.$ !> !> So, at this point, you know that $W \in {2,4,6,7}.$ !> !> $W = 7$ is impossible, because that would require $H,E = 9,3$, !> in some order, and $(39) \times (93) < 7000.$ !> !> So, at this point, you know that $W \in {2,4,6}.$ !> !> Suppose that $(10)H + E$ \equiv k \pmod{9} ~:~ k \in \{1,2,\cdots,9\}.$ By Casting out 9's you know that $(10)E + H$ and $(E + H)$ are each also $\equiv k\pmod{9}$. !> !> This implies that $(2W) + H + E \equiv k^2 \pmod{9} \implies $
$2W \equiv (k^2 - k) = k(k-1) \pmod{9}.$ !> !> As $k$ ranges from $1$ through $9$, $k(K-1)$ is never equal to either $8$ or $4$ \pmod{9}.$ !> !> From this you know that $w$ can't equal either $2$ or $4$, so $w = 6$ <br> and $H,E \in {2,3,4,7,8,9}$. !> !> Further, since $59 times 95 < 6000$, you know that !> $H,E \in {7,8,9}.$ !> !> Therefore, $H,E$ = $7,8$, in some order. !> Since $78 \times 87 = 6786$, you know that $H,E = 7,8.$ respectively.

! Since $H \times E \equiv W \pmod{10},$ and $H,E,W$ are all distinct, you know that neither $H$ nor $E$ can equal $1$. Similarly, since $W \neq 0$, you know that neither $H$ nor $E$ can equal $5$. Therefore, you also know that $W \neq 5$.
!
! So, at this point, you know that $H,E \in \{2,3,4,6,7,8,9\}$ and
! that $W \in \{1,2,3,4,6,7,8,9\}.$
! ! You also know that $W = 9$ is impossible, because that would prevent either $H$ or $E$ from equaling $9$. Then, the largest possible product would be $(87 \times 78) < 9000$, which would violate the constraint that the leftmost digit of the product is $W = 9$.
!
! Similarly, $W$ can't equal $8$, because $97 \times 79 < 8000.$ ! ! So, at this point, you know that $W \in \{1,2,3,4,6,7\}.$
! ! If $W = 3$, then $H \times E \equiv W = 3\pmod{10}$.
! Therefore, $H$ and $E$ must both be \in {3,7,9}.$ >! The only possibility here, $H,E$ = 7,9$, in some order, is impossible because $(79) \times (97) > 3999.$ !
! So, at this point, you know that $W \in \{1,2,4,6,7\}.$ !
! $W = 1$ is impossible, because that would require $H,E = 7,3$,
! some order, and $(37) \times (73) > 1999.$ ! ! So, at this point, you know that $W \in \{2,4,6,7\}.$ ! ! $W = 7$ is impossible, because that would require $H,E = 9,3$,
! in some order, and $(39) \times (93) < 7000.$ ! ! So, at this point, you know that $W \in \{2,4,6\}.$ ! ! Suppose that $(10)H + E$ \equiv k \pmod{9} ~:~ k \in {1,2,\cdots,9}.$ >! By [Casting out 9's](https://en.wikipedia.org/wiki/Casting_out_nines) you know that $(10)E + H$ and $(E + H)$ are each also $\equiv k\pmod{9}$. >! >! This implies that $(2W) + H + E \equiv k^2 \pmod{9} \implies $ >! $2W \equiv (k^2 - k) = k(k-1) \pmod{9}.$ >! >! As $k$ ranges from $1$ through $9$, $k(K-1)$ is never equal to either $8$ or $4$ \pmod{9}.$ ! ! From this you know that $w$ can't equal either $2$ or $4$, so $w = 6$
! and $H,E \in \{2,3,4,7,8,9\}$. ! ! Further, since $59 times 95 < 6000$, you know that
! $H,E \in \{7,8,9\}.$ ! ! Therefore, $H,E$ = $7,8$, in some order.
! Since $78 \times 87 = 6786$, you know that $H,E = 7,8.$ respectively.

Source Link
user2661923
  • 43.1k
  • 12
  • 15
Loading
Post Made Community Wiki by user2661923