Talk:Geometric algebra

This is maybe too big for a task

I'm pretty sure people will say that, and maybe they're right. But maybe not. I don't think it is much more complicated than say Quaternion type, and in any case it is, from both the programming and mathematical points of view,, quite interesting and worth featuring in Rosetta Code, imho. Please feel free to argue about it.--Grondilu (talk) 22:38, 13 October 2015 (UTC)

It's not clear that we can meaningfully implement anything with infinite dimension - countable or not. At best, we can support a finite subset of such a thing.

More specifically, how would we tell whether an implementation has or has not satisfied that part of the task requirement? --Rdm (talk) 12:36, 14 October 2015 (UTC)

It's infinite in the sense that there is no limit to the number of dimensions. But we only consider vectors that have a finite support. I guess I could mention that, indeed. It's also true that it's not obvious how we can check that an implementation can handle any vector size. I welcome suggestions.--Grondilu (talk) 15:56, 14 October 2015 (UTC)

I would describe that as an arbitrary number of dimensions rather than an infinite number of dimensions. But that brings up another issue: Failed to parse (syntax error): {\displaystyle \forall \mathbf{x}\in\mathcal{V},\,\mathbf{x}^2\in\R \end{array}} - unless we severely constrain our work, how are we going to verify that an implementation has satisfied this task in that regard? --Rdm (talk) 16:25, 14 October 2015 (UTC)