# Can A still be a key if two tuples are the same

I am studying database functional dependency. It says if A can functionally determine all other attributes, it is considered to be a key.

What if 2 tuples are exactly the same, can we still say A is a key? To me A cannot determine an unique tuple.

Theoretically, If $R$ is a relation with the following set A of attributes $\{a_1, a_2,..., a_n\}$, then a primary key on the relation $R$ would be a subset $P \subset A$ such that for $F:P \rightarrow A$, we have $\forall x,y \in P$ $F(x)=F(y) \rightarrow x=y$. This basically just means that the primary key forms a one-to-one mapping from the domain of keys to the range of corresponding tuples.
If you have that two tuples are the same $A$ and $B$, then this implies that $A = B$,and we still have that $F(A)=F(B)$ so that there is no violation, in that sense.