Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Lets $G$ is finite abelian group (such that for any $x\in G$ $x+x=0$, i.e. $G=\mathbb{Z}_{2}^{\oplus k}$ for some $k\in\mathbb{N}$) and $(\cdot,\cdot):G\times G\to \mathbb{Z}_{2}$ is symmetrical bilinear form.

Know that: $$(a, m)=0,$$ $$(a, p)=1,$$ $$(b, m)=1,$$ $$(b, p)=0.$$

Is it true that $$(a, b) = 1?$$


share|cite|improve this question
The "i.e." is incorrect. Nothing before that excludes the possibility that $G$ is infinite. – joriki Mar 1 '12 at 9:03
@joriki: Lets $G$ is finite – Aspirin Mar 1 '12 at 9:05

No, this is not true: Take the canonical dot product, with $k=2$, $a=p=(0,1)$, $b=m=(1,0)$.

share|cite|improve this answer

It can go either way. Consider $k=3$ and the bilinear form defined by the usual inner product


Then we can arrange $a,b,p,m$ so that $(a,b)$ is either $0$ or $1$ to our liking:

$$\begin{array}{|c|c|c|}\hline a &(1,0,0) & (1,0,1) \\ b & (0,1,0) & (0,1,1) \\ p & (1,0,0) & (1,0,0) \\ m & (0,1,0) & (0,1,0) \\ \hline (a,b) & 0 & 1 \\ \hline \end{array} $$

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.