a. the linear combination αf + βg is in the set
b. this satisfies closure, from whence follow the remaining axioms
if applicable.
As an illusration, consider an operator qcq , L: D → ℝℝ , where D is some set of functions , and ℝℝ is the set of all real valued functions of a real variable.
L is linear, ie, is a linear space if , ∀y∈D, ∀z∈D, ∀α∈ℝ , ∀β∈ℝ
L(αy+βz)= αL(y)+βL(z)
This suggests some meaning. Viz., that operations on / properties of the whole are equal to sums of operations on / props of the parts.
This property appears to be akin to that of self-similarity, suggesting a rather profound meaning for the character of natural organization.
The ubiquity of linearity in the abstract algebra by which we represent natural systems** (as noted earlier) has such consequences as the integrable character of physical law (discussed elsewhere).
** if theory were complete then one could say up to an isomorphism, ie, the mathematical formalism is in a one-to-one, onto and domain-covering image of the fields of the physical system being described.
2 comments:
Can linear systems be solved in less than O(n) time? Yes, if you're using a quantum algorithm, according to this: http://arxiv.org/abs/0811.3171
Word!
When I last stopped reading about QUIT algorithms (around 2001) I was still stuck with that one.
http://arxiv.org/abs/quant-ph/9708016
Was hoping to revisit q-algorithmics with better grasp this time.
Thanks for this paper. It's good that it works on the clear problem of lin. systems.
PS. having reviewed some of the refered papers , eg, Aharoni's, it seems not much advances took place between Shor & Mosca and 2003?
Post a Comment