Let $k$ be a fixed field. A skein relation defined on $k$ is a local relation on $k$-linear combination of oriented planar link diagrams saying that one can trade an overcrossing for an undercrossing by paying a price in the form of an error term which contains no crossings, and vice versa. More formally, it is a linear relation of the form $$ overcrossing = a\, undercrossing + b\, noncrossing $$ with $a,b\in k$, with $a\neq 0$. This last condition is what is needed to get the other way round relation $$ undercrossing = a^{-1}\, overcrossing - a^{-1}b\, noncrossing. $$ Moreover, if $b\neq 0$, which is the generic case, we can also write $$ noncrossing = b^{-1}overcrossing - ab^{-1}\, undercrossing. $$ The first two relations and Reidemeister relations allow one to reduce any closed link diagram to a $k$-linear combination of disjoint copies of unknot diagrams. Moreover, the third relation shows that two disjoint unknot diagrams are equivalent (under Reidemeister) to a certain scalar multiple of a single unknot, and so inductively that an arbitrary $k$-linear combination of disjoint copies of unknot diagrams is ultimately equivalent to some scalar multiple of a single unknot diagram. Then, adding a single relation of the form $$ unknot = c\, \emptyset $$ for some $c\in k$, we see that every closed link diagram is equivalent to a scalar multiple of the empty link diagram. Clearly if $c=0$ then this scalar multiple is zero, so in order to get a nontrivial result, let us assume $c\neq 0$. This shows that there exists at most a unique link invariant $$ P: \text{closed links in $\mathbb{R}^3$}/\text{isotopy} \to k $$ with $P(skein)=0$, $P(unknot)=c$ and $P(\emptyset)=1$. However the skein relation imposes a constraint on $c$ in order for $P$ to possibly exist. Namely, from $$ noncrossing = b^{-1}overcrossing - ab^{-1}\, undercrossing $$ we see that the disjoint union of two unknots is equivalent to $b^{-1}(1-a)$ times a single unknot, so we get the equation $$ c^2=cb^{-1}(1-a), $$ which, since we are assuming $c\neq 0$, determines $c$ as $$ c=\frac{1-a}{b} $$ For instance, for the Jones polynomial, $k=\mathbb{Q}(q)$, $a=q^4$ and $b=q-q^3$ so that $c=q+q^{-1}$ in this case (there are other possible conventions/normalizations for the Jones polynomial, this is the one I use).

The question is the following: is the necessary condition $c=(1-a)b^{-1}$ also sufficient to have a nontrivial closed link invariant $P$ with $P(skein)=0$, $P(unknot)=c$ and $P(\emptyset)=1$?

In other words, can it be shown that the reduction from a closed link diagram to a scalar multiple of an unknot diagram done using a skein relation and Reidmeister moves is always independent of the particular reduction process? (i.e., that two reductions necessarily lead to the same scalar multiple of the the value of the invariant on the unknot diagram?)

orienteddiagrams; otherwise the Jones polynomial doesn't satisfy the skein relation you've described. $\endgroup$