Let "book" be the set of all books and "Author" be the set of all authors. $\in$ denotes set membership.
Consider the following predicates:
short(x) is a predicate indicating x is a short book.
by(x,y) is a predicate indicating that book y was written by x.
Formalize each of the following sentences as a predicate logic formula using the above predicates:
i) "Every book has an author"
My answer : $∀b\in \text{ Books }\land ∃a\in \text{ Authors }$ii) "There is an author who has not written a book"
My answer: $∃a\in \text{ Authors } \land ∃b\in \text{ Books } \land ¬\text{by}\,(b,a)$iii)"Every author has written a short book"
My answer: $∀a \in \text{ Authors } \land ∃x\in \text{ Books } \land \text{ short}\,(x) \rightarrow \text{by}\,(x,a)$
I'll use the more customary $\in$ for “belongs to”. Your usage of the “and” connective is wrong.
“Every book has an author” should be
$$ \forall b(b\in\mathrm{Books} \to (\exists a(a\in\mathrm{Authors} \land \mathrm{by}(a,b)))) $$
If relativized quantifiers are allowed by the language, it could be $$ \forall b\in\mathrm{Books}(\exists a\in\mathrm{Authors}(\mathrm{by}(a,b))) $$
Your other formulas are similarly wrong.
Let's see how you can build the third formula from the ground up:
Translation: For every author, we can find a book which is short and whose author is the one we're talking about
So the book $b$ is short, $\mathrm{short}(b)$, and its author is $a$, $\mathrm{by}(a,b)$: the bulk of the formula is then $\mathrm{short}(b) \land \mathrm{by}(a,b)$. Now we can add the quantifiers.
$$ \forall a\in\mathrm{Authors}(\exists b\in\mathrm{Books}(\mathrm{short}(b) \land \mathrm{by}(a,b))) $$ Without relativized quantifiers: $$ \forall a(a\in\mathrm{Authors}\to(\exists b(b\in\mathrm{Books}\land (\mathrm{short}(b) \land \mathrm{by}(a,b))))) $$