# Thread:

1. ## Affine space.

Let X be an affine space in F^n and let Y be an affine space in F^k. We look now on the next Cartesian product:

X x Y = {(x,y)| x in X, y in Y} c F^n x F^k =~F^(n+k)

Prove that if to think on X x Y as subset of F^(n+k) under the identification:

((x_1,...,x_n),(y_1,...,y_k)) =(x_1,...,x_n,y_1,...,y_k)

so we get an affine space.

2. Originally Posted by Also sprach Zarathustra
Let X be an affine space in F^n and let Y be an affine space in F^k. We look now on the next Cartesian product:

X x Y = {(x,y)| x in X, y in Y} c F^n x F^k =~F^(n+k)

Prove that if to think on X x Y as subset of F^(n+k) under the identification:

((x_1,...,x_n),(y_1,...,y_k)) =(x_1,...,x_n,y_1,...,y_k)

so we get an affine space.
What is your question here? what are $X,Y$? are they simply subsets? remember that when you talk about affine space you're simply talking about $\mathbb{F}^n$ for some $n$ without the usual vector space structure. Are you by any chance talking about algebraic subsets (zeroes of polynomials)? Please make a clear question!
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 3, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.8090872168540955, "perplexity_flag": "middle"}